An efficient existentially unforgeable signature scheme and its applications

Journal of Cryptology

Volumn 11, Issue 3, 1998, Pages 187-208

  Dwork, Cynthia ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Authentication; Cryptography; Digital signatures; One way hash functions; Unforgeability

Indexed keywords

EID: 0010250829     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001459900043     Document Type: Article

References (35)

1. FIPS 180-1, Secure Hash Standard, NIST, US Dcpt. of Commerce, Washington DC, April1995.
2. [2j M. Ajtai, Generating Hard Instances of Lattice Problems, Proc. 2Slh ACM Annual Symposium on the Theory of Computing, 1996, pp. 99-108.
3. M. Bellare and S. Micali, How to Sign Given Any Trapdoor Function, J. Assoc. Compiit. Mach. 39 (1992), 214-233.
4. M. Bellare and P. Rogaway, The Exact Security of Digital Signatures How to Sign with RSA and Rabin, Advances in Cryptology-Eiirocrypt '96, Lecture Notes in Computer Science, vol. 1070, Springer-Verlag, Berlin,1996.
5. M. Bellare and P. Rogaway, Collision-Resistant Hashing Towards Making UOWHFs Practical, Advances in Cryptology-Crypto '91, Lecture Notes in Computer Science, Springer-Verlag, Berlin,1997.
6. D. Bleichenbacher, Generating El Gamal Signatures Without Knowing the Secret Key, Advances in Cryptology-Eumcrypt '96, Lecture Notes in Computer Science, vol. 1070, Springer-Verlag, Berlin,1996.
7. J. Bos and D. Chaum, Provably Unforgeable Signatures, Advances in Crypiohgy-Crypto'92, Lecture Notes in Computer Science, vol. 740, Springer-Verlag, Berlin,1993, pp. 1-14.
8. S. Brands, An Efficient Off-Line Electronic Cash System Based on the Representation Problem, Technical Report CS-R9323, CWI, Amsterdam,1993.
9. D. Chaum, E. van Heijst, and B. Pfitzmann, Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer, Advances in Ciyptology-Cryplo "91, Lecture Notes in Computer Science, vol. 576, Springer-Verlag, Berlin,1992, pp. 470-484.
10. R. Cramer and I. Damgard, New Generation of Secure and Practical RSA-Based Signatures, Advances in Cryptology-Crypto '96, Lecture Notes in Computer Science, vol. 1109, Springer-Verlag, Berlin,1996, pp. 173-185.
11. I. B. Damgard, Collision Free Hash Functions and Public Key Signature Schemes, Advances in Cryptology-Eurocrypt '87, Lecture Notes in Computer Science, vol. 304, Springer-Verlag, Berlin,1988, pp. 203-216.
12. W. Diffie and M. Hellman, New Directions in Cryptography, IEEE Trans. Infam. Theory, 22(6) ( 1976), 644-654.
13. H. Dobbertin, Cryptanalysis of MD5 Compress, presented at Eurocrypt '96 rump session.
14. T. El Gamal, A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, IEEE Trans. Inform. Theory, 31(4) (1985), 469-472
15. S. Even, O. Goldreich, and S. Micali, On-Line/Off-Line Digital Signatures, J. Cryptology, 9 (1996), 35-67.
16. A. Fiat, Batch RSA, Advances in Cryptology-Crypto '89, Lecture Notes in Computer Science, vol. 435, Springer-Verlag, Berlin,1990, pp. 175-185.
17. A. Fiat and A. Shamir, How to Prove Yourself, Advances in Cryptology-Crypto '86, Lecture Notes in Computer Science, vol. 263, Springer-Verlag, Berlin,1987, pp. 641-654.
18. A. Fiat and A. Shamir, Method, Apparatus, and Article for Identification and Signature, United States Patent 4,748,668 (5/31/88).
19. O. Goldreich, Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme, Advances in Cryptology-Crypto '86, Lecture Notes in Computer Science, vol. 263, Springer-Verlag, Berlin,1987, pp. 104-110.
20. O. Goldreich, S. Goldwasser, and S. Halevi, TR96-042, Electronic Colloquium on Computational Com-plexity, http//www.eccc.uni-trier.de/eccc/index.html.
21. S. Goldwasser, S. Micali, and R. Rivest, A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks, SIAMJ. Comput. 17(2) (1988), 281-301.
22. R. Impagliazzo and M. Naor, Efficient Cryptographic Schemes Provably as Secure as Subset-Sum, J. Cryptology, 9 (1996), 199-216.
23. R. Merkle, A Digital Signature Based on a Conventional Encryption Function, Advances in CryptologyCrypto '87, Lecture Notes in Computer Science, vol. 293, Springer-Verlag, Berlin,1988, pp. 369-378.
24. R. C. Merkle and M. Hellman, Hiding Information and Signature in Trapdoor Knapsack, IEEE Trans. Inform. Theory, 24 (1978), 525-530.
25. S. Micali and A. Shamir, An Improvement of the Fiat-Shamir Identification and Signature Scheme, Advances in Cryptology-Crypto '88, Lecture Notes in Computer Science, vol. 403, Springer-Verlag, Berlin,1990, pp. 244-247.
26. M. Naor and M. Yung, Universal One Way Hash Functions and Their Cryptographic Applications, Proc. 2lst ACM Annual Symposium on the Theory of Computing, 1989, pp. 33-43.
27. Lotus Notes Internals online book.
28. D. Pointcheval and J. Stern. Security Proofs for Signature Schemes. Advances in Cryptology-Eurocrypt '96, Lecture Notes in Computer Science, vol. 1070, Springer-Verlag, Berlin,1996, pp. 387-398.
29. M. O. Rabin Digital Signatures and Public Key Functions as Intractable as Factoring, Technical Memo TM-212, Lab. for Computer Science, MIT, Jan.1979.
30. R. Rivest, A. Shamir, and L. Adleman, A Method for Obtaining Digital Signature and Public Key CryptoSystems, Comm.ACM, 21 (1978), 120-126.
31. R. Rivest, The MD5 Message Digest Algorithm, RFC 1321, April1991.
32. J. Rompel, One-way Function Are Necessary and Sufficient for Signatures, Proc. 22nd ACM Annual Symposium on the Theory of Computing, 1990, pp. 387-394.
33. C. P. Schnorr, Efficient Signature Generation by Smart Cards, J. Cryptology, 4 (1991), 161-174.
34. C. P. Schnorr and H. H. Hörner, Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction, Advances in Cryptology-Eurocrypt '95, Lecture Notes in Computer Science, vol. 925, Springer-Verlag, Berlin,1995, pp. 1-12.
35. A. Shamir, On the Generation of Cryptographically Strong Pseudo-Random Number Sequences, ACM Trans. Comput. Systems, 1 (1983), 38-44.