Lattice-based FHE as Secure as PKE

ITCS 2014 - Proceedings of the 2014 Conference on Innovations in Theoretical Computer Science

Volumn , Issue , 2014, Pages 1-12

  Brakerski, Zvika ^a   Vaikuntanathan, Vinod ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Cryptography; Fully Homomorphic Encryption; Lattice Based Cryptography

Indexed keywords

COMPUTER SCIENCE; CRYPTOGRAPHY; HARDNESS;

FULLY HOMOMORPHIC ENCRYPTION; HIGH FAN-IN; LATTICE PROBLEMS; LATTICE-BASED; LATTICE-BASED CRYPTOGRAPHY; PUBLIC-KEY ENCRYPTION; QUASI-POLY-NOMIAL;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84893301353     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2554797.2554799     Document Type: Conference Paper

References (20)

1. M. Ajtai and C. Dwork. A public-key cryptosystem with worst-case/average-case equivalence. In F. T. Leighton and P. W. Shor, editors, STOC, pages 284-293. ACM, 1997.
2. 1. J. Comput. Syst. Sci., 38(1): 150-164, 1989.
3. A. Borodin, D. Dolev, F. E. Fich, and W. J. Paul. Bounds for width two branching programs. SIAM J. Comput., 15(2): 549-560, 1986.
4. Z. Brakerski. Fully homomorphic encryption without modulus switching from classical GapSVP. In R. Safavi-Naini and R. Canetti, editors, CRYPTO, Volume 7417 of Lecture Notes in Computer Science, pages 868-886. Springer, 2012.
5. Z. Brakerski, C. Gentry, and V. Vaikuntanathan. (Leveled) fully homomorphic encryption without bootstrapping. In S. Goldwasser, editor, ITCS, pages 309-325. ACM, 2012. Invited to ACM Transactions on Computation Theory.
6. Z. Brakerski, A. Langlois, C. Peikert, O. Regev, and D. Stehlé. Classical hardness of learning with errors. CoRR, abs/1306.0281, 2013. Preliminary version in STOC 2013.
7. Z. Brakerski and V. Vaikuntanathan. Efficient fully homomorphic encryption from (standard) LWE. In R. Ostrovsky, editor, FOCS, pages 97-106. IEEE, 2011. Invited to SIAM Journal on Computing.
8. C. Gentry. A fully homomorphic encryption scheme. PhD thesis, Stanford University, 2009.
9. C. Gentry. Fully homomorphic encryption using ideal lattices. In STOC, pages 169-178, 2009.
10. C. Gentry. Toward basing fully homomorphic encryption on worst-case hardness. In CRYPTO, pages 116-137, 2010.
11. C. Gentry, C. Peikert, and V. Vaikuntanathan. Trapdoors for hard lattices and new cryptographic constructions. In C. Dwork, editor, STOC, pages 197-206. ACM, 2008.
12. C. Gentry, A. Sahai, and B. Waters. Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. IACR Cryptology ePrint Archive, 2013: 340, 2013. Preliminary version in CRYPTO 2013.
13. Y. Ishai and A. Paskin. Evaluating branching programs on encrypted data. In S. P. Vadhan, editor, TCC, Volume 4392 of Lecture Notes in Computer Science, pages 575-594. Springer, 2007.
14. D. Micciancio and P. Mol. Pseudorandom knapsacks and the sample complexity of lwe search-to-decision reductions. In P. Rogaway, editor, CRYPTO, Volume 6841 of Lecture Notes in Computer Science, pages 465-484. Springer, 2011.
15. D. Micciancio and C. Peikert. Trapdoors for lattices: Simpler, tighter, faster, smaller. IACR Cryptology ePrint Archive, 2011: 501, 2011. Extended abstract in Eurocrypt 2012.
16. C. Peikert. Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. In M. Mitzenmacher, editor, STOC, pages 333-342. ACM, 2009.
17. O. Regev. New lattice-based cryptographic constructions. J. ACM, 51(6): 899-942, 2004.
18. O. Regev. On lattices, learning with errors, random linear codes, and cryptography. In H. N. Gabow and R. Fagin, editors, STOC, pages 84-93. ACM, 2005. Full version in [19].
19. O. Regev. On lattices, learning with errors, random linear codes, and cryptography. J. ACM, 56(6), 2009.
20. C.-P. Schnorr. A hierarchy of polynomial time lattice basis reduction algorithms. Theor. Comput. Sci., 53: 201-224, 1987.