Hidden collisions on DSS

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

Volumn 1109, Issue , 1996, Pages 83-88

  Vaudenay, Serge ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

HASH FUNCTIONS;

BIRTHDAY ATTACKS; DIGITAL SIGNATURE STANDARD; GENERATION ALGORITHM;

COMPUTATIONAL COMPLEXITY;

EID: 84955603054     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68697-5_7     Document Type: Conference Paper

References (7)

1. U. S. Department of Commerce, National Institute of Standards and 'Technology. Secure Hash Standard. Federal Information Processing Standard Publication 180-1, 1995.
2. U.S. Department of Commerce, National Institute of Standards and Technology. Digital Signature Standard. Federal Information Processing Standard Publication 186, 1994.
3. D. Bleichenbacher. Generating EIGamal signatures without knowing the secret key. In Advances in Cryptology EUROCRYPT'96, Zaragoza, Spain, Lectures Notes in Computer Science 1070, pp. 10-18, Springer-Verlag, 1996.
4. T. EIGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. In IEEE Transactions on Information Theory, vol. IT- 31, pp. 469-472, 1985.
5. D. Pointcheval, J. Stern. Security proofs for signature schemes. In Advances in Cryptology EUROCRYPT'96, Zaragoza, Spain, Lectures Notes in Computer Science 1070, pp. 387-398, Springer-Verlag, 1996.
6. C. P. Schnorr. Efficient identification and signature for smart cards. In Advances in Cryptology CRYPTO'89, Santa Barbara, California, U.S.A., Lectures Notes in Computer Science 435, pp. 239-252, Springer-Verlag, 1990.
7. C. P. Schnorr Efficient signature generation by smart cards. Journal of Cryptology, vol. 4, pp. 161-174, 1991.