Design validations for discrete logarithm based signature schemes

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

Volumn 1751, Issue , 2000, Pages 276-292

  Brickell, Ernest ^a   Pointcheval, David ^b   Vaudenay, Serge ^c   Yung, Moti ^d  

^a INTEL CORPORATION   (United States)

^b CNRS   (France)

^c EPFL   (Switzerland)

^d CertCo   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHROMIUM COMPOUNDS; COMPUTATION THEORY; HASH FUNCTIONS; NETWORK SECURITY; PUBLIC KEY CRYPTOGRAPHY;

ALGEBRAIC STRUCTURES; CHOSEN MESSAGE ATTACKS; CRYPTOGRAPHIC HASH FUNCTIONS; DISCRETE LOGARITHM PROBLEMS; DISCRETE LOGARITHMS; FORMAL VALIDATION; GLOBAL STANDARDIZATION; MATHEMATICAL OPERATIONS;

AUTHENTICATION;

EID: 84957808681     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-46588-1_19     Document Type: Conference Paper

References (31)

1. R. Anderson and S. Vaudenay. Minding your p's and q's. In Asiacrypt '96,LNCS 1163, pages 26-35. Springer-Verlag, Berlin, 1996.
2. M. Bellare and P. Rogaway. Random Oracles Are Practical: a Paradigm for Designing Efficient Protocols. In Proc. of the 1st CCCS, pages 62-73. ACM Press, New York, 1993.
3. M. Bellare and P. Rogaway. Optimal Asymmetric Encryption - How to Encrypt with RSA. In Eurocrypt '94, LNCS 950, pages 92-111. Springer-Verlag, Berlin, 1995.
4. M. Bellare and P. Rogaway. The Exact Security of Digital Signatures - How to Sign with RSA and Rabin. In Eurocrypt '96, LNCS 1070, pages 399-416. Springer-Verlag, Berlin, 1996.
5. D. Bleichenbacher. Generating El Gamal Signatures without Knowing the Secret Key. In Eurocrypt '96, LNCS 1070, pages 10-18. Springer-Verlag, Berlin, 1996.
6. S. A. Brands. An Efficient Off-Line Electronic Cash SystemBased on the Representation Problem. Technical Report CS-R9323, CWI, Amsterdam, 1993.
7. E. F. Brickell. Invited lecture given at the Crypto '96 conference. unpublished manuscript.
8. R. Canetti, O. Goldreich, and S. Halevi. The RandomOracles Methodology, Revisited. In Proc. of the 30th STOC, pages 209-218. ACM Press, New York, 1998.
9. W. Diffie and M. E. Hellman. New Directions in Cryptography. IEEE Transactions on Information Theory, IT-22(6):644-654, November 1976.
10. T. El Gamal. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Transactions on Information Theory, IT-31(4):469-472, July 1985.
11. U. Feige, A. Fiat, and A. Shamir. Zero-Knowledge Proofs of Identity. Journal of Cryptology, 1:77-95, 1988.
12. A. Fiat and A. Shamir. How to Prove Yourself: Practical Solutions of Identification and Signature Problems. In Crypto '86, LNCS 263, pages 186-194. Springer-Verlag, Berlin, 1987.
13. M. Girault and J. Stern. On the Length of Cryptographic Hash-Values used in Identification Schemes. In Crypto '94, LNCS 839, pages 202-215. Springer-Verlag, Berlin, 1994.
14. S. Goldwasser, S. Micali, and R. Rivest. A “Paradoxical” Solution to the Signature Problem. In Proc. of the 25th FOCS, pages 441-448. IEEE, New York, 1984.
15. S. Goldwasser, S. Micali, and R. Rivest. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM Journal of Computing, 17(2):281-308, April 1988.
16. ISO. ISO/IEC 14888 Final Draft - Information Technology - Security Techniques -Digital Signatures with Appendix. International Organization for Standardization, Berlin, Germany, 1998.
17. KCDSA Task Force Team. The Korean Certificate-based Digital Signature Algorithm. IEEE P1363a Submission, August 1998. Available from http://grouper.ieee.org/groups/1363/addendum.html.
18. C. H. Limand P.J. Lee. A Study on the Proposed Korean Digital Signature Algorithm. In Asiacrypt 98, LNCS 1514, pages 175-186. Springer-Verlag, Berlin, 1998.
19. M. Naor and M. Yung. Universal One-way Hash Functions and their Cryptographic Applications. Proceedings of 21st STOC, May 1989.
20. NIST. Digital Signature Standard (DSS). Federal Information Processing Standards Publication 186, November 1994.
21. NIST. Secure Hash Standard (SHS). Federal Information Processing Standards Publication 180-1, April 1995.
22. K. Ohta and T. Okamoto. On Concrete Security Treatment of Signatures Derived fromIdentification. In Crypto '98, LNCS 1462, pages 354-369. Springer-Verlag, Berlin, 1998.
23. D. Pointcheval and J. Stern. Security Arguments for Digital Signatures and Blind Signatures. Journal ofCryptology, 1999. Available from http://www.di.ens.fr/~pointche.
24. D. Pointcheval and S. Vaudenay. On Provable Security for Digital Signature Algorithms. Technical Report LIENS-96-17, LIENS, October 1996.
25. R. Rivest. The MD5 Message-Digest Algorithm. RFC 1321, The Internet Engineering Task Force, April 1992.
26. R. Rivest, A. Shamir, and L. Adleman. A Method for Obtaining Digital Signatures and Public Key Cryptosystems. Communications of the ACM, 21(2):120-126, February 1978.
27. J. Rompel. One-way Functions are Necessary and Sufficient for Signature. Proceedings of 22d STOC, May 1990.
28. C. P. Schnorr. Efficient Identification and Signatures for Smart Cards. In Crypto '89, LNCS 435, pages 235-251. Springer-Verlag, Berlin, 1990.
29. C. P. Schnorr. Efficient Signature Generation by Smart Cards. Journal of Cryptology, 4(3):161-174, 1991.
30. P. C. van Oorschot and M. J. Wiener. On Diffie-Hellman Key Agreement with Short Exponents. In Eurocrypt '96, LNCS 1070, pages 332-343. Springer-Verlag, Berlin, 1996.
31. S. Vaudenay. Hidden Collisions on DSS. In Crypto 96, LNCS 1109, pages 83-88. Springer-Verlag, Berlin, 1996.