Limits on the hardness of lattice problems in ℓp norms

Computational Complexity

Volumn 17, Issue 2, 2008, Pages 300-351

  Peikert, Chris ^a  

^a SRI INTERNATIONAL   (United States)

Author keywords

p norms; Cryptography; Discrete Gaussians; Lattices; Worst case to average case reductions

Indexed keywords

EID: 44649127963     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-008-0251-3     Document Type: Conference Paper

References (59)

1. D. AHARONOV & O. REGEV (2003). A lattice problem in quantum NP. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, Cambridge MA, 210-219.
2. D. AHARONOV & O. REGEV (2005). Lattice problems in NP n coNP. J. ACM 52(5), 749-765. Preliminary version in FOCS 2004.
3. 2 is NP-hard for randomized reductions (extended abstract). In Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, Dallas TX, 10-19.
4. M. AJTAI (2004). Generating hard instances of lattice problems. Quaderni di Matematica 13, 1-32. Preliminary version in STOC 1996.
5. M. AJTAI, R. KUMAR & D. SIVAKUMAR (2001). A sieve algorithm for the shortest lattice vector problem. In Proceedings of the Thirty-third Annual ACM Symposium on the Theory of Computing, Hersonissos, Crete, Greece, 601-610.
6. M. AJTAI, R. KUMAR & D. SIVAKUMAR (2002). Sampling short lattice vectors and the closest lattice vector problem. In Proceedings of the 17th IEEE Conference on Computational Complexity, Montréal, Québec, Canada, 53-57.
7. M. ALEKHNOVICH, S. KHOT, G. KINDLER & N. K. VISHNOI (2005). Hardness of approximating the closest vector problem with pre-processing. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, Pittsburgh PA, 216-225.
8. S. ARORA, L. BABAI, J. STERN & Z. SWEEDYK (1997). The hardness of approximate optima in lattices, codes, and systems of linear equations. J. Comput. Syst. Sci. 54(2), 317-331. Preliminary version in FOCS 1993.
9. L. BABAI (1986). On Lovász' lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1-13.
10. W. BANASZCZYK (1993). New bounds in some transference theorems in the geometry of numbers. Mathematische Annalen 296(4), 625-635.
11. n. Discrete & Computational Geometry 13, 217-231.
12. S. BEN-DAVID, B. CHOR, O. GOLDREICH & M. LUBY (1992). On the theory of average case complexity. J. Comput. Syst. Sci. 44(2), 193-219.
13. P. BERMAN & M. KARPINSKI (2002). Approximating minimum unsatisfiability of linear equations. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco CA, 514-516.
14. J. BLOMER & S. NAEWE (2007). Sampling methods for shortest vectors, closest vectors and successive minima. In Proceedings of the 34th International Colloquium on Automata, Languages and Programming ICALP 2007, Wroclaw, Poland, 65-77.
15. J.-Y. CAI (1998). A relation of primal-dual lattices and the complexity of shortest lattice vector problem. Theor. Comput. Sci. 207(1), 105-116.
16. J.-Y. CAI & A. NERURKAR (1997). An improved worst-case to average-case connection for lattice problems. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, Miami Beach FL, 468-477.
17. ε) Is NP-Hard under randomized reductions. J. Comput. Syst. Sci. 59(2), 221-239.
18. ∞ to within almost-polynomial factors is NP-hard. Theor. Comput. Sci. 285(1), 55-71. Preliminary version in CIAC 2000.
19. I. DINUR, G. KINDLER, R. RAZ & S. SAFRA (2003). Approximating CVP to within almost-polynomial factors is NP-hard. Combinatorica 23(2), 205-243. Preliminary version in FOCS 1998.
20. P. VAN EMDE BOAS (1981). Another NP-complete problem and the complexity of computing short vectors in a lattice. Technical Report 81-04, University of Amsterdam.
21. U. FEIGE & D. MICCIANCIO (2004). The inapproximability of lattice and coding problems with preprocessing. J. Comput. Syst. Sci. 69(1), 45-67. Preliminary version in CCC 2002.
22. C. GENTRY, C. PEIKERT & V. VAIKUNTANATHAN (2008). Trapdoors for hard lattices and new cryptographic constructions. In Proceedings of the Fourtieth Annual ACM Symposium on the Theory of Computing, Victoria, British Columbia, Canada. To appear. Full version available at http://eprint.iacr.org/2007/432.
23. O. GOLDREICH & S. GOLDWASSER (2000). On the limits of nonapproximability of lattice problems. J. Comput. Syst. Sci. 60(3), 540-563. Preliminary version in STOC 1998.
24. O. GOLDREICH, D. MICCIANCIO, S. SAFRA & J.-P. SEIFERT (1999). Approximating shortest lattice vectors is not harder than approximating closest lattice vectors. Inf. Process. Lett. 71(2), 55-61.
25. V. GURUSWAMI, D. MICCIANCIO & O. REGEV (2005). The complexity of the covering radius problem. Computational Complexity 14, 90-121. Preliminary version in CCC 2004.
26. I. HAVIV & O. REGEV (2006). Hardness of the covering radius problem on lattices. In Proceedings of the 21st IEEE Conference on Computational Complexity, Prague, Czech Republic, 145-158.
27. I. HAVIV & O. REGEV (2007). Tensor-based hardness of the shortest vector problem to within almost polynomial factors. In Proceedings of the Thirty-ninth Annual ACM Symposium on the Theory of Computing, San Diego CA, 469-477.
28. S. KHOT (2005). Hardness of approximating the shortest vector problem in lattices. J. ACM 52(5), 789-808. Preliminary version in FOCS 2004.
29. J. C. LACARIAS, H. W. LENSTRA, JR. & C.-P. SCHNORR (1990). Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. Combinatoriaca 10(4), 333-348.
30. A. K. LENSTRA, H. W. LENSTRA, JR. & L. LOVÁSZ (1982). Factoring polynomials with rational coefficients. Mathematische Annalen 261(4), 515-534.
31. L. A. LEVIN (1986). Average case complete problems. SIAM J. Comput. 15(1), 285-286.
32. Y.-K. LIU, V. LYUBASHEVSKY & D. MICCIANCIO (2006). On bounded distance decoding for general lattices. In Proceedings of the 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, 450-461.
33. V. LYUBASHEVSKY & D. MICCIANCIO (2006). Generalized compact knapsacks are collision resistant. In Proceedings of the 33rd International Colloquium on Automata, Languages and Programming ICALP 2007, Venice, Italy, 144-155. Full version in ECCC Report TR05-142.
34. V. LYUBASHEVSKY & D. MICCIANCIO (2008). Asymptotically efficient lattice-based digital signatures. In Prvceedings of the Fifth Theory of Cryptography Conference, TCC 2008, New York NY, 37-54.
35. D. MICCIANCIO (2000). The shortest vector in a lattice is hard to approximate to within some constant. SIAM J. Comput. 30(6), 2008-2035. Preliminary version in FOCS 1998.
36. D. MICCIANCIO (2004). Almost perfect lattices, the covering radius problem, and applications to Ajtai's connection factor. SIAM J. Comput. 34(1), 118-169. Preliminary version in STOC 2002.
37. D. MICCIANCIO (2007). Generalized compact knapsacks, cyclic lattices, and efficient one-way functions. Computational Complexity 16(4), 365-411. Preliminary version in FOCS 2002.
38. D. MICCIANCIO & S. GOLDWASSER (2002). Complexity of Lattice Problems: A Cryptographic Perspective, volume 671 of The Kluwer International Series in Engineering and Computer Science. Kluwer Academic Publishers, Boston, Massachusetts.
39. D. MICCIANCIO & O. REGEV (2007). Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput. 37(1), 267-302. Preliminary version in FOCS 2004.
40. Y. NESTEROV & A. NEMIROV (1994). Interior-Point Polynomial Algorithms in Convex Programming. Society for Industrial and Applied Mathematics (SIAM).
41. C. PEIKERT & A. ROSEN (2006). Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices. In Proceedings of the Third Theory of Cryptography Conference, TCC 2006, New York NY, 145-166. Full version in ECCC TR05-158.
42. C. PEIKERT & A. ROSEN (2007). Lattices that admit logarithmic worst-case to average-case connection factors. In Proceedings of the Thirty-ninth Annual ACM Symposium on the Theory of Computing, San Diego CA, 478-487. Full version in ECCC Report TR06-147.
43. C. PEIKERT, V. VAIKUNTANATHAN & B. WATERS (2007). A framework for efficient and composable oblivious transfer. Cryptology ePrint Archive, Report 2007/348. In submission. Full version available at http://eprint.iacr.org/2007/348.
44. C. PEIKERT & B. WATERS (2008). Lossy trapdoor functions and their applications. In Proceedings of the Fourtieth Annual ACM Symposium on the Theory of Computing, Victoria, British Columbia, Canada. To appear. Full version available at http://eprint.iacr.org/2007/279.
45. O. REGEV (2004a). Improved inapproximability of lattice and coding problems with preprocessing. IEEE Transactions on Information Theory 50(9), 2031-2037. Preliminary version in CCC 2003.
46. O. REGEV (2004b). New lattice-based cryptographic constructions. J. ACM 51(6), 899-942. Preliminary version in STOC 2003.
47. O. REGEV (2005). On lattices, learning with errors, random linear codes, and cryptography. In Proceedings of the Thirty-seventh Annual ACM Symposium on the Theory of Computing, Baltimore MD, 84-93. Revised version available from author's web page.
48. O. REGEV & R. ROSEN (2006). Lattice problems and norm embeddings. In Proceedings of the Thirty-eighth Annual ACM Symposium on the Theory of Computing, Seattle WA, 447-456.
49. C-P. SCHNORR. (1987). A hierarchy of polynomial time lattice basis reduction algorithms. Theor. Comput. Sci. 53, 201-224.
50. Y. NESTEROV & A. NEMIROV (1994). Interior-Point Polynomial Algorithms in Convex Programming. Society for Industrial and Applied Mathematics (SIAM).
51. C. PEIKERT & A. ROSEN (2006). Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices. In Proceedings of the Third Theory of Cryptography Conference, TCC 2006, New York NY, 145-166. Full version in ECCC TR05-158.
52. C. PEIKERT & A. ROSEN (2007). Lattices that admit logarithmic worst-case to average-case connection factors. In Proceedings of the Thirty-ninth Annual ACM Symposium on the Theory of Computing, San Diego CA, 478-487. Full version in ECCC Report TR06-147.
53. C. PEIKERT, V. VAIKUNTANATHAN & B. WATERS (2007). A framework for efficient and composable oblivious transfer. Cryptology ePrint Archive, Report 2007/348. In submission. Full version available at http://eprint.iacr.org/2007/348.
54. C. PEIKERT & B. WATERS (2008). Lossy trapdoor functions and their applications. In Proceedings of the Fourtieth Annual ACM Symposium on the Theory of Computing, Victoria, British Columbia, Canada. To appear. Full version available at http://eprint.iacr.org/2007/279.
55. O. REGEV (2004a). Improved inapproximability of lattice and coding problems with preprocessing. IEEE Transactions on Information Theory 50(9), 2031-2037. Preliminary version in CCC 2003.
56. O. REGEV (2004b). New lattice-based cryptographic constructions. J. ACM 51(6), 899-942. Preliminary version in STOC 2003.
57. O. REGEV (2005). On lattices, learning with errors, random linear codes, and cryptography. In Proceedings of the Thirty-seventh Annual ACM Symposium on the Theory of Computing, Baltimore MD, 84-93. Revised version available from author's web page.
58. O. REGEV & R. ROSEN (2006). Lattice problems and norm embeddings. In Proceedings of the Thirty-eighth Annual ACM Symposium on the Theory of Computing, Seattle WA, 447-456.
59. C-P. SCHNORR. (1987). A hierarchy of polynomial time lattice basis reduction algorithms. Theor. Comput. Sci. 53, 201-224.