Lattice problems in N P ∩ coNP

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2004, Pages 362-371

  Aharonov, Dorit ^a   Regev, Oded ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; FOURIER TRANSFORMS; PROBLEM SOLVING; QUANTUM THEORY; VECTORS;

APPROXIMATION ALGORITHM; DEQUANTIZATION; LATTICE PROBLEM; SHORTEST VECTOR PROBLEM (SVP);

COMPUTATIONAL COMPLEXITY;

EID: 17744382015     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. S. Aaronson. Lower bounds for local search by quantum arguments. In Proc. 36th ACM Symp. on Theory of Computing (STOC), pages 465-474, 2004.
2. D. Aharonov and O. Regev. A lattice problem in quantum NP. In Proc. 44th Annual IEEE Symp. on Foundations of Computer Science (FOCS), pages 210-219, 2003.
3. M. Ajtai. Generating hard instances of lattice problems (extended abstract). In Proc. 28th ACM Symp. on Theory of Computing (STOC), pages 99-108, 1996.
4. 2 is NP-hard for randomized reductions (extended abstract) 10-19. In Proc. 30th ACM Symp. on Theory of Computing (STOC), pages 10-19, 1998.
5. M. Ajtai and C. Dwork. A public-key cryptosystem with worst-case/average-case equivalence. In Proc. 29th ACM Symp. on Theory of Computing (STOC), pages 284-293, 1997.
6. M. Ajtai, R. Kumar, and D. Sivakumar. A sieve algorithm for the shortest lattice vector problem. In Proc. 33rd ACM Symp. on Theory of Computing, pages 601-610, 2001.
7. W. Banaszczyk. New bounds in some transference theorems in the geometry of numbers. Mathematische Annalen, 296(4):625-635, 1993.
8. J.-Y. Cai and A. Nerurkar. A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. Inform. Process. Lett., 76(1-2):61-66, 2000.
9. I. Dinur, G. Kindler, R. Raz, and S. Safra. Approximating CVF to within almost-polynomial factors is NP-hard. Combinatorica, 23(2):205-243, 2003.
10. U. Feige and D. Micciancio. The inapproximability of lattice and coding problems with preprocessing. In Computational Complexity, pages 44-52, 2002.
11. J. Friedman, J. Kahn, and E. Szemerédi. On the second eigenvalue of random regular graphs. In Proc. 21st Annual Symp. on Theory of Computing (STOC), pages 587-598, 1989.
12. C. F. Gauss. Disquisitiones Arithmeticae. Gerh. Fleischer Iun, 1801.
13. O. Goldreich and S. Goldwasser. On the limits of nonapproximability of lattice problems. J. Comput. System Sci., 60(3):540-563, 2000.
14. O. Goldreich, D. Micciancio, S. Safra, and J.-P. Seifert. Approximating shortest lattice vectors is not harder than approximating closest lattice vectors. Inform. Process. Lett., 71(2):55-61, 1999.
15. J. Håstad, B. Just, J. C. Lagarias, and C.-P. Schnorr. Polynomial time algorithms for finding integer relations among real numbers. SIAM J. Comput., 18(5):859-881, 1989.
16. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58:13-30, 1963.
17. th Symp. Theory. of Comp., pages 193-206, 1983.
18. I. Kerenidis and R. de Wolf. Exponential lower bound for 2-query locally decodable codes via a quantum argument. In Proc. 35th ACM Symp. on Theory of Computing (STOC), pages 106-115, 2003.
19. S. Knot. BCH codes, augmented tensor products and hardness of the shortest vector problem in lattices. In Proc. 45th Annual IEEE Symp. on Foundations of Computer Science (FOCS), 2004.
20. E. Kushilevitz and Y. Mansour. Learning decision trees using the fourier spectrum. SIAM J. Comput., 22(6): 1331-1348, 1993.
21. J. C. Lagarias, H. W. Lenstra, Jr., and C.-P. Schnorr. Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. Combinatorica, 10(4):333-348, 1990.
22. A. K. Lenstra, H. W. Lenstra, and L. Lovász. Factoring polynomials with rational coefficients. Math. Ann., 261:515-534, 1982.
23. D. Micciancio. The shortest vector problem is NP-hard to approximate to within some constant. SIAM Journal on Computing, 30(6):2008-2035, Mar. 2001. Preliminary version in FOCS 1998.
24. D. Micciancio and S. Goldwasser. Complexity of Lattice Problems: a cryptographic perspective, volume 671 of The Kluwer International Series in Engineering and Computer Science. Kluwer Academic Publishers, Boston, Massachusetts, Mar. 2002.
25. O. Regev. Improved inapproximability of lattice and coding problems with preprocessing. In Proc. of 18th IEEE Annual Conference on Computational Complexity (CCC), pages 363-370, 2003.
26. C.-P. Schnorr. A hierarchy of polynomial time lattice basis reduction algorithms. Theoretical Computer Science, 53(2-3):201-224, 1987.
27. C.-P. Schnorr. Factoring integers and computing discrete logarithms via diophantine approximation. In Proc. of Eurocrypt '91, volume 547, pages 171-181. Springer-Verlag, 1991.
28. P. van Emde Boas. Another NP-complete problem and the complexity of computing short vectors in a lattice. Technical report, University of Amsterdam, Department of Mathematics, Netherlands, 1981. Technical Report 8104.
29. D. Štefankovič. Fourier transforms in computer science. Master's Thesis, University of Chicago, Department of Computer Science, TR-2002-03.