diff --git a/README.md b/README.md index 1a274c15..eb0324be 100644 --- a/README.md +++ b/README.md @@ -159,41 +159,13 @@ If you want to contribute to Lattigo, have a feature proposal or request, to rep Please use the following BibTex entry for citing Lattigo: @misc{lattigo, - title = {Lattigo v4}, + title = {Lattigo v5}, howpublished = {Online: \url{https://github.com/tuneinsight/lattigo}}, - month = Aug, - year = 2022, + month = Nov, + year = 2023, note = {EPFL-LDS, Tune Insight SA} } -## References - -1. Efficient Bootstrapping for Approximate Homomorphic Encryption with Non-Sparse Keys - () -1. Bootstrapping for Approximate Homomorphic Encryption with Negligible Failure-Probability by Using Sparse-Secret Encapsulation - () -1. Somewhat Practical Fully Homomorphic Encryption () -1. Multiparty Homomorphic Encryption from Ring-Learning-With-Errors () -2. An Efficient Threshold Access-Structure for RLWE-Based Multiparty Homomorphic Encryption () -3. A Full RNS Variant of FV Like Somewhat Homomorphic Encryption Schemes - () -4. An Improved RNS Variant of the BFV Homomorphic Encryption Scheme - () -5. Homomorphic Encryption for Arithmetic of Approximate Numbers () -6. A Full RNS Variant of Approximate Homomorphic Encryption () -7. Improved Bootstrapping for Approximate Homomorphic Encryption -1. Fully Homomorphic Encryption without Bootstrapping () -1. Homomorphic Encryption for Arithmetic of Approximate Numbers () -1. A Full RNS Variant of Approximate Homomorphic Encryption () -1. Improved Bootstrapping for Approximate Homomorphic Encryption - () -8. Better Bootstrapping for Approximate Homomorphic Encryption () -9. Post-quantum key exchange - a new hope () -10. Faster arithmetic for number-theoretic transforms () -11. Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography - () -12. Gaussian sampling in lattice-based cryptography - () The Lattigo logo is a lattice-based version of the original Golang mascot by [Renee French](http://reneefrench.blogspot.com/). diff --git a/core/rlwe/README.md b/core/rlwe/README.md new file mode 100644 index 00000000..440dd11c --- /dev/null +++ b/core/rlwe/README.md @@ -0,0 +1,6 @@ +## References + +1. Somewhat Practical Fully Homomorphic Encryption () +2. Fully Homomorphic Encryption without Bootstrapping () +3. Efficient Homomorphic Conversion Between (Ring) LWE Ciphertexts () +4. HERMES: Efficient Ring Packing using MLWE Ciphertexts and Application to Transciphering () \ No newline at end of file diff --git a/he/hebin/README.md b/he/hebin/README.md new file mode 100644 index 00000000..00592df0 --- /dev/null +++ b/he/hebin/README.md @@ -0,0 +1,3 @@ +## References + +1. Efficient FHEW Bootstrapping with Small Evaluation Keys, and Applications to Threshold Homomorphic Encryption () \ No newline at end of file diff --git a/he/hefloat/README.md b/he/hefloat/README.md new file mode 100644 index 00000000..356925ca --- /dev/null +++ b/he/hefloat/README.md @@ -0,0 +1,3 @@ +## References + +1. Minimax Approximation of Sign Function by Composite Polynomial for Homomorphic Comparison () \ No newline at end of file diff --git a/he/hefloat/bootstrapping/README.md b/he/hefloat/bootstrapping/README.md new file mode 100644 index 00000000..cce909b8 --- /dev/null +++ b/he/hefloat/bootstrapping/README.md @@ -0,0 +1,11 @@ +## References + +1. Bootstrapping for Approximate Homomorphic Encryption () +2. Improved Bootstrapping for Approximate Homomorphic Encryption () +3. Better Bootstrapping for Approximate Homomorphic Encryption () +4. Faster Homomorphic Discrete Fourier Transforms and Improved FHE Bootstrapping () +5. Efficient Bootstrapping for Approximate Homomorphic Encryption with Non-Sparse Keys () +6. High-Precision Bootstrapping for Approximate Homomorphic Encryption by Error Variance Minimization () +7. High-Precision Bootstrapping of RNS-CKKS Homomorphic Encryption Using Optimal Minimax Polynomial Approximation and Inverse Sine Function () +8. Bootstrapping for Approximate Homomorphic Encryption with Negligible Failure-Probability by Using Sparse-Secret Encapsulation () +9. META-BTS: Bootstrapping Precision Beyond the Limit () \ No newline at end of file diff --git a/mhe/README.md b/mhe/README.md index 1c167702..37564952 100644 --- a/mhe/README.md +++ b/mhe/README.md @@ -165,3 +165,7 @@ While both protocol variants have slightly different local operations, their ste ##### 2.iii.b Decryption Once the receivers have obtained the ciphertext re-encrypted under their respective keys, they can use the usual decryption algorithm of the single-party scheme to obtain the plaintext result (see [rlwe.Decryptor](../rlwe/decryptor.go). +## References + +1. Multiparty Homomorphic Encryption from Ring-Learning-With-Errors () +2. An Efficient Threshold Access-Structure for RLWE-Based Multiparty Homomorphic Encryption () \ No newline at end of file diff --git a/ring/README.md b/ring/README.md new file mode 100644 index 00000000..7252eb5c --- /dev/null +++ b/ring/README.md @@ -0,0 +1,6 @@ +## References + +1. Faster arithmetic for number-theoretic transforms () +2. Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography () +3. Gaussian sampling in lattice-based cryptography () +4. Post-quantum key exchange - a new hope () \ No newline at end of file diff --git a/schemes/bgv/README.md b/schemes/bgv/README.md index b6bd8557..ab06390f 100644 --- a/schemes/bgv/README.md +++ b/schemes/bgv/README.md @@ -53,3 +53,9 @@ The above change enables an implementation of the BGV scheme with an MSB encodin This unified scheme can also be seen as a variant of the BGV scheme with two tensoring operations: - The BGV-style tensoring with a noise growth proportional to the current noise - The BFV-style tensoring with a noise growth invariant to the current noise + +## References + +1. Practical Bootstrapping in Quasilinear Time () +2. A Full RNS Variant of FV Like Somewhat Homomorphic Encryption Schemes () +3. An Improved RNS Variant of the BFV Homomorphic Encryption Scheme () diff --git a/schemes/ckks/README.md b/schemes/ckks/README.md index 56fbb006..a7274e78 100644 --- a/schemes/ckks/README.md +++ b/schemes/ckks/README.md @@ -167,3 +167,11 @@ entropy, by modifying their distribution to {(1-p)/2, p, (1-p)/2}, for any p bet for p>>1/3 can result in low Hamming weight keys (*sparse* keys). *We recall that it has been shown that the security of sparse keys can be considerably lower than that of fully entropic keys, and the CKKS security parameters should be re-evaluated if sparse keys are used*. + +## References + +1. Homomorphic Encryption for Arithmetic of Approximate Numbers () +2. A Full RNS Variant of Approximate Homomorphic Encryption () +3. Approximate Homomorphic Encryption over the Conjugate-invariant Ring () +4. Approximate Homomorphic Encryption with Reduced Approximation Error () +5. On the precision loss in approximate homomorphic encryption () \ No newline at end of file