Efficient generic forward-secure signatures with an unbounded number of time periods

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

Volumn 2332, Issue , 2002, Pages 400-417

  Malkin, Tal ^a   Micciancio, Daniele ^b,c   Miner, Sara ^b,c  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; EXPONENTIAL FUNCTIONS; NETWORK SECURITY;

DIGITAL SIGNATURE SCHEMES; FORWARD SECURITY; FORWARD-SECURE; FORWARD-SECURE SIGNATURES; RANDOM ORACLE; SECURITY PARAMETERS; SIGNATURE SCHEME; THE STANDARD MODEL;

AUTHENTICATION;

EID: 84947234528     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46035-7_27     Document Type: Conference Paper

References (16)

1. R. Anderson. Two remarks on public-key cryptology. Manuscript, Sep. 2000. Relevant material presented by the author in an invited lecture at the Fourth ACM Conference on Computer and Communications Security (Apr. 1997).
2. M. Abdalla and L. Reyzin. A new forward-secure digital signature scheme. In Advances in Cryptology - Asiacrypt 2000, LNCS 1976 (Dec. 2000), pp. 116-129.
3. M. Bellare and S. Miner. A forward-secure digital signature scheme. In Advances in Cryptology - CRYPTO ’99, LNCS 1666 (Aug. 1999), pp. 431-448.
4. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudorandom bits. SIAM Journal of Computing 13(4)(Nov. 1984), pp. 850-864.
5. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, 33(4)(Oct. 1986), pp. 281–308. Preliminary version in the Proceedings of the IEEE Symposium on the Foundations of Computer Science, 1984, pp 464–479.
6. S. Goldwasser, S. Micali and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal of Computing 17(2)(Apr. 1988), pp. 281–308.
7. L.C. Guillou and J.J. Quisquater. A “paradoxical”identity-b ased signature scheme resulting from zero-knowledge. In Advances in Cryptology - CRYPTO ’88, LNCS 403 (Aug. 1988), pp. 216–231.
8. G. Itkis and L. Reyzin. Forward-secure signatures with optimal signing and verifying. In Advances in Cryptology - CRYPTO ’01, LNCS 2139 (Aug. 2001), pp. 332–354.
9. H. Krawczyk. Simple forward-secure signatures from any signature scheme. In Seventh ACM Conference on Computer and Communications Security (Nov. 2000), pp. 108–115.
10. R. C. Merkle. A certified digital signature. In Advances in Cryptology – CRYPTO ’89, (Aug. 1989), pp. 218–238.
11. S. Micali. A secure and efficient digital signature algorithm. Technical Report MIT/LCS/TM-501, Massachusetts Institute of Technology, March 1994.
12. T. Malkin, D. Micciancio and S. Miner. Efficient generic forward-secure signatures with and unbounded number of time periods. Full version of this paper, available at http://eprint.iacr.org/2001/034/.
13. M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. In Proceedings of the ACM Symposium on Theory of Computing, 1989, pp. 33–43.
14. M. Rabin. Digital signatures and public key functions as intractable as factorization. MIT Laboratory for Computer Science Report TR-212, January 1979.
15. J. Rompel. One-way functions are necessary and sufficient for secure signatures. In Proceedings of the ACM Symposium on Theory of Computing, 1990, pp. 387–394.
16. A. Yao. Theory and applications of trapdoor functions. In Proceedings of the IEEE Symposium on the Foundations of Computer Science, 1982, pp. 80–91.