How to Build a Hash Function from Any Collision-Resistant Function
From MaRDI portal
Publication:5387097
DOI10.1007/978-3-540-76900-2_9zbMath1153.94425MaRDI QIDQ5387097
Thomas Ristenpart, Thomas Shrimpton
Publication date: 15 May 2008
Published in: Advances in Cryptology – ASIACRYPT 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-76900-2_9
94A60: Cryptography
Related Items
How to Build a Hash Function from Any Collision-Resistant Function, Preimage resistance of \(\mathsf{LP}mkr\) with \(r=m-1\), MJH: A Faster Alternative to MDC-2, Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers, Salvaging Merkle-Damgård for Practical Applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic encryption
- The random oracle methodology, revisited
- How to Enrich the Message Space of a Cipher
- SWIFFT: A Modest Proposal for FFT Hashing
- VSH, an Efficient and Provable Collision-Resistant Hash Function
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Universally Composable Security with Global Setup
- A method for obtaining digital signatures and public-key cryptosystems
- Advances in Cryptology - EUROCRYPT 2004
- How to Break MD5 and Other Hash Functions
- Secure Remote Authentication Using Biometric Data
- How to Build a Hash Function from Any Collision-Resistant Function
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms
- Feistel Networks Made Public, and Applications
- Finding Collisions in the Full SHA-1
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Security of VSH in the Real World
- Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding
- Multi-Property-Preserving Hash Domain Extension and the EMD Transform
- Progress in Cryptology - INDOCRYPT 2004
- Fast Software Encryption
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2004
- Theory of Cryptography
- One Way Hash Functions and DES
