Efficient fully homomorphic encryption from (standard) LWE

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2011, Pages 97-106

  Brakerski, Zvika ^a   Vaikuntanathan, Vinod ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Fully Homomorphic Encryption; Lattices; Learning with Errors

Indexed keywords

ASYMPTOTICALLY EFFICIENT; CIPHERTEXTS; COMMUNICATION COMPLEXITY; COMPLEXITY ASSUMPTIONS; FULLY HOMOMORPHIC ENCRYPTION; PRIVATE INFORMATION RETRIEVAL; PUBLIC-KEY MODEL; REDUCTION TECHNIQUES; SECURITY PARAMETERS; SINGLE-BIT; VECTOR PROBLEM;

COMPUTER SCIENCE; CRYSTAL LATTICES; ERRORS; IMAGE QUALITY;

CRYPTOGRAPHY;

EID: 80955132201     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2011.12     Document Type: Conference Paper

References (38)

1. S. Agrawal, D. Boneh, and X. Boyen, "Efficient lattice (H)IBE in the standard model," in EUROCRYPT, 2010, pp. 553-572.
2. 2 is NP-hard for randomized reductions (extended abstract)," in STOC, 1998, pp. 10-19.
3. M. Ajtai, R. Kumar, and D. Sivakumar, "A sieve algorithm for the shortest lattice vector problem," in STOC, 2001, pp. 601-610.
4. A. Akavia, S. Goldwasser, and V. Vaikuntanathan, "Simultaneous hardcore bits and cryptography against memory attacks," in TCC, ser. Lecture Notes in Computer Science, O. Reingold, Ed., vol. 5444. Springer, 2009, pp. 474-495.
5. B. Applebaum, D. Cash, C. Peikert, and A. Sahai, "Fast cryptographic primitives and circular-secure encryption based on hard learning problems," in CRYPTO, ser. Lecture Notes in Computer Science, S. Halevi, Ed., vol. 5677. Springer, 2009, pp. 595-618.
6. D. Boneh, E.-J. Goh, and K. Nissim, "Evaluating 2-DNF formulas on ciphertexts," in Theory of Cryptography - TCC'05, ser. Lecture Notes in Computer Science, vol. 3378. Springer, 2005, pp. 325-341.
7. Z. Brakerski and V. Vaikuntanathan, " Fully homomorphic encryption from ring-LWE and security for key dependent messages," in CRYPTO, vol. 6841, 2011, p. 501.
8. -, "Efficient fully homomorphic encryption from (standard) LWE," Cryptology ePrint Archive, Report 2011/344, 2011, http://eprint.iacr.org/2011/344.
9. C. Cachin, S. Micali, and M. Stadler, "Computationally private information retrieval with polylogarithmic communication," in EUROCRYPT, 1999, pp. 402-414.
10. D. Cash, D. Hofheinz, E. Kiltz, and C. Peikert, "Bonsai trees, or how to delegate a lattice basis," in EUROCRYPT, 2010, pp. 523-552.
11. M. Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, "Fully homomorphic encryption over the integers," in EUROCRYPT, 2010, pp. 24-43, full Version in http:// eprint.iacr.org/2009/616.pdf.
12. C. Gentry, "A fully homomorphic encryption scheme," Ph.D. dissertation, Stanford University, 2009, http:// crypto.stanford.edu/craig.
13. -, "Fully homomorphic encryption using ideal lattices," in STOC, 2009, pp. 169-178.
14. -, "Toward basing fully homomorphic encryption on worst-case hardness," in CRYPTO, 2010, pp. 116-137.
15. C. Gentry and S. Halevi, "Fully homomorphic encryption without squashing using depth-3 arithmetic circuits," Cryptology ePrint Archive, Report 2011/279, 2011,
16. to appear in FOCS 2011.
17. -, "Implementing gentry's fully-homomorphic encryption scheme," in EUROCRYPT, ser. Lecture Notes in Computer Science, K. G. Paterson, Ed., vol. 6632. Springer, 2011, pp. 129-148.
18. C. Gentry, S. Halevi, and V. Vaikuntanathan, "i-hop homomorphic encryption and rerandomizable Yao circuits," in CRYPTO, 2010, pp. 155-172.
19. -, "A simple BGN-type cryptosystem from LWE," in EUROCRYPT, 2010, pp. 506-522.
20. C. Gentry, C. Peikert, and V. Vaikuntanathan, "Trapdoors for hard lattices and new cryptographic constructions," in STOC, C. Dwork, Ed. ACM, 2008, pp. 197-206.
21. C. Gentry and Z. Ramzan, "Single-database private information retrieval with constant communication rate," in ICALP, ser. Lecture Notes in Computer Science, L. Caires, G. F. Italiano, L. Monteiro, C. Palamidessi, and M. Yung, Eds., vol. 3580. Springer, 2005, pp. 803-815.
22. S. Goldwasser and S. Micali, "Probabilistic encryption and how to play mental poker keeping secret all partial information," in STOC. ACM, 1982, pp. 365-377.
23. Y. Ishai and A. Paskin, "Evaluating branching programs on encrypted data," in TCC, ser. Lecture Notes in Computer Science, S. P. Vadhan, Ed., vol. 4392. Springer, 2007, pp. 575-594.
24. A. K. Lenstra, H. W. Lenstra, and L. Lovsz, "Factoring polynomials with rational coefficients," Mathematische Annalen, vol. 261, pp. 515-534, 1982, 10.1007/BF01457454.
25. H. Lipmaa, "An oblivious transfer protocol with log-squared communication," in ISC, ser. Lecture Notes in Computer Science, J. Zhou, J. Lopez, R. H. Deng, and F. Bao, Eds., vol. 3650. Springer, 2005, pp. 314-328.
26. V. Lyubashevsky, C. Peikert, and O. Regev, "On ideal lattices and learning with errors over rings," in EUROCRYPT, 2010, pp. 1-23, draft of full version was provided by the authors.
27. C. A. Melchor, P. Gaborit, and J. Herranz, "Additively homomorphic encryption with d-operand multiplications," in CRYPTO, 2010, pp. 138-154.
28. D. Micciancio, "The shortest vector in a lattice is hard to approximate to within some constant," SIAM J. Comput., vol. 30, no. 6, pp. 2008-2035, 2000. (Pubitemid 34125447)
29. -, "A first glimpse of cryptography's holy grail," Commun. ACM, vol. 53, pp. 96-96, March 2010. [Online]. Available: http://doi.acm.org/10. 1145/1666420. 1666445
30. D. Micciancio and P. Voulgaris, "A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations," in STOC, L. J. Schulman, Ed. ACM, 2010, pp. 351-358.
31. R. Ostrovsky and W. E. Skeith III, "A survey of single-database private information retrieval: Techniques and applications," in Public Key Cryptography, ser. Lecture Notes in Computer Science, T. Okamoto and X. Wang, Eds., vol. 4450. Springer, 2007, pp. 393-411.
32. P. Paillier, "Public-key cryptosystems based on composite degree residuosity classes," in EUROCRYPT, 1999, pp. 223-238.
33. C. Peikert, "Public-key cryptosystems from the worstcase shortest vector problem: extended abstract," in STOC, 2009, pp. 333-342.
34. O. Regev, "On lattices, learning with errors, random linear codes, and cryptography," in STOC, H. N. Gabow and R. Fagin, Eds. ACM, 2005, pp. 84-93.
35. R. Rivest, L. Adleman, and M. Dertouzos, "On data banks and privacy homomorphisms," in Foundations of Secure Computation. Academic Press, 1978, pp. 169-177.
36. T. Sander, A. Young, and M. Yung, "Non-interactive cryptocomputing for NC1," in FOCS, 1999, pp. 554-567.
37. N. P. Smart and F. Vercauteren, "Fully homomorphic encryption with relatively small key and ciphertext sizes," in Public Key Cryptography, ser. Lecture Notes in Computer Science, P. Q. Nguyen and D. Pointcheval, Eds., vol. 6056. Springer, 2010, pp. 420-443.
38. D. Stehlé and R. Steinfeld, "Faster fully homomorphic encryption," in ASIACRYPT, 2010, pp. 377-394.