A new forward-secure digital signature scheme

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

Volumn 1976, Issue , 2000, Pages 116-129

  Abdalla, Michel ^a   Reyzin, Leonid ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Concrete security; Digital signatures; Forward security; Proven security

Indexed keywords

AUTHENTICATION; CRYPTOGRAPHY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; MINERS;

CONCRETE SECURITIES; DIGITAL SIGNATURE SCHEMES; FORWARD SECURITY; FORWARD-SECURE; PROVEN SECURITY; RANDOM ORACLE; RANDOM ORACLE MODEL; SIGNATURE SCHEME;

NETWORK SECURITY;

EID: 84937427768     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44448-3_10     Document Type: Conference Paper

References (20)

1. M. Abdalla and L. Reyzin, “A New Forward-Secure Digital Signature Scheme,” Cryptology ePrint Archive Report 2000/002 at http://eprint.iacr.org/(full version of this paper). Also available from authors’ websites.
2. R. Anderson, Invited lecture, Fourth Annual Conference on Computer and Communications Security, ACM, 1997.
3. M. Bellare and S. Miner, “A forward-secure digital signature scheme,” Advances in Cryptology –Crypto 99 Proceedings, Lecture Notes in Computer Science Vol. 1666, M. Wiener ed., Springer-Verlag, 1999.
4. M. Bellare and P. Rogaway, “Random oracles are practical: a paradigm for designing efficient protocols,” Proceedings of the First Annual Conference on Computer and Communications Security, ACM, 1993.
5. M. Bellare and P. Rogaway, “The exact security of digital signatures: How to sign with RSA and Rabin,” Advances in Cryptology –Eurocrypt 96 Proceedings, Lecture Notes in Computer Science Vol. 1070, U. Maurer ed., Springer-Verlag, 1996.
6. R. Cramer and I. Damgård, “Secure signature schemes based on interactive protocols,” Advances in Cryptology –Crypto 95 Proceedings, Lecture Notes in Computer Science Vol. 963, D. Coppersmith ed., Springer-Verlag, 1995.
7. R. Cramer and V. Shoup, “Signature schemes based on the Strong RSA Assumption,” Sixth Annual Conference on Computer and Communications Security, ACM, 1999.
8. W. Diffie, P. van Oorschot, and M. Wiener, “Authentication and authenticated key exchanges,” Designs, Codes and Cryptography, 2, 1992, pp. 107–125.
9. S. Even, O. Goldreich, and S. Micali, “On-line/Off-line digital signatures,” Jounal of Cryptology, Vol. 9, 1996, pp. 35–67.
10. A. Fiat and A. Shamir, “How to prove yourself: Practical solutions to identification and signature problems,” Advances in Cryptology –Crypto 86 Proceedings, Lecture Notes in Computer Science Vol. 263, A. Odlyzko ed., Springer-Verlag, 1986.
11. O. Goldreich, “Two remarks concerning the GMR signature scheme,” Advances in Cryptology –Crypto 86 Proceedings, Lecture Notes in Computer Science Vol. 263, A. Odlyzko ed., Springer-Verlag, 1986.
12. S. Goldwasser, S. Micali and R. Rivest, “A digital signature scheme secure against adaptive chosen-message attacks,” SIAM Journal of Computing, Vol. 17, No. 2, pp. 281–308, April 1988.
13. L. Guillou and J. Quisquater, “A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory,” Advances in Cryptology –Eurocrypt 88 Proceedings, Lecture Notes in Computer Science Vol. 330, C. Gunther ed., Springer-Verlag, 1988.
14. C. Günther, “An identity-based key-exchange protocol,” Advances in Cryptology –Eurocrypt 89 Proceedings, Lecture Notes in Computer Science Vol. 434, J-J. Quisquater, J. Vandewille ed., Springer-Verlag, 1989.
15. C. H. Lim and P J. Lee, “More Flexible Exponentiation with Precomputation,” Advances in Cryptology –Crypto 94 Proceedings, Lecture Notes in Computer Science Vol. 839, Y. Desmedt ed., Springer-Verlag, 1994
16. H. Ong and C. Schnorr, “Fast signature generation with a Fiat-Shamir like scheme,” Advances in Cryptology –Eurocrypt 90 Proceedings, Lecture Notes in Computer Science Vol. 473, I. Damgård ed., Springer-Verlag, 1990.
17. S. Micali, “A secure and efficient digital signature algorithm,” Technical Report MIT/LCS/TM-501, Massachusetts Institute of Technology, Cambridge, MA, March 1994.
18. S. Micali and L. Reyzin, “Improving the exact security of Fiat-Shamir signature schemes.” In R. Baumgart, editor, Secure Networking — CQRE [Secure] ’99, volume 1740 of Lecture Notes in Computer Science, pages 167–182, Springer- Verlag, 1999.
19. K. Ohta and T. Okamoto. “A Modification of the Fiat-Shamir Scheme,” Advances in Cryptology –Crypto 88 Proceedings, Lecture Notes in Computer Science Vol. 403, S. Goldwasser ed., Springer-Verlag, 1988, pp. 232-243.
20. D. Pointcheval and J. Stern, “Security proofs for signature schemes,” Advances in Cryptology –Eurocrypt 96 Proceedings, Lecture Notes in Computer Science Vol. 1070, U. Maurer ed., Springer-Verlag, 1996.