Note on the non-NP-hardness of approximate lattice problems under general Cook reductions

Information Processing Letters

Volumn 76, Issue 1-2, 2000, Pages 61-66

  Cai, Jin Yi ^a   Nerurkar, Ajay ^a  

^a the State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; MATHEMATICAL MODELS; RANDOM PROCESSES; THEOREM PROVING; VECTORS;

CLOSEST VECTOR PROBLEMS (CVP); COOK REDUCTION THEORY; SHORTEST VECTOR PROBLEMS (SVP);

INFORMATION THEORY;

EID: 0034326044     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00123-X     Document Type: Article

References (21)

1. 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. Vol. 54:(2):1997;317-331.
2. Ajtai M. Generating hard instances of lattice problems. Proc. 28th STOC. 1996;99-108. Full version available as TR96-007 from ECCC.
3. 2 is NP-hard for randomized reductions. Proc. 30th STOC. 1998;10-19. Full version available as TR97-047 from ECCC.
4. Ajtai M., Dwork C. A public-key cryptosystem with worst-case/average-case equivalence. Proc. 29th STOC. 1997;284-293. Full version available as TR96-065 from ECCC.
5. Babai L. Trading group theory for randomness. Proc. 17th STOC. 1985;421-429.
6. Banaszczyk W. New bounds in some transference theorems in the geometry of numbers. Math. Ann. 296. 1993;625-635.
7. Boppana R., Håstad J., Zachos S. Does co-NP have short interactive proofs? Inform. Process. Lett. Vol. 25:1987;127-132.
8. Blömer J., Seifert J.-P. On the complexity of computing short linearly independent vectors and short bases in a lattice. Proc. 31st STOC. 1999;711-720.
9. Cai J.-Y. A relation of primal-dual lattices and the complexity of shortest lattice vector problem. Theoret. Comput. Sci. Vol. 207:1998;105-116.
10. Cai J.-Y., Hemachandra L., Vyskoč J. Promise problems and guarded access to unambiguous computation. Ambos-Spies K., Homer S., Schöning U. Complexity Theory - Current Research. 1993;101-146 Cambridge University Press.
11. ε ) is NP-hard under randomized reductions. Proc. 13th Annual IEEE Conference on Computational Complexity. 1998;46-55.
12. Dinur I., Kindler G., Safra S. Approximating CVP to within almost-polynomial factors is NP-hard. Proc. 39th FOCS. 1998.
13. Dinur I., Kindler G., Raz R., Safra S. Approximating CVP to within almost-polynomial factors is NP-hard. Manuscript:1999.
14. Even S., Selman A.L., Yacobi Y. The complexity of promise problems with applications to public-key cryptography. Inform. and Control. Vol. 61:1984;159-173.
15. Goldreich O., Goldwasser S. On the limits of non-approximability of lattice problems. Proc. 30th STOC. 1998;1-9.
16. Goldwasser S., Sipser M. Private coins versus public coins in interactive proof systems. Micali S. Randomness and Computation. Advances in Computing Research. Vol. 5:1989;73-90.
17. Grollmann J., Selman A.L. Complexity measures for public-key cryptosystems. SIAM J. Comput. Vol. 17:(2):1988;309-335.
18. Lagarias J., Lenstra H.W., Schnorr C. Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. Combinatorica. Vol. 10:(4):1990;333-348.
19. Micciancio D. The shortest vector in a lattice is hard to approximate to within some constant. Proc. 39th FOCS. 1998;92-98.
20. Kumar S.R., Sivakumar D. A note on the shortest lattice vector problem. Proc. 14th IEEE Conference on Computational Complexity. 1999;200-204.
21. Zachos S., Furer M. Probabilistic quantifiers vs. distrustful adversaries. Proc. 7th Conference on Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Comput. Sci. Vol. 287:1987;443-453 Springer, Berlin.