How to Use Merkle-Damgård — On the Security Relations between Signature Schemes and Their Inner Hash Functions

DOI10.1007/978-3-540-88733-1_17zbMath1204.94084OpenAlexW1559558295MaRDI QIDQ5505473

Pascal Paillier, Christophe Clavier, Emmanuel Bresson, Benoît Chevallier-Mames, Aline Gouget, Thomas Peyrin

Publication date: 27 January 2009

Published in: Provable Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88733-1_17

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient signature generation by smart cards
• The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
• Formalizing Human Ignorance
• New Message Difference for MD4
• Collisions on SHA-0 in One Hour
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Secure Hash-and-Sign Signatures Without the Random Oracle
• Cryptanalysis of the Hash Functions MD4 and RIPEMD
• How to Break MD5 and Other Hash Functions
• Collisions of SHA-0 and Reduced SHA-1
• Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
• Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities
• Efficient Collision Search Attacks on SHA-0
• Finding Collisions in the Full SHA-1
• A Failure-Friendly Design Principle for Hash Functions

This page was built for publication: How to Use Merkle-Damgård — On the Security Relations between Signature Schemes and Their Inner Hash Functions