Asymptotically efficient lattice-based digital signatures

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

Volumn 4948 LNCS, Issue , 2008, Pages 37-54

  Lyubashevsky, Vadim ^a   Micciancio, Daniele ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS CONTROL; ALGORITHMS; APPROXIMATION THEORY; ASYMPTOTIC ANALYSIS; AUTHENTICATION; CRYPTOGRAPHY; DIGITAL ARITHMETIC; EVOLUTIONARY ALGORITHMS; VECTORS;

(ALGORITHMIC) COMPLEXITY; (E ,2E) THEORY; DIGITAL SIGNATURE SCHEMES; DIGITAL SIGNATURES; HEIDELBERG (CO); LATTICE (CO); LATTICE PROBLEMS; POLY-LOGARITHMIC FACTORS; POLYNOMIAL FACTORING; PROVABLY SECURE; SPRINGER (CO); TIME COMPLEXITIES; VERIFICATION ALGORITHMS; WORST CASE;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 40249114814     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78524-8_3     Document Type: Conference Paper

References (29)

1. Aharonov, D., Regev, O.: Lattice problems in NP ∩ coNP. Journal of the ACM 52(5), 749-765 (2005)
2. Ajtai, M.: Generating hard instances of lattice problems. Complexity of Computations and Proofs, Quaderni di Matematica 13, 1-32 (2004) (Preliminary version in STOC 1996)
3. Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: STOC, pp. 601-610 (2001)
4. Bleichenbacher, D., Maurer, U.: On the efficiency of one-time digital signatures. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol. 1163, pp. 145-158. Springer, Heidelberg (1996)
5. Bleichenbacher, D., Maurer, U.: Optimal tree-based one-time digital signature schemes. In: Puech, C., Reischuk, R. (eds.) STAGS 1996. LNCS, vol. 1046, pp. 363-374. Springer, Heidelberg (1996)
6. Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput. 13(4), 850-864 (1984)
7. Bos, J., Chaum, D.: Provably unfbrgeable signatures. In: McCurley, K.S., Ziegler, CD. (eds.) Advances in Cryptology 1981 - 1997. LNCS, vol. 1440, pp. 1-14. Springer, Heidelberg (1999)
8. Cramer, R., Shoup, V.: Signature schemes based on the strong RSA assumption. ACM Trans. Inf. Syst. Secur. 3(3), 161-185 (2000)
9. Diffie, W., Hellman, M.: New directions in cryptography. IEEE Transactions on Information Theory IT-22(6), 644-654 (1976)
10. Dinur, I.: Approximating SVP∞ to within almost-polynomial factors is NP-hard. Theor. Comput. Sci. 285(1), 55-71 (2002)
11. Even, S., Goldreich, O., Micali, S.: On-line/off-line digital signatures. J. Cryptology 9(1), 35-67 (1996)
12. Gennaro, R., Gertner, Y., Katz, J., Trevisan, L.: Bounds on the efficiency of generic cryptographic constructions. SIAM Journal on Computing 35(1), 217-246 (2005)
13. Gennaro, R., Halevi, S., Rabin, T.: Secure hash-and-sign signatures without the random oracle. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 123-139. Springer, Heidelberg (1999)
14. Goldreich, O., Goldwasser, S.: On the limits of nonapproximability of lattice problems. J. Comput. Syst. Sci. 60(3) (2000)
15. Goldwasser, S., Micali, S., Rivest, R.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput. 17(2), 281-308 (1988)
16. Hevia, A., Micciancio, D.: The provable security of graph-based one-time signatures and extensions to algebraic signature schemes. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 379-396. Springer, Heidelberg (2002)
17. Kumar, R., Sivakumar, D.: On polynomial-factor approximations to the shortest lattice vector length. SIAM J. Discrete Math. 16(3), 422-425 (2003)
18. 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)
19. Lyubashevsky, V., Micciancio, D., Peikert, C., Rosen, R.: Provably secure FFT hashing. Technical report, 2nd NIST Cryptographic Hash Function Workshop (2006)
20. Merkle, R.: A digital signature based on a conventional encryption function. In: McCurley, K.S., Ziegler, CD. (eds.) Advances in Cryptology 1981. - 1997. LNCS, vol. 1440, pp. 369-378. Springer, Heidelberg (1999)
21. Merkle, R.: A certified digital signature. In: McCurley, K.S., Ziegler, C.D. (eds.) Advances in Cryptology 1981 - 1997. LNCS, vol. 1440, pp. 218-238. Springer, Heidelberg (1999)
22. Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions. Computational Complexity (2007) (Special issue on worst-case versus average-case complexity, in print. Available on-line as doi:10.1007/s00037-007-0234-9. Preliminary version in FOCS 2002)
23. Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: STOC, pp. 33-43 (1989)
24. Pedersen, T., Pfitzmann, B.: Fail-stop signatures. SIAM J. Comput. 26(2), 291-330 (1997)
25. 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, Springer, Heidelberg (2006)
26. Peikert, C., Rosen, A.: Lattices that admit logarithmic worst-case to average-case connection factors. In: STOC (2007)
27. Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: STOC, pp. 387-394 (1990)
28. Szydlo, M.: Merkle tree traversal in log space and time. In: Cachiri, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 541-554. Springer, Heidelberg (2004)
29. van Emde Boas, P.: Another NP-compIete problem and the complexity of computing short vectors in a lattice. Technical Report 81.-04, University of Amsterdam (1981), http://turing.wins.uva.nl/~peter/