A fully homomorphic encryption scheme with better key size

China Communications

Volumn 11, Issue 9, 2014, Pages 82-92

  Chen, Zhigang ^a,b,c   Wang, Jian ^a   Zhang, Zengnian ^b   Song, Xinxia ^b  

^a NANJING UNIVERSITY OF AERONAUTICS AND ASTRONAUTICS   (China)

^b ZHEJIANG WANLI UNIVERSITY   (China)

^c UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

concert parameters; fully homomorphic encryption; learning with error; public key encryption

Indexed keywords

EID: 84914106824     PISSN: 16735447     EISSN: None     Source Type: Journal    
DOI: 10.1109/CC.2014.6969773     Document Type: Article

References (20)

1. Craig Gentry. Fully Homomorphic Encryption Using Ideal Lattices [M]. Proceedings of the 41 st annual ACM symposium on Theory of computing. Bethesda, MD, USA; ACM. 2009: 169-178.
2. Marten van Dijk, Craig Gentry, Shai Halevi, V inod Vaikuntanathan. Fully Homomorphic Encryption over the Integers [Ml//GI LBERT H. Advances in Cryptology-Eurocrypt 2010. Springer Berlin/Heidelberg. 2010: 24-43.
3. Z. Brakerski, V. Vaikuntanathan. Efficient Fully Homomorphic Encryption from (Standard) Lwe [Ml//OSTROVSKY R. 2011 Ieee S2nd Annual Symposium on Foundations of Computer Science. Los Alamitos; IEEE Computer Society. 2011: 97-106.
4. Zvika Brakerski, Craig Gentry, V inod Vaikuntanathan. (Leveled) Fully Homomorphic Encryption without Bootstrapping [M]. Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. Cambridge, Massachusetts; ACM. 2012: 309-32S.
5. Zvika Brakerski. Fully Homomorphic Encryption without Modulus Switching from Classical Gapsvp [M]//SAFAVI-NAINI R, CANETTI R. Advances in Cryptology-Crypto 2012. Springer Berlin Heidelberg. 2012: 868-886.
6. Adriana Lopez-Alt, Eran Tromer, Vinod Vaikuntanathan. On-the-Fly Multiparty Computation on the Cloud Via Multikey Fully Homomorphic Encryption [M]. Proceedings of the 44th symposium on Theory of Computing. New York, New York, USA; ACM. 2012: 1219-1234.
7. Craig Gentry, Amit Sahai, Brent Waters. Homomorphic Encryption from Learning with Errors: Conceptua Ily-Si m p Ie r, Asym ptotica Ily-Faster, Attribute-Based [M]//CANETTI R, GARAY J. Advances in Cryptology-Crypto 2013. Springer Berlin Heidelberg. 2013: 75-92.
8. Craig Gentry, Shai Halevi, Nigel Smart. Fully Homomorphic Encryption with Polylog Overhead [Ml//POINTCHEVAL D, JOHANSSON T. Advances in Cryptology-Eurocrypt 2012. Springer Berlin/Heidelberg. 2012: 465-482.
9. Zvika Brakerski, Craig Gentry, Shai Halevi. Packed Ciphertexts in Lwe-Based Homomorphic Encryption [Ml//KUROSAWA K, HANAOKA G. Public-Key Cryptography-Pkc 2013. Springer Berlin Heidelberg. 2013: 1-13.
10. Zvika Brakerski, Adeline Langlois, Chris Peikert, Oded Regev, Damien Stehl, #233. Classical Hardness of Learning with Errors [M]. Proceedings of the 45th annual ACM symposium on Symposium on theory of computing. Palo Alto, California, USA; ACM. 2013: 575-584.
11. Daniele Micciancio, Chris Peikert. Hardness of Sis and Lwe with Small Parameters [Ml//CANETTI R, GARAY J. Advances in Cryptology-Crypto 2013. Springer Berlin Heidelberg. 2013: 21-39.
12. Shi Bai, Steven D. Galbraith. Lattice Decoding Attacks on Binary Lwe [J]. IACR Cryptology ePrint Archive, 2013, 2013(839.
13. MartinR Albrecht, Jean-Charles Faugere, Robert Fitzpatrick, Ludovic Perret. Lazy Modulus Switching for the Bkw Algorithm on Lwe [Ml//KRAWCZYK H. Public-Key Cryptography-Pkc 2014. Springer Berlin Heidelberg. 2014: 429-445.
14. Richard Lindner, Chris Peikert. Better Key Sizes (and Attacks) for Lwe-Based Encryption [Ml//KIAYIAS A. Topics in Cryptology-Ct-Rsa 2011. Springer Berlin Heidelberg. 2011: 319-339.
15. Oded Regev. On Lattices, Learning with Errors, Random Linear Codes, and Cryptography [M]. Proceedings of the thirty-seventh annual ACM symposium on Theory of computing. Baltimore, MD, USA; ACM. 2005: 84-93.
16. Vadim Lyubashevsky, Chris Peikert, Oded Regev. On Ideal Lattices and Learning with Errors over Rings [M]//GILBERT H. Advances in Cryptology-Eurocrypt 2010. Springer Berlin Heidelberg. 2010: 1-23.
17. Chris Peikert. Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem: Extended Abstract [M]. Proceedings of the 41 st annual ACM symposium on Theory of computing. Bethesda, MD, USA; ACM. 2009: 333-342.
18. w. Banaszczyk. New Bounds in Some Transference Theorems in the Geometry of Numbers [J]. Math Ann, 1993, 296(1): 625-635.
19. w. Banaszczyk. Inequalities for Convex Bodies and Polar Reciprocal Lattices Inr N [J]. Discrete Comput Geom, 1995, 13(1): 217-231.
20. Daniele Micciancio, Oded Regev. Lattice-Based Cryptography [M]//BERNSTEIN D, BUCHMANN J, DAHMEN E. Post-Quantum Cryptography. Springer Berlin Heidelberg. 2009: 147-191.