How to Build a Hash Function from Any Collision-Resistant Function

DOI10.1007/978-3-540-76900-2_9MaRDI QIDQ5387097zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Merkle-Damgård Revisited: How to Construct a Hash Function
• How to construct sufficient conditions for hash functions
• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
• Constructing a hash function from plaintext to Huff curves
• Collision-resistant and pseudorandom function based on Merkle-Damgård hash function
• How to Construct Universal One-Way Hash Functions of Order r
• Multi-collision resistant hash functions and their applications
• Collisionful keyed hash functions with selectable collisions
• scientific article; zbMATH DE number 1722677
• Collision Resistance of the JH Hash Function

Cites work

• scientific article; zbMATH DE number 4195165 (Why is no real title available?)
• scientific article; zbMATH DE number 1024070 (Why is no real title available?)
• scientific article; zbMATH DE number 1942429 (Why is no real title available?)
• scientific article; zbMATH DE number 1842501 (Why is no real title available?)
• scientific article; zbMATH DE number 1440053 (Why is no real title available?)
• A method for obtaining digital signatures and public-key cryptosystems
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - EUROCRYPT 2004
• Fast Software Encryption
• Feistel Networks Made Public, and Applications
• Finding Collisions in the Full SHA-1
• Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms
• How to Break MD5 and Other Hash Functions
• How to Build a Hash Function from Any Collision-Resistant Function
• How to Enrich the Message Space of a Cipher
• Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding
• Merkle-Damgård Revisited: How to Construct a Hash Function
• Multi-Property-Preserving Hash Domain Extension and the EMD Transform
• One Way Hash Functions and DES
• Probabilistic encryption
• Progress in Cryptology - INDOCRYPT 2004
• SWIFFT: A Modest Proposal for FFT Hashing
• Secure Remote Authentication Using Biometric Data
• Security of VSH in the Real World
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• The random oracle methodology, revisited.
• Theory of Cryptography
• Theory of Cryptography
• Topics in Cryptology – CT-RSA 2004
• Universally Composable Security with Global Setup
• VSH, an Efficient and Provable Collision-Resistant Hash Function

Cited in

(9)

• Salvaging Merkle-Damgård for Practical Applications
• Security of permutation-based compression function {\textsf{lp}}231
• Preimage resistance of \(\mathsf{LP}mkr\) with \(r=m-1\)
• Compactness of hashing modes and efficiency beyond Merkle tree
• MJH: a faster alternative to MDC-2
• How to Build a Hash Function from Any Collision-Resistant Function
• MJH: a faster alternative to MDC-2
• The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions
• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers

This page was built for publication: How to Build a Hash Function from Any Collision-Resistant Function

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