On Ideal lattices and learning with errors over rings

Journal of the ACM

Volumn 60, Issue 6, 2013, Pages

  Lyubashevsky, Vadim ^a   Peikert, Chris ^b   Regev, Oded ^c  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

Additional key words and phrases: Lattice; Average case hardness; Cryptography; Public key encryption; Quantum computation

Indexed keywords

ALGEBRAIC STRUCTURES; AVERAGE-CASE HARDNESS; CRYPTOGRAPHIC APPLICATIONS; KEY WORDS; LEARNING WITH ERRORS; PUBLIC KEY CRYPTOSYSTEMS; PUBLIC-KEY ENCRYPTION; SECURITY REDUCTION;

CRYPTOGRAPHY; HARDNESS; HASH FUNCTIONS; PUBLIC KEY CRYPTOGRAPHY; QUANTUM COMPUTERS; QUANTUM CRYPTOGRAPHY; QUANTUM THEORY;

RANDOM ERRORS;

EID: 84891588259     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/2535925     Document Type: Article

References (52)

1. Shweta Agrawal, Dan Boneh, and Xavier Boyen. 2010a. Efficient lattice (H)IBE in the tandard model. In Proceedings of EUROCRYPT. 553-572
2. Shweta Agrawal, Dan Boneh, and Xavier Boyen. 2010b. Lattice basis delegation in fixed imension and shorter-ciphertext hierarchical IBE. In Proceedings of CRYPTO. 98-115
3. Miklós Ajtai. 2004. Generating hard instances of lattice problems. Quad. Matemat. 13,1-32
4. Miklós Ajtai, Ravi Kumar, and D. Sivakumar. 2001. A sieve algorithm for the shortest attice vector problem. In Proceedings of STOC. 601-610
5. Adi Akavia, Shafi Goldwasser, and Vinod Vaikuntanathan. 2009. Simultaneous hardcore its and cryptography against memory attacks. In Proceedings of TCC. 474-495
6. Benny Applebaum, David Cash, Chris Peikert, and Amit Sahai. 2009. Fast cryptographic rimitives and circular-secure encryption based on hard learning problems. In roceedings of CRYPTO. 595-618
7. Wojciech Banaszczyk. 1993. New bounds in some transference theorems in the eometry of numbers. Math. Ann. 296, 4, 625-635
8. Avrim Blum, Merrick L. Furst, Michael J. Kearns, and Richard J. Lipton. 1993. ryptographic rimitives based on hard learning problems. In Proceedings of CRYPTO. 278-291
9. Xavier Boyen. 2010. Lattice mixing and vanishing trapdoors: A framework for fully secure hort signatures and more. In Proceedings of Public Key Cryptography. 499-517
10. Zvika Brakerski and Vinod Vaikuntanathan. 2011. Efficient fully homomorphic encryption rom (standard) LWE. In Proceedings of FOCS. 97-106
11. Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan. 2012. (Leveled) fully omomorphic encryption without bootstrapping. In Proceedings of ICTS. 309-325
12. Zvika Brakerski, Adeline Langlois, Chris Peikert, Oded Regev, and Damien Stehlé. 2013. Classical hardness of learning with errors. In Proceedings of STOC. 575-584
13. David Cash, Dennis Hofheinz, Eike Kiltz, and Chris Peikert. 2010. Bonsai trees, or how to elegate a lattice basis. In Proceedings of EUROCRYPT. 523-552
14. Henri Cohen. 1993. A Course in Computational Algebraic Number Theory. Springer
15. Keith Conrad. 2009. The different ideal. http://www.math.uconn.edu/ ~kconrad/blurbs/ ast accessed 12 Oct. 2009)
16. Whitfield Diffie and Martin E. Hellman. 1976. New directions in cryptography. IEEE Trans. nf. Theory IT-22, 6, 644-654
17. Taher ElGamal. 1984. A public key cryptosystem and a signature scheme based on iscrete logarithms. In Proceedings of CRYPTO. 10-18
18. Paul Erdos. 1946. On the coefficients of the cyclotomic polynomial. Bull. Amer. Math. oc. 52, 2, 179-184
19. Craig Gentry. 2009. Fully homomorphic encryption using ideal attices. In Proceedings f TOC. 169-178
20. Craig Gentry, Chris Peikert, and Vinod Vaikuntanathan. 2008. Trapdoors for hard lattices nd new cryptographic constructions. In Proceedings of STOC. 197-206
21. Oded Goldreich. 2004. Foundations of Cryptography. Vol. 2, Cambridge University Press
22. Oded Goldreich, Shafi Goldwasser, and Shai Halevi. 1996. Collision-free hashing from attice problems. Electron. Colloq. Computat. Complex. 3, 42
23. Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, and Vinod Vaikuntanathan. 2010. obustness of the learning with errors assumption. In Proceedings of ICS. 230-240
24. Jeffrey Hoffstein, Jill Pipher, and Joseph H. Silverman. 1998. NTRU: A ring-based public ey cryptosystem. In Proceedings of ANTS. 267-288
25. Akinori Kawachi, Keisuke Tanaka, and Keita Xagawa. 2008. Concurrently secure dentification schemes based on the worst-case hardness of lattice problems. In roceedings of ASIACRYPT. 372-389
26. Adeline Langlois and Damien Stehlé. 2013. Worst-case to average-case reductions for odule lattices. Submitted
27. Richard Lindner and Chris Peikert. 2011. Better key sizes (and attacks) for LWE-based ncryption. In Proceedings of CT-RSA. 319-339
28. Adriana Ĺopez-Alt, Eran Tromer, and Vinod Vaikuntanathan. 2012. On-the-fly multiparty omputation on the cloud via multikey fully homomorphic encryption. In Proceedings of TOC. 1219-1234
29. Vadim Lyubashevsky. 2008. Lattice-based identification schemes secure under active ttacks. In Proceedings of Public Key Cryptography. 162-179
30. Vadim Lyubashevsky. 2009. Fiat-Shamir with aborts: Applications to lattice and actoring-based signatures. In Proceedings of ASIACRYPT. 598-616
31. Vadim Lyubashevsky. 2012. Lattice signatures without trapdoors. In Proceedings of UROCRYPT. 738-755
32. Vadim Lyubashevsky and Daniele Micciancio. 2006. Generalized compact knapsacks re collision resistant. In Proceedings of ICALP (2). 144-155
33. Vadim Lyubashevsky and Daniele Micciancio. 2008. Asymptotically efficient lattice- ased digital signatures. In Proceedings of TCC. 37-54
34. Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, and Alon Rosen. 2008. SWIFFT: A odest proposal for FFT hashing. In Proceedings of FSE. 54-72
35. Vadim Lyubashevsky, Chris Peikert, and Oded Regev. 2013. A toolkit for ring-LWE ryptography. In Proceedings of EUROCRYPT. 35-54
36. Daniele Micciancio. 2007. Generalized compact knapsacks, cyclic lattices, and fficient one-way functions. Computational Complexity 16, 4, 365-411
37. Daniele Micciancio and Chris Peikert. 2012. Trapdoors for lattices: Simpler, tighter, faster, maller. In Proceedings of EUROCRYPT. 700-718
38. Daniele Micciancio and Oded Regev. 2007. Worst-case to average-case reductions ased on gaussian measures. SIAM J. Comput. 37, 1, 267-302
39. Daniele Micciancio and Oded Regev. 2009. Lattice-based cryptography. In Post uantum Cryptography, Springer, 147-191
40. Daniele Micciancio and Salil P. Vadhan. 2003. Statistical zero-knowledge proofs with fficient provers: Lattice problems and more. In Proceedings of CRYPTO. 282-298
41. Daniele Micciancio and Panagiotis Voulgaris. 2010. A deterministic single exponential ime algorithm for most lattice problems based on Voronoi cell computations. In roceedings of STOC. 351-358
42. Chris Peikert. 2009. Public-key cryptosystems from the worst-case shortest vector roblem. In Proceedings of STOC. 333-34
43. Chris Peikert and Alon Rosen. 2006. Efficient collision-resistant hashing from worst-case ssumptions on cyclic lattices. In Proceedings of TCC. 145-166
44. Chris Peikert and Alon Rosen. 2007. Lattices that admit logarithmic worst-case to verage-case connection factors. In Proceedings of STOC. 478-487
45. Chris Peikert and Brent Waters. 2008. Lossy trapdoor functions and their applications. In roceedings of STOC. 187-196
46. Chris Peikert, Vinod Vaikuntanathan, and Brent Waters. 2008. A framework for efficient nd composable oblivious transfer. In Proceedings of CRYPTO. 554-571
47. Oded Regev. 2009. On lattices, learning with errors, random linear codes, and ryptography. J. ACM 56, 6, 1-40
48. Peter Roquette. 1967. On class field towers. In Algebraic Number Theory, John William cott Cassels and Albrecht Fr?ohlich Eds., Academic Press, 231-249
49. Victor Shoup. 2009. A Computational Introduction to Number Theory and Algebra. ambridge University Press
50. Damien Stehléand Ron Steinfeld. 2011. Making NTRU as secure as worst-case problems ver ideal lattices. In Proceedings of EUROCRYPT. 27-47
51. Damien Stehlé, Ron Steinfeld, Keisuke Tanaka, and Keita Xagawa. 2009. Efficient public ey encryption based on ideal lattices. In Proceedings of ASIACRYPT. 617-635
52. William Stein. 2004. A brief introduction to classical and adelic algebraic number theory. http://modular.math.washington.edu/papers/ant/ (last accessed 12 Oct. 2009)