On the limits of nonapproximability of lattice problems

Journal of Computer and System Sciences

Volumn 60, Issue 3, 2000, Pages 540-563

  Goldreich, Oded ^a   Goldwasser, Shafi ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; INTERACTIVE COMPUTER SYSTEMS; NETWORK PROTOCOLS; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING; VECTORS;

CLOSEST VECTOR PROBLEM; INTERACTIVE PROOF SYSTEMS; INTERACTIVE PROTOCOL; SHORTEST LATTICE VECTOR; SHORTEST VECTOR PROBLEM;

COMPUTATIONAL COMPLEXITY;

EID: 0034205405     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1686     Document Type: Article

References (47)

1. Ajtai M. Generating hard instances of lattice problems. 28th STOC. 1996;. p. 99-108.
2. 2 is NP-hard for randomized reductions. 30th STOC. 1998;. p. 10-18.
3. Ajtai M., Dwork C. A public-key cryptosystem with worst-case/average-case equivalence. 29th STOC. 1997;. p. 284-293.
4. M. Alekhnovich, On approximating the minimal code distance, private communication, Oct. 1997.
5. Apostol T. M. Calculus. 1969;Wiley, New York.
6. Arora S., Babai L., Stern J., Sweedyk Z. The hardness of approximate optima in lattices, codes, and systems of linear equations. J. Comput. System Sci. 54:1997;317-331.
7. Babai L. Trading group theory for randomness. 17th STOC. 1985;. p. 421-429.
8. Babai L. On Lovász lattice reduction and the nearest lattice point problem. Combinatorica. 6:1986;1-13.
9. Banaszczyk W. New bounds in some transference theorems in the geometry of numbers. Math. Annal. 296:1993;625-635.
10. Bellare M., Goldreich O., Goldwasser S. Randomness in interactive proofs. Comput. Complexity. 4:1993;319-354.
11. Blum M., Goldwasser S. An efficient probabilistic public-key encryption scheme which hides all partial information. Crypto84. Lecture Notes in Computer Science. 196:1984;Springer-Verlag, Berlin. p. 289-302.
12. Boppana R., Håstad J., Zachos S. Does Co-NP have short interactive proofs? IPL. 25:1987;127-132.
13. Brassard G. Relativized cryptography. 20th FOCS. 1979;. p. 383-391.
14. Cai J. A relation of primal-dual lattices and the complexity of shortest lattice vector problem. Theoret. Comput. Sci. 207:1998;105-116.
15. Cai J., Nerurkar A. P. An improved worst-case to average-case connection for lattice problems. 38th FOCS. 1997;. p. 468-477.
16. Dyer M., Frieze A., Kannan R. A random polynomial-time algorithm for approximating the volume of convex bodies. J. Assoc. Comput. Mach. 38:1991;1-17.
17. Even S., Selman A. L., Yacobi Y. The complexity of promise problems with applications to public-key cryptography. Inform. and Control. 61:1984;159-173.
18. Feige U. A threshold of ln n for approximating set cover. 28th STOC. 1996;. p. 314-318.
19. Fortnow L. The complexity of perfect zero-knowledge. Micali S. Advances in Computing Research: A Research Annual. Randomness and Computation. 5:1989;327-343.
20. Fürer M., Goldreich O., Mansour Y., Sipser M., Zachos S. On completeness and soundness in interactive proof systems. Micali S. Advances in Computing Research: A Research Annual. Randomness and Computation. 5:1989;429-442.
21. Goldreich O. Modern Cryptography, Probabilistic Proofs and Pseudorandomness. 1998;Springer-Verlag, Berlin/New York.
22. O. Goldreich, and, S. Goldwasser, On the possibility of basing cryptography on the assumption that P≠NP, manuscript, Feb. 1998. Available as record 98-05 at, http://theory.lcs.mit.edu/~tcryptol .
23. Goldreich O., Goldwasser S., Halevi S. Public-key cryptosystems from lattice reduction problems. Crypto97. Lecture Notes in Computer Science. 1294:1997;Springer-Verlag, Berlin. p. 112-131.
24. Goldreich O., Kushilevitz E. A perfect zero-knowledge proof for a decision problem equivalent to discrete logarithm. J. Cryptology. 6:1982;77-116.
25. Goldreich O., Micali S., Wigderson A. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. J. Assoc. Comput. Mach. 38:1991;691-729.
26. Goldreich O., Sahai A., Vadhan S. Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge. 30th STOC. 1998;. p. 399-408.
27. Goldwasser S., Micali S. Probabilistic encryption. J. Comput. System Sci. 28:1984;270-299.
28. Goldwasser S., Micali S., Rackoff C. The knowledge complexity of interactive proof systems. SIAM J. Comput. 18:1989;186-208.
29. Goldwasser S., Sipser M. Private coins versus public coins in interactive proof systems. Micali S. Advances in Computing Research: A Research Annual. Randomness and Computation. 5:1989;73-90.
30. Grollmann J., Selman A. L. Complexity measures for public-key cryptosystems. SIAM J. Comput. 17:1988;309-335.
31. Grötschel M., Lovász L., Schrijver A. Geometric Algorithms and Combinatorial Optimization. 1988;Springer-Verlag, Berlin/New York.
32. Håstad J. Dual vectors and lower bounds for the nearest lattice point problem. Combinatorica. 8:1988;75-81.
33. Håstad J. Getting optimal in-approximability results. 29th STOC. 1997;. p. 1-10.
34. Kannan R. Algorithmic geometry of numbers. Annual Reviews in Computer Science. 1987;. p. 231-267.
35. 5) volume algorithm for convex bodies, Random Struct. Algorithms, in press.
36. Karloff H., Zwick U. A 7/8-eps approximation algorithm for MAX 3SAT? 38th FOCS. 1997;. p. 406-415.
37. Knuth D. E. The Art of Computer Programming. 1973;Addison-Wesley, Reading.
38. Knuth D. E. The Art of Computer Programming. 1981;Addison-Wesley, Reading.
39. Lagarias J., Lenstra H. W., Schnorr C. P. Korkine-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. Combinatorica. 10:1990;333-348.
40. Lenstra A. K., Lenstra H. W., Lovász L. Factoring polynomials with rational coefficients. Math. Ann. 261:1982;515-534.
41. Lenstra H. W. Integer programming with a fixed number of variables. Math. Oper. Res. 8:1983;538-548.
42. D. Micciancio, On the inapproximability of the shortest vector in a lattice within some constant factor, preliminary version MIT/LCS/TM-574, February 1998. Available as TR98-016 at, http://www.eccc.uni-trier.de/eccc/ .
43. D. Micciancio, Lattice based cryptography: A global improvement, March 1999, available as record 99-05 at, http://philby.ucsd.edu/cryptolib .
44. Okamoto T. On relationships between statistical zero-knowledge proofs. 28th STOC. 1996;. p. 649-658.
45. Sahai A., Vadhan S. A complete promise problem for statistical zero-knowledge. 38th FOCS. 1997;. p. 448-457.
46. Schnorr C. P. A hierarchy of polynomial time lattice basis reduction algorithms. Theoret. Comput. Sci. 53:1987;201-224.
47. van Emde Boas P. Report. 1981.