On bounded distance decoding, unique shortest vectors, and the minimum distance problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5677 LNCS, Issue , 2009, Pages 577-594

  Lyubashevsky, Vadim ^a   Micciancio, Daniele ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION FACTOR; BOUNDED DISTANCE DECODING; CENTRAL PROBLEMS; CODING THEORY; CRYPTOGRAPHIC APPLICATIONS; CRYPTOSYSTEMS; DECISION VERSION; LATTICE PROBLEMS; MINIMUM DISTANCE; OPEN PROBLEMS; SHORTEST VECTOR PROBLEM;

COMPUTER PROGRAMMING; HARDNESS; INFORMATION THEORY; POLYNOMIAL APPROXIMATION; PUBLIC KEY CRYPTOGRAPHY;

DECODING;

EID: 70350336456     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03356-8_34     Document Type: Conference Paper

References (35)

1. Ajtai, M.: Generating hard instances of lattice problems. In: STOC, pp. 99-108 (1996)
2. Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case/average- case equivalence. In: STOC (1997); An improved version is described in ECCC 2007 (2007)
3. Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: STOC, pp. 601-610 (2001)
4. Babai, L.: On Lovász' lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1-13 (1986)
5. Cai, J.Y.: A relation of primal-dual lattices and the complexity of shortest lattice vector problem. Theor. Comput. Sci. 207(1), 105-116 (1998)
6. Cai, J.Y.: On the average-case hardness of CVP. In: FOCS, pp. 308-317 (2001)
7. Gama, N., Nguyen, P.Q.: Predicting lattice reduction. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 31-51. Springer, Heidelberg (2008)
8. Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices, and new cryptographic constructions. In: STOC (2008)
9. Goldreich, O., Goldwasser, S.: On the limits of nonapproximability of lattice problems. J. Comput. Syst. Sci. 60(3), 540-563 (2000)
10. Goldreich, O., Goldwasser, S., Halevi, S.: Collision-free hashing from lattice problems. In: Electronic Colloquium on Computational Complexity (ECCC) (1996)
11. Goldreich, O., Goldwasser, S., Halevi, S.: Eliminating decryption errors in the Ajtai-Dwork cryptosystem. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 105-111. Springer, Heidelberg (1997)
12. Goldreich, O., Goldwasser, S., Halevi, S.: Public-key cryptosystems from lattice reduction problems. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 112-131. Springer, Heidelberg (1997)
13. Goldreich, O., Micciancio, D., Safra, S., Seifert, J.P.: Approximating shortest lattice vectors is not harder than approximating closest lattice vectors. Information Processing Letters 71(2), 55-61 (1999)
14. Haviv, I., Regev, O.: Tensor-based hardness of the shortest vector problem to within almost polynomial factors. In: STOC, pp. 469-477 (2007)
15. Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: A ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267-288. Springer, Heidelberg (1998)
16. Impagliazzo, R.: A personal view of average-case complexity. In: Structure in Complexity Theory Conference, pp. 134-147 (1995)
17. Kannan, R.: Algorithmic geometry of numbers. Annual Review of Computer Science 2, 231-267 (1987)
18. Kawachi, A., Tanaka, K., Xagawa, K.: Concurrently secure identification schemes based on the worst-case hardness of lattice problems. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 372-389. Springer, Heidelberg (2008)
19. Khot, S.: Hardness of approximating the shortest vector problem in lattices. In: FOCS, pp. 126-135 (2004)
20. Klivans, A., Sherstov, A.: Cryptographic hardness for learning intersections of half-spaces. In: FOCS, pp. 553-562 (2006)
21. Kumar, R., Sivakumar, D.: On the unique shortest lattice vector problem. Theor. Comput. Sci. 255(1-2), 641-648 (2001)
22. Lagarias, J.C., Odlyzko, A.M.: Solving low density subset sum problems. Journal of the ACM 32, 229-246 (1985)
23. Lenstra, A.K., Lenstra Jr., H.W., Lovasz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen (261), 513-534 (1982)
24. Liu, Y.-K., Lyubashevsky, V., Micciancio, D.: On bounded distance decoding for general lattices. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, pp. 450-461. Springer, Heidelberg (2006)
25. Lyubashevsky, V.: Lattice-based identification schemes secure under active attacks. In: Cramer, R. (ed.) PKC 2008. LNCS, vol. 4939, pp. 162-179. Springer, Heidelberg (2008)
26. Lyubashevsky, V., Micciancio, D.: Asymptotically efficient lattice-based digital signatures. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 37-54. Springer, Heidelberg (2008)
27. Micciancio, D.: Efficient reductions among lattice problems. In: SODA, pp. 84-93 (2008)
28. Micciancio, D., Goldwasser, S.: Complexity Of Lattice Problems: A Cryptographic Perspective. Kluwer Academic Publishers, Dordrecht (2002)
29. Micciancio, D., Regev, O.:Worst-case to average-case reductions based on Gaussian measures. SIAM J. on Computing 37(1), 267-302 (2007)
30. Micciancio, D., Vadhan, S.: Statistical zero-knowledge proofs with efficient provers: Lattice problems and more. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 282-298. Springer, Heidelberg (2003)
31. Nguyen, P.Q.: Cryptanalysis of the Goldreich-Goldwasser-Halevi cryptosystem from Crypto 1997. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 288-304. Springer, Heidelberg (1999)
32. Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem. In: STOC (2009)
33. Regev, O.: New lattice-based cryptographic constructions. J. ACM 51(6), 899-942 (2004)
34. Regev, O.: Quantum computation and lattice problems. SIAM J. Comput. 33(3), 738-760 (2004)
35. Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC (2005)