A signature scheme with message recovery as secure as discrete logarithm

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

Volumn 1716, Issue , 1999, Pages 1-12

  Abe, Masayuki ^a   Okamoto, Tatsuaki ^a  

^a NTT CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; GEOMETRY; HASH FUNCTIONS; RECOVERY; SECURITY OF DATA;

CHOSEN MESSAGE ATTACKS; CONCRETE ANALYSIS; DISCRETE LOGARITHMS; RANDOM FUNCTIONS; RANDOM ORACLE MODEL; SCHNORR SIGNATURE SCHEME; SECURITY REDUCTION; SIGNATURE SCHEME WITH MESSAGE RECOVERY;

AUTHENTICATION;

EID: 84956857891     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (20)

1. M. Bellare and P. Rogaway, “Random Oracles are Practical: A Paradigm for Designing Efficient Protocols,” Proc. of the First ACM Conference on Computer and Communications Security, pp.62–73, 1993.
2. M. Bellare and P. Rogaway, “The Exact Security of Digital Signatures –How to Sign with RSA and Rabin,” Proc. of Eurocrypt’96, Springer-Verlag, LNCS, pp.399–416, 1996. 378, 379
3. D. Bleichenbacher, “Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1,” Proc. of Crypto’98, LNCS 1462, Springer-Verlag, pp. 1–12, 1998. 378
4. R. Canetti, O. Goldreich and S. Halevi, “The Random Oracle Methodology, Revisited,” Proc. of STOC, ACM Press, pp.209–218, 1998. 379
5. J.S., D. Naccache and J.P. Stern, “On the Security of RSA Padding,” Proc. of Crypto’99, Springer-Verlag, LNCS, 1999. 378
6. T. ElGamal, “A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms,” IEEE Transactions on Information Theory, IT-31, 4, pp.469– 472, 1985.
7. A. Fiat and A. Shamir, “How to Prove Yourself,” Proc. of Crypto’86, Springer-Verlag, LNCS, pp.186–194.
8. U. Feige, A. Fiat and A. Shamir, “Zero-Knowledge Proofs of Identity,” J. of Cryp-tology, 1, p.77–94, 1988. 385
9. S. Goldwasser, S. Micali and R. Rivest, “A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks,” SIAM J. on Computing, 17, pp.281– 308, 1988. 379
10. N. Koblitz, “Elliptic Curve Cryptosystems,” Mathematics of Computation, 48, pp.203–209, 1987.
11. A. Miyaji, “A Message Recovery Signature Scheme Equivalent to DSA over Elliptic Curves,” Proc. of Asiacrypt’96, Springer-Verlag, LNCS, pp. 1–14, 1996. 378, 379
12. M. Naor and M. Yung, “Universal One-Way Hash Functions and Their Cryptographic Applications,” Proc. of STOC, pp.33–43, 1989.
13. K. Nyberg and R.A. Rueppel, “A New Signature Scheme Based on the DSA Giving Message Recovery,” Proc. of the First ACM Conference on Computer and Communications Security, 1993. 378
14. K. Nyberg and R.A. Rueppel, “Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem,” Proc. of Eurocrypt’94, Springer-Verlag, LNCS, pp.182–193, 1995. 378
15. K. Nyberg and R.A. Rueppel, “Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem,” Designs, Codes and Cryptography, 7, pp.61–81, 1996. 378
16. K. Ohta and T. Okamoto, “On the Concrete Security Treatment of Signatures Derived from Identification,” Proc. of Crypto’98, Springer-Verlag, LNCS, 1998. 381, 382, 383
17. D. Pointcheval and J. Stern, “Security Proofs for Signature Schemes,” Proc. of Eurocrypt’96, Springer-Verlag, LNCS, pp.387–398, 1996.
18. J. Rompel, “One-Way Functions are Necessary and Sufficient for Secure Signature,” Proc. of STOC, pp.387–394, 1990.
19. R. Rivest, A. Shamir and L. Adleman, “A Method for Obtaining Digital Signatures and Public Key Cryptosystems,” Communications of ACM, 21, 2, pp.120-126, 1978.
20. C.P. Schnorr, “Efficient Identification and Signatures for Smart Card,” Proc. of Eurocrypt’89, Springer-Verlag, LNCS, pp.235–251, 1990.