Lattice-based cryptography

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

Volumn 4117 LNCS, Issue , 2006, Pages 131-141

  Regev, Oded ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA; SECURITY SYSTEMS;

CRYPTOGRAPHIC SCHEMES; LATTICE BASED CRYPTOGRAPHY;

CRYPTOGRAPHY;

EID: 33749553753     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11818175_8     Document Type: Conference Paper

References (39)

1. Lenstra, A.K., Lenstra, Jr., H.W., Lovasz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261 (1982) 515-534
2. Lenstra, Jr., H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8 (1983) 538-548
3. Babai, L.: On Lovasz' lattice reduction and the nearest lattice point problem. Combinatorica 6 (1986) 1-13 Preliminary version in STACS 1985.
4. Lagarias, J.C., Odlyzko, A.M.: Solving low-density subset sum problems. J. Assoc. Comput. Mach. 32 (1985) 229-246
5. Coppersmith, D.: Finding small solutions to small degree polynomials. Lecture Notes in Computer Science 2146 (2001) 20-31
6. Goldreich, O., Goldwasser, S.: On the limits of nonapproximability of lattice problems. Journal of Computer and System Sciences 60 (2000) 540-563 Preliminary version in STOC 1998.
7. Aharonov, D., Regev, O.: Lattice problems in NP intersect coNP. Journal of the ACM 52 (2005) 749-765 Preliminary version in FOCS 2004.
8. Khot, S.: Hardness of approximating the shortest vector problem in lattices. In: Proc. 45th Annual IEEE Symp. on Foundations of Computer Science (FOCS). (2004) 126-135
9. Ajtai, M.: Generating hard instances of lattice problems. In: Proc. 28th ACM Symp. on Theory of Computing. (1996) 99-108 Available from ECCC at http://www.uni-trier.de/eccc/.
10. Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. on Computing 26 (1997) 1484-1509
11. Goldreich, O., Goldwasser, S., Halevi, S.: Public-key cryptoSystems from lattice reduction problems. In: Advances in cryptology. Volume 1294 of Lecture Notes in Comput. Sci. Springer (1997) 112-131
12. Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Algorithmic number theory (ANTS). Volume 1423 of Lecture Notes in Comput. Sci. Springer (1998) 267-288
13. Hoffstein, J., Graham, N.A.H., Pipher, J., Silverman, J.H., Whyte, W.: NTRUSIGN: Digital signatures using the NTRU lattice. In: Proc. of CT-RSA. Volume 2612 of Lecture Notes in Comput. Sci., Springer-Verlag (2003) 122-140
14. Nguyen, P.Q., Stern, J.: The two faces of lattices in cryptology. In Silverman, J.H., ed.: Cryptography and Lattices, International Conference (CaLC 2001). Number 2146 in Lecture Notes in Computer Science (2001) 146-180
15. Kumar, R., Sivakumar, D.: Complexity of SVP - a reader's digest. SIGACT News 32 (2001) 40-52
16. Micciancio, D.: Lattices in cryptography and cryptanalysis (2002) Lecture notes of a course given in UC San Diego.
17. Regev, O.: Lattices in computer science (2004) Lecture notes of a course given in Tel Aviv University.
18. Micciancio, D., Goldwasser, S.: Complexity of Lattice Problems: A Cryptographic Perspective. Volume 671 of The Kluwer International Series in Engineering and Computer Science. Kluwer Academic Publishers, Boston, Massachusetts (2002)
19. Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proc. 33rd ACM Symp. on Theory of Computing. (2001) 601-610
20. Lagarias, J.C., Lenstra, Jr., H.W., Schnorr, C.P.: Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. Combinatorica 10 (1990) 333-348
21. Goldreich, O., Goldwasser, S., Halevi, S.: Collision-free hashing from lattice problems. Technical Report TR96-056, Electronic Colloquium on Computational Complexity (ECCC) (1996)
22. Cai, J.Y., Nerurkar, A.: An improved worst-case to average-case connection for lattice problems. In: Proc. 38th IEEE Symp. on Found, of Comp. Science. (1997) 468-477
23. Micciancio, D.: Improved cryptographic hash functions with worst-case/average-case connection. In: Proc. 34th ACM Symp. on Theory of Computing (STOC). (2002) 609-618
24. Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. In: Proc. 45th Annual IEEE Symp. on Foundations of Computer Science (FOCS). (2004) 372-381
25. Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions. Computational Complexity (2006) To appear. Preliminary version in ECCC report TR04-095.
26. Lyubashevsky, V., Micciancio, D.: Generalized compact knapsacks are collision resistant. In: 33rd International Colloquium on Automata, Languages and Programming (ICALP). (2006)
27. Peikert. C., Rosen, A.: Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices. In: 3rd Theory of Cryptography Conference (TCC). (2006) 145-166
28. Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case/average- case equivalence. In: Proc. 29th Annual IEEE Symp. on Foundations of Computer Science (FOCS). (1997) 284-293
29. Goldreich, O., Goldwasser, S., Halevi, S.: Eliminating decryption errors in the Ajtai-Dwork cryptosystem. In: Advances in cryptology. Volume 1294 of Lecture Notes in Comput. Sci. Springer (1997) 105-111
30. Regev, O.: New lattice-based cryptographic constructions. Journal of the ACM 51 (2004) 899-942 Preliminary version in STOC'03.
31. Ajtai, M.: Representing hard lattices with O(n log n) bits. In: Proc. 37th Annual ACM Symp. on Theory of Computing (STOC). (2005)
32. Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proc. 37th ACM Symp. on Theory of Computing (STOC). (2005) 84-93
33. Banaszczyk, W.: New bounds in some transference theorems in the geometry of numbers. Mathematische Annalen 296 (1993) 625-635
34. Nguyen, P., Stern, J.: Cryptanalysis of the Ajtai-Dwork cryptosystem. In: Advances in cryptology (CRYPTO). Volume 1462 of Lecture Notes in Comput. Sci. Springer (1998) 223-242
35. Schnorr, C.P.: Factoring integers and computing discrete logarithms via Diophantine approximation. In Cai, J.Y., ed.: Advances in computational complexity. Volume 13 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. AMS (1993) 171-182 Preliminary version in Eurocrypt '91.
36. Adleman, L.M.: Factoring and lattice reduction (1995) Unpublished manuscript.
37. Micciancio, D., Vadhan, S.: Statistical zero-knowledge proofs with efficient provers: lattice problems and more. In: Advances in cryptology (CRYPTO). Volume 2729 of Lecture Notes in Computer Science., Springer-Verlag (2003) 282-298
38. Dwork, C., Naor, M., Reingold, O.: Immunizing encryption schemes from decryption errors. In: Advances in cryptology (EUROCRYPT). Volume 3027 of Lecture Notes in Comput. Sci. Springer (2004) 342-360
39. Klivans, A., Sherstov, A.: Cryptographic hardness results for learning intersections of halfspaces (2006) Available as ECCC report TR06-057.