Fine-grained forward-secure signature schemes without random oracles

Discrete Applied Mathematics

Volumn 154, Issue 2, 2006, Pages 175-188

  Camenisch, Jan ^a   Koprowski, MacIej ^b  

^a IBM RESEARCH ZURICH   (Switzerland)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

Digital signatures; Forward security; Non repudiation

Indexed keywords

MATHEMATICAL MODELS; RANDOM PROCESSES; SECURITY OF DATA;

DIGITAL SIGNATURE; FORWARD SECURITY; NON-REPUDIATION;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 29244452117     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.03.028     Document Type: Conference Paper

References (20)

1. M. Abdalla, L. Reyzin, A new forward-secure digital signature scheme, in: ASIACRYPT: Advances in Cryptology - ASIACRYPT: International Conference on the Theory and Application of Cryptology, Lecture Notes in Computer Science, vol. 1976, Springer, Berlin, 2000, pp. 116-129.
2. R.J. Anderson, Invited lecture, Fourth Annual Conference on Computer and Communications Security, see also http://www.cl.cam.ac.uk/ftp/users/rja14/ forwardsecure.pdf. (1997).
3. M. Bellare, and S.K. Miner A forward-secure digital signature scheme M. Wiener Advances in Cryptology - CRYPTO '99, Lecture Notes in Computer Science vol. 1666 1999 Springer Berlin 431 448
4. M. Bellare, P. Rogaway, Random oracles are practical: A paradigm for designing efficient protocols, in: First ACM Conference on Computer and Communication Security, Association for Computing Machinery, 1993, pp. 62-73.
5. R. Canetti, O. Goldreich, S. Halevi, The random oracle methodology, revisited, in: Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1998, pp. 209-218.
6. R. Cramer, I. Damgaard, Secure signature schemes based on interactive protocols, in: Proceedings of CRYPTO '95, Lecture Notes in Computer Science, vol. 963, Springer, Berlin, 1995, pp. 297-310.
7. R. Cramer, I. DamgÅrd, New generation of secure and practical RSA-based signatures, in: Advances in Cryptology - CRYPTO '96, Springer, Berlin, 1996, pp. 173-185.
8. R. Cramer, V. Shoup, Signature schemes based on the strong RSA assumption, in: ACM Conference on Computer and Communications Security, 1999, pp. 46-51.
9. E. Cronin, S. Jamin, T. Malkin, P. McDaniel, On the performance, feasibility, and use of forward-secure signatures, in: Proceedings of the 10th ACM Conference on Computer and Communication Security, ACM Press, New York, NY, USA, 2003, pp. 131-144.
10. I. DamgÅrd, M. Koprowski, Generic lower bounds for root extraction and signature schemes in general groups, in: L. R. Knudsen (Ed.), EUROCRYPT 2002, Lecture Notes in Computer Science, vol. 2332, Springer, Berlin, 2002, pp. 256-271.
11. Y. Dodis, J. Katz, S. Xu, M. Yung, Strong key-insulated signature schemes, in: Y. Desmedt (Ed.), Sixth International Workshop on Practice and Theory in Public Key Cryptography, Lecture Notes in Computer Science, vol. 2567, Springer, Berlin, 2003, pp. 130-144.
12. M. Fischlin, The Cramer-Shoup strong-RSA signature scheme revisited, in: Y. Desmedt (Ed.), Sixth International Workshop on Practice and Theory in Public Key Cryptography, Lecture Notes in Computer Science, vol. 2567, Springer, Berlin, 2003, pp. 116-129.
13. S. Goldwasser, S. Micali, and R. Rivest A digital signature scheme secure against adaptive chosen-message attacks SIAM J. Comput. 17 2 1988 281 308
14. G. Itkis, and L. Reyzin Forward-secure signatures with optimal signing and verifying J. Kilian CRYPTO, Lecture Notes in Computer Science vol. 2139 2001 Springer Berlin 332 354
15. G. Itkis, L. Reyzin, SiBIR: Signer-base intrusion-resilient signatures, in: Proceedings of Crypto'02, Lecture Notes in Computer Science, vol. 2442, 2002, Springer, Berlin, pp. 499-514.
16. A. Kozlov, L. Reyzin, Forward-secure signatures with fast key update, in: Proceedings of Security in Communication Networks, Lecture Notes in Computer Science, vol. 2576, 2002, pp. 241-256.
17. T. Malkin, D. Micciancio, and S. Miner Efficient forward-secure signatures with an unbounded number of time periods L. Knudsen Eurocrypt, Lecture Notes in Computer Science vol. 2332 2002 Springer Berlin 400 417
18. D. Micciancio, private communication, August 2002.
19. J.B. Nielsen, Separating random oracle proofs from complexity theorundetic proofs: The non-committing encryption case, in: Proceedings of Crypto, Lecture Notes in Computer Science, vol. 2442, Springer, Berlin, 2002, pp. 111-126.
20. C.P. Schnorr Efficient signature generation for smart cards J. Cryptology 4 3 1991 239 252