The learning with errors problem

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2010, Pages 191-204

  Regev, Oded ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Lattice based cryptography; Learning with errors

Indexed keywords

CRYPTOGRAPHIC APPLICATIONS; LATTICE-BASED CRYPTOGRAPHY;

CRYPTOGRAPHY; ERRORS;

COMPUTATIONAL COMPLEXITY;

EID: 77955253445     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2010.26     Document Type: Conference Paper

References (55)

1. S. Agrawal, D. Boneh, and X. Boyen. Efficient lattice (H)IBE in the standard model. In EUROCRYPT. 2010.
2. B. Applebaum, D. Cash, C. Peikert, and A. Sahai. Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In CRYPTO, pages 595-618. 2009.
3. M. Ajtai and C. Dwork. A public-key cryptosystem with worst-case/average-case equivalence. In Proc. 29th Annual ACM Symp. on Theory of Computing (STOC), pages 284-293. 1997.
4. M. Ajtai and C. Dwork. The first and fourth public-key cryptosystems with worst-case/averagecase equivalence, 2007. Available from ECCC at http://www.uni-trier.de/eccc/.
5. A. Akavia, S. Goldwasser, and V. Vaikuntanathan. Simultaneous hardcore bits and cryptography against memory attacks. In TCC, pages 474-495. 2009.
6. M. Ajtai. Generating hard instances of lattice problems. In Complexity of computations and proofs, volume 13 of Quad. Mat., pages 1-32. Dept. Math., Seconda Univ. Napoli, Caserta, 2004. Preliminary version in STOC 1996.
7. M. Ajtai. Representing hard lattices with O(n log n) bits. In Proc. 37th Annual ACM Symp. on Theory of Computing (STOC), pages 94-103. 2005.
8. M. Ajtai, R. Kumar, and D. Sivakumar. A sieve algorithm for the shortest lattice vector problem. In Proc. 33rd Annual ACM Symp. on Theory of Computing (STOC), pages 601-610. 2001.
9. M. Alekhnovich. More on average case vs approximation complexity. In Proc. 44th Annual IEEE Symp. on Foundations of Computer Science (FOCS), pages 298-307. 2003.
10. D. Aharonov and O. Regev. Lattice problems in NP intersect coNP. Journal of the ACM, 52(5):749-765, 2005. Preliminary version in FOCS'04.
11. A. Blum, M. Furst, M. Kearns, and R. J. Lipton. Cryptographic primitives based on hard learning problems. In CRYPTO, pages 278-291. 1993.
12. A. Blum, A. Kalai, and H. Wasserman. Noise-tolerant learning, the parity problem, and the statistical query model. Journal of the ACM, 50(4):506-519, 2003.
13. D. Cash, D. Hofheinz, E. Kiltz, and C. Peikert. Bonsai trees, or how to delegate a lattice basis. In EUROCRYPT. 2010.
14. Y. Dodis, S. Goldwasser, Y. Kalai, C. Peikert, and V. Vaikuntanathan. Public-key encryption schemes with auxiliary inputs. In TCC. 2010.
15. U. Feige. Relations between average case complexity and approximation complexity. In Proc. 34th Annual ACM Symp. on Theory of Computing (STOC), pages 534-543. 2002.
16. C. Gentry. Fully homomorphic encryption using ideal lattices. In STOC, pages 169-178. 2009.
17. O. Goldreich and S. Goldwasser. On the limits of nonapproximability of lattice problems. J. Comput. Syst. Sci., 60(3):540-563, 2000.
18. O. Goldreich, S. Goldwasser, and S. Halevi. Collision-free hashing from lattice problems. Electronic Colloquium on Computational Complexity (ECCC), 3(42), 1996.
19. O. Goldreich, S. Goldwasser, and S. Halevi. Eliminating decryption errors in the Ajtai-Dwork cryptosystem. In CRYPTO, volume 1294 of Lecture Notes in Comput. Sci., pages 105-111. 1997.
20. S. Goldwasser, Y. Kalai, C. Peikert, and V. Vaikuntanathan. Robustness of the learning with errors assumption. In ICS. 2010.
21. C. Gentry, C. Peikert, and V. Vaikuntanathan. Trapdoors for hard lattices and new cryptographic constructions. In Proc. 40th ACM Symp. on Theory of Computing (STOC), pages 197-206. 2008.
22. H. Gilbert, M. J. B. Robshaw, and Y. Seurin. How to encrypt with the LPN problem. In ICALP, pages 679-690. 2008.
23. N. J. Hopper and M. Blum. Secure human identification protocols. In ASIACRYPT, pages 52-66. 2001.
24. J. Hoffstein, J. Pipher, and J. H. Silverman. NTRU: A ring-based public key cryptosystem. In ANTS, pages 267-288. 1998.
25. R. Impagliazzo and D. Zuckerman. How to recycle random bits. In Proc. 30th Annual IEEE Symp. on Foundations of Computer Science (FOCS), pages 248-253. 1989.
26. A. Juels and S. A. Weis. Authenticating pervasive devices with human protocols. In CRYPTO, pages 293-308. 2005.
27. A. R. Klivans and A. A. Sherstov. Cryptographic hardness for learning intersections of halfspaces. J. Comput. System Sci., 75(1):2-12, 2009. Preliminary version in FOCS'06.
28. A. Kawachi, K. Tanaka, and K. Xagawa. Multi-bit cryptosystems based on lattice problems. In PKC, pages 315-329. 2007.
29. A. Kawachi, K. Tanaka, and K. Xagawa. Concurrently secure identification schemes based on the worst-case hardness of lattice problems. In ASIACRYPT, pages 372-389. 2008.
30. A. K. Lenstra, H. W. Lenstra, Jr., and L. Lovász. Factoring polynomials with rational coefficients. Math. Ann., 261(4):515-534, 1982.
31. Y.-K. Liu, V. Lyubashevsky, and D. Micciancio. On bounded distance decoding for general lattices. In RANDOM, pages 450-461. 2006.
32. V. Lyubashevsky and D. Micciancio. Generalized compact knapsacks are collision resistant. In ICALP, pages 144-155. 2006.
33. V. Lyubashevsky and D. Micciancio. Asymptotically efficient lattice-based digital signatures. In TCC, pages 37-54. 2008.
34. V. Lyubashevsky and D. Micciancio. On bounded distance decoding, unique shortest vectors, and the minimum distance problem. In CRYPTO, pages 577-594. 2009.
35. V. Lyubashevsky, D. Micciancio, C. Peikert, and A. Rosen. SWIFFT: A modest proposal for FFT hashing. In FSE, pages 54-72. 2008.
36. V. Lyubashevsky, C. Peikert, and O. Regev. On ideal lattices and learning with errors over rings. In EUROCRYPT. 2010.
37. V. Lyubashevsky. The parity problem in the presence of noise, decoding random linear codes, and the subset sum problem. In RANDOM, pages 378-389. 2005.
38. V. Lyubashevsky. Lattice-based identification schemes secure under active attacks. In Public Key Cryptography, pages 162-179. 2008.
39. V. Lyubashevsky. Fiat-Shamir with aborts: Applications to lattice and factoring-based signatures. In ASIACRYPT, pages 598-616. 2009.
40. D. Micciancio. Generalized compact knapsacks, cyclic lattices, and efficient one-way functions. Computational Complexity, 16(4):365-411, 2007. Preliminary version in FOCS 2002.
41. D. Micciancio. Cryptographic functions from worst-case complexity assumptions. In P. Q. Nguyen and B. Vallée, editors, The LLL Algorithm: Survey and Applications, Information Security and Cryptography, pages 427-452. Springer, 2008. Prelim. version in LLL25, 2007.
42. D. Micciancio and O. Regev. Worst-case to average-case reductions based on Gaussian measures. SIAM Journal on Computing, 37(1):267-302, 2007.
43. D. Micciancio and O. Regev. Lattice-based cryptography. In D. J. Bernstein and J. Buchmann, editors, Post-quantum Cryprography. Springer, 2008.
44. D. Micciancio and S. P. Vadhan. Statistical zero-knowledge proofs with efficient provers: Lattice problems and more. In CRYPTO, pages 282-298. 2003.
45. D. Micciancio and P. Voulgaris. A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations. In STOC. 2010.
46. P. Q. Nguyen and J. Stern. The hardness of the hidden subset sum problem and its cryptographic implications. In CRYPTO, pages 31-46. 1999.
47. C. Peikert. Public-key cryptosystems from the worstcase shortest vector problem. In Proc. 41st ACM Symp. on Theory of Computing (STOC), pages 333-342. 2009.
48. C. Peikert. Some recent progress in lattice-based cryptography. Slides for invited tutorial at TCC'09, 2009.
49. C. Peikert and A. Rosen. Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices. In TCC, pages 145-166. 2006.
50. C. Peikert, V. Vaikuntanathan, and B. Waters. A framework for efficient and composable oblivious transfer. In CRYPTO, pages 554-571. 2008.
51. C. Peikert and B. Waters. Lossy trapdoor functions and their applications. In Proc. 40th ACM Symp. on Theory of Computing (STOC), pages 187-196. 2008.
52. O. Regev. New lattice-based cryptographic constructions. Journal of the ACM, 51(6):899-942, 2004. Preliminary version in STOC'03.
53. O. Regev. On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM, 56(6):34, 2009. Preliminary version in STOC'05.
54. O. Regev. Lattice-based cryptography. In CRYPTO, pages 131-141. 2006.
55. D. Stehlé, R. Steinfeld, K. Tanaka, and K. Xagawa. Efficient public key encryption based on ideal lattices. In ASIACRYPT, pages 617-635. 2009.