An efficient existentially unforgeable signature scheme and its applications

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

Volumn 839 LNCS, Issue , 1994, Pages 234-246

  Dwork, Cynthia ^a   Naor, Moni ^b  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

ITS APPLICATIONS; SECURITY PARAMETERS; SIGNATURE SCHEME;

AUTHENTICATION;

EID: 84978970262     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48658-5_23     Document Type: Conference Paper

References (20)

1. M. Bellare and S. Micali, How to Sign Given Any Trapdoor Function, Proc. 20th ACM Annual Symposium on the Theory of Computing, 1988, pp.32–42.
2. J. Bos and D. Chaum, Provably Unforgeable Signatures, Proc. Advances in Cryptology — Crypto’92 Proceedings, Springer Verlag, 1993, pp. 1–14.
3. W. Diffie and M. Hellman, New Directions in Cryptography, IEEE Trans. on Information Theory 22(6), 1976, pp. 644-654.
4. T. El Gamal, A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, IEEE Trans. Inform. Theory, IT-31(4), 1985, pp. 469–4725.
5. S. Even, O. Goldreich, and S. Micali, On-line/Off-line Digital Signatures, Proc. Advances in Cryptology — Crypto’ 89, Springer Verlag, pp. 263–275, 1990.
6. A. Fiat, Batch RSA, Proc. Advances in Cryptology — Crypto’ 89, Springer Verlag, 1990.
7. A. Fiat and A. Shamir, How to Prove Yourself, Proc. of Advances in Cryptology — Crypto’ 86, Springer Verlag, 1987, pp. 641–654.
8. A. Fiat and A. Shamir, Method, Apparatus, and Article for Identification and Signature, United States Patent 4,748,668 (5/31/88)
9. O. Goldreich, Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme, Proc. Advances in Cryptology — Crypto’ 86, Springer Verlag, 1987.
10. S. Goldwasser, S. Micali, and R. Rivest, A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks, SIAM J. Computing 17(2), pp. 281–301, 1988.
11. R. Impagliazzo and M. Naor, Efficient Cryptographic Schemes Provably as Secure as Subset Sum, Proc. of the 30th Symp. on Foundations of Computer Science, 1989, pp. 236–241. Full version: Technical Report CS93-12, Weizmann Institute.
12. R. Merkle, A Digital Signature Based on a Conventional Encryption Function, Proc. Advances in Cryptology — Crypto’ 87, Springer Verlag, 1988, pp. 369–378.
13. R. C. Merkle and M. Hellman, Hiding information and Signature in Trapdoor Knapsack, IEEE Transaction on Information Theory, Vol 24, 1978, pp. 525–530.
14. S. Micali and A. Shamir, An Improvement of the Fiat-Shamir Identification and Signature Scheme, Proc. Advances in Cryptology — Crypto’ 88, LNCS 403, Springer-Verlag, pp. 244–247, 1990
15. M. Naor and M. Yung, Universal One Way Hash Functions and Their Cryptographic Applications, Proc. 21st ACM Annual Symposium on the Theory of Computing, 1989, pp. 33–43.
16. M. O. Rabin Digital Signatures and Public Key Functions as Intractable as Factoring, Technical Memo TM-212, Lab. for Computer Science, MIT, 1979.
17. R. Rivest, A. Shamir, and L. Adelman, A Method for Obtaining Digital Signature and Public Key
18. 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.
19. C. P. Schnorr, Efficient Signature Generation by Smart Cards, J. Cryptology 4, pp. 161–174, 1991.
20. A. Shamir, On the Generation of Cryptographically Strong Pseudo-Random Number Sequences, ACM Trans. Comput. Sys., 1 (1983), pp. 38–44.