On Randomizing Hash Functions to Strengthen the Security of Digital Signatures
From MaRDI portal
Publication:3627429
DOI10.1007/978-3-642-01001-9_5zbMath1239.94072MaRDI QIDQ3627429
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
94A62: Authentication, digital signatures and secret sharing
Related Items
Building indifferentiable compression functions from the PGV compression functions, Improved indifferentiability security bound for the JH mode
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate
- Keying Hash Functions for Message Authentication
- How to Fill Up Merkle-Damgård Hash Functions
- Hash-and-Sign with Weak Hashing Made Secure
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Tiger: A fast new hash function
- How to Break MD5 and Other Hash Functions
- 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
- Finding Collisions in the Full SHA-1
- A Failure-Friendly Design Principle for Hash Functions
- Information Security and Privacy
- Strengthening Digital Signatures Via Randomized Hashing
- Public Key Cryptography - PKC 2006
