Efficient public key encryption based on ideal lattices

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

Volumn 5912 LNCS, Issue , 2009, Pages 617-635

  Stehlé, Damien ^a,b   Steinfeld, Ron ^b   Tanaka, Keisuke ^c   Xagawa, Keita ^c  

^a UNIVERSITY OF SYDNEY   (Australia)

^b MACQUARIE UNIVERSITY   (Australia)

^c TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC PERFORMANCE; BOUNDED DISTANCE DECODING; ENCRYPTION AND DECRYPTION; KEY GENERATION; LATTICE VECTORS; ONE-WAY FUNCTIONS; PUBLIC-KEY ENCRYPTION; PUBLIC-KEY ENCRYPTION SCHEME; SECURITY PARAMETERS; SHORTEST VECTOR PROBLEM; TECHNICAL TOOLS; WORST CASE;

COMPUTER CRIME; DECODING; PUBLIC KEY CRYPTOGRAPHY; QUANTUM COMPUTERS;

NETWORK SECURITY;

EID: 72449142727     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10366-7_36     Document Type: Conference Paper

References (36)

1. Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Proceedings of STOC 1996, pp. 99-108. ACM, New York (1996)
2. Ajtai, M.: Generating hard instances of the short basis problem. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 1-9. Springer, Heidelberg (1999)
3. Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case/average- case equivalence. In: Proceedings of STOC 1997, pp. 284-293. ACM, New York (1997)
4. Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proceedings of STOC 2001, pp. 601-610. ACM, New York (2001)
5. Alwen, J., Peikert, C.: Generating shorter bases for hard random lattices. In: STACS 2009. LNCS. Springer, Heidelberg (2009)
6. Babai, L.: On Lovász' lattice reduction and the nearest lattice point problem. Combinatorica 6, 1-13 (1986)
7. p with prime p ≡ 3 mod 4. App. Alg. in Eng., Comm. and Comp. 4, 89-94 (1992)
8. Fiat, A., Shamir, A.: How to prove yourself - practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186-194. Springer, Heidelberg (1987)
9. Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of STOC 2008, pp. 197-206. ACM, New York (2008)
10. Goldreich, O.: Foundations of Cryptography. Basic Applications, vol. II. Cambridge University Press, Cambridge (2001)
11. 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)
12. 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)
13. Holenstein, T., Maurer, U., Sjödin, J.: Complete classification of bilinear hard-core functions. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 73-91. Springer, Heidelberg (2004)
14. 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)
15. 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)
16. Lyubashevsky, V.: Towards Practical Lattice-Based Cryptography. PhD thesis, University of California, San Diego (2008)
17. Lyubashevsky, V., Micciancio, D.: Generalized compact knapsacks are collision resistant. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 144-155. Springer, Heidelberg (2006)
18. 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)
19. Lyubashevsky, V., Micciancio, D.: On bounded distance decoding, unique shortest vectors, and the minimum distance problem. In: Halevi, S. (ed.) Crypto 2009. LNCS, vol. 5677, pp. 450-461. Springer, Heidelberg (2009)
20. Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions. Computational Complexity 16(4), 365-411 (2007)
21. Micciancio, D., Goldwasser, S.: Complexity of lattice problems: a cryptographic perspective. Kluwer Academic Press, Dordrecht (2002)
22. Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measures. SIAM J. Comput. 37(1), 267-302 (2007)
23. Micciancio, D., Regev, O.: Lattice-based Cryptography. In: Post-Quantum Cryptography. Springer, Heidelberg (2008)
24. 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)
25. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
26. Pan, V.Y.: Structured matrices and polynomials, unified superfast algorithms. Springer and Birkhäuser (2001)
27. p norms. Computational Complexity 2(17), 300-351 (2008)
28. Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem. In: Proceedings of STOC 2009, pp. 333-342. ACM, New York (2009)
29. Peikert, C., Rosen, A.: Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 145-166. Springer, Heidelberg (2006)
30. Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 554-571. Springer, Heidelberg (2008)
31. Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: Proceedings of STOC 2008, pp. 187-196. ACM, New York (2008)
32. Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. Extended version of [33], May 2 (2009), http://www.cs.tau.ac.il/ ~odedr/
33. Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of STOC 2005, pp. 84-93. ACM, New York (2005)
34. Rosen, A., Segev, G.: Chosen-ciphertext security via correlated products. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 419-436. Springer, Heidelberg (2009)
35. Schnorr, C.P.: A hierarchy of polynomial lattice basis reduction algorithms. Theor. Comput. Sci 53, 201-224 (1987)
36. Schnorr, C.P.: Hot topics of LLL and lattice reduction. In: The Proceedings of the LLL+25 conference (to appear, 2009)