On Randomizing Hash Functions to Strengthen the Security of Digital Signatures

DOI10.1007/978-3-642-01001-9_5MaRDI QIDQ3627429zbMATH OpenOpenAlexFDO

Authors Praveen Gauravaram, Lars R. Knudsen

Publication date 12 May 2009

Published in Advances in Cryptology - EUROCRYPT 2009 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-01001-9_5

zbMATH Keywords

Davies-Meyerdigital signatureshash functionsRMX

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Security analysis of randomize-hash-then-sign digital signatures
• Strengthening Digital Signatures Via Randomized Hashing
• Public Key Cryptography - PKC 2006
• Secure Hash-and-Sign Signatures Without the Random Oracle
• scientific article; zbMATH DE number 2079916

Cites work

• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• A Failure-Friendly Design Principle for Hash Functions
• Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities
• Finding Collisions in the Full SHA-1
• Hash-and-Sign with Weak Hashing Made Secure
• How to Break MD5 and Other Hash Functions
• How to Fill Up Merkle-Damgård Hash Functions
• scientific article; zbMATH DE number 4195165 (Why is no real title available?)
• scientific article; zbMATH DE number 177045 (Why is no real title available?)
• scientific article; zbMATH DE number 503258 (Why is no real title available?)
• scientific article; zbMATH DE number 1024070 (Why is no real title available?)
• scientific article; zbMATH DE number 1024071 (Why is no real title available?)
• scientific article; zbMATH DE number 1088254 (Why is no real title available?)
• Information Security and Privacy
• Keying hash functions for message authentication
• Public Key Cryptography - PKC 2006
• Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
• Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate
• Short signatures without random oracles and the SDH assumption in bilinear groups
• Strengthening Digital Signatures Via Randomized Hashing
• Tiger: a fast new hash function

Cited in

(7)

• Security analysis of randomize-hash-then-sign digital signatures
• Improved indifferentiability security bound for the JH mode
• scientific article; zbMATH DE number 2079916 (Why is no real title available?)
• Increasing the security of hash functions
• How to Use Merkle-Damgård — On the Security Relations between Signature Schemes and Their Inner Hash Functions
• Strengthening Digital Signatures Via Randomized Hashing
• Building indifferentiable compression functions from the PGV compression functions

Describes a project that uses

Uses Software

• Tiger

This page was built for publication: On Randomizing Hash Functions to Strengthen the Security of Digital Signatures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3627429)