Merkle-Damgård Revisited: How to Construct a Hash Function

DOI10.1007/11535218_26zbMATH Open1145.94436DBLPconf/crypto/CoronDMP05OpenAlexW1939171670WikidataQ27980773 ScholiaQ27980773MaRDI QIDQ5451041FDOQ5451041

Authors: Jean-Sébastien Coron, Yevgeniy Dodis, Cécile Malinaud, Prashant Puniya 

Publication date: 17 March 2008

Published in: Advances in Cryptology – CRYPTO 2005 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11535218_26

Recommendations

• scientific article; zbMATH DE number 1722677
• Constructing Secure Hash Functions by Enhancing Merkle-Damgård Construction
• How to Fill Up Merkle-Damgård Hash Functions
• How to construct sufficient conditions for hash functions
• A new multivariate hash algorithm based on an improved Merkle-Damgård construction
• A new non-Merkle-Damgård structural hash function with provable security
• A new practical algorithm for the construction of a perfect hash function
• How to Use Merkle-Damgård — On the Security Relations between Signature Schemes and Their Inner Hash Functions
• Collision-resistant and pseudorandom function based on Merkle-Damgård hash function
• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cited In (only showing first 100 items - show all)

• Optimal security for keyed hash functions: avoiding time-space tradeoffs for finding collisions
• Quark: a lightweight hash
• How to Fill Up Merkle-Damgård Hash Functions
• A Three-Property-Secure Hash Function
• Simple hash function using discrete-time quantum walks
• Salvaging Merkle-Damgård for Practical Applications
• Getting the Best Out of Existing Hash Functions; or What if We Are Stuck with SHA?
• On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak
• Title not available (Why is that?)
• Public-Seed Pseudorandom Permutations
• How to build an ideal cipher: the indifferentiability of the Feistel construction
• Towards Understanding the Known-Key Security of Block Ciphers
• Title not available (Why is that?)
• An efficient identity-based signature scheme with provable security
• Simpira v2: A Family of Efficient Permutations Using the AES Round Function
• Slide Attacks on a Class of Hash Functions
• Improved indifferentiability security bound for the JH mode
• The Hash Function Family LAKE
• Constructing Secure Hash Functions by Enhancing Merkle-Damgård Construction
• Modeling Random Oracles Under Unpredictable Queries
• Meet-in-the-Middle Attacks Using Output Truncation in 3-Pass HAVAL
• Hardening signature schemes via derive-then-derandomize: stronger security proofs for EdDSA
• Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier
• Building indifferentiable compression functions from the PGV compression functions
• Hash Functions from Sigma Protocols and Improvements to VSH
• A measure of dependence for cryptographic primitives relative to ideal functions
• Characterizing Padding Rules of MD Hash Functions Preserving Collision Security
• A Failure-Friendly Design Principle for Hash Functions
• A New Mode of Operation for Block Ciphers and Length-Preserving MACs
• Multi-property Preserving Combiners for Hash Functions
• An analysis of the blockcipher-based hash functions from PGV
• Indifferentiability of 8-Round Feistel Networks
• From Indifferentiability to Constructive Cryptography (and Back)
• Robust multi-property combiners for hash functions
• A simple variant of the Merkle-Damgård scheme with a permutation
• New second-preimage attacks on hash functions
• On the impossibility of highly-efficient blockcipher-based hash functions
• Multicollision attacks and generalized iterated hash functions
• Improved domain extender for the ideal cipher
• A short non-delegatable strong designated verifier signature
• On tight quantum security of HMAC and NMAC in the quantum random oracle model
• Increasing the flexibility of the herding attack
• Password hashing and preprocessing
• The hash function \texttt{BLAKE}
• A new multivariate hash algorithm based on an improved Merkle-Damgård construction
• A synthetic indifferentiability analysis of some block-cipher-based hash functions
• A characterization of chameleon hash functions and new, efficient designs
• Blockcipher-based double-length hash functions for pseudorandom oracles
• Open problems in hash function security
• A domain extender for the ideal cipher
• Uniform encodings to elliptic curves and indistinguishable point representation
• Boosting Merkle-Damgård Hashing for Message Authentication
• How to Build a Hash Function from Any Collision-Resistant Function
• A new black box analysis of hash functions based on block ciphers
• Provable chosen-target-forced-midfix preimage resistance
• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
• Herding Hash Functions and the Nostradamus Attack
• On the XOR of Multiple Random Permutations
• On the Security of Hash Functions Employing Blockcipher Postprocessing
• Constructing an Ideal Hash Function from Weak Ideal Compression Functions
• Handling adaptive compromise for practical encryption schemes
• Indifferentiability for public key cryptosystems
• Quantifying the security cost of migrating protocols to practice
• Separate your domains: NIST PQC KEMs, oracle cloning and read-only indifferentiability
• A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier
• A Scheme to Base a Hash Function on a Block Cipher
• Efficient schemes for committing authenticated encryption
• Optimal collision security in double block length hashing with single length key
• Generic security of the SAFE API and its applications
• The indifferentiability of the duplex and its practical applications
• Analysis of Property-Preservation Capabilities of the ROX and ESh Hash Domain Extenders
• On the Weak Ideal Compression Functions
• Extended Multi-Property-Preserving and ECM-Construction
• Random oracle combiners: breaking the concatenation barrier for collision-resistance
• Practical near-collisions on the compression function of BMW
• Parallel Hashing via List Recoverability
• Streebog as a random oracle
• On chosen target forced prefix preimage resistance
• Title not available (Why is that?)
• On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives
• Improved indifferentiability security proof for 3-round tweakable Luby-Rackoff
• Crooked indifferentiability of enveloped XOR revisited
• Building blocks of sharding blockchain systems: concepts, approaches, and open problems
• Block-cipher-based tree hashing
• Query-Complexity Amplification for Random Oracles
• The relationship between idealized models under computationally bounded adversaries
• How to Use Merkle-Damgård — On the Security Relations between Signature Schemes and Their Inner Hash Functions
• Augmented random oracles
• Sequential indifferentiability of confusion-diffusion networks
• Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules)
• Revisiting the indifferentiability of the sum of permutations
• Double-block-length hash function for minimum memory size
• Security analysis of SIMD
• On the indifferentiability of Fugue and Luffa
• Faster Multicollisions
• Redeeming reset indifferentiability and applications to post-quantum security
• Classical and quantum security of elliptic curve VRF, via relative indifferentiability
• A new authentication procedure for client-server applications using HMAC
• Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls
• Approximate lower bound arguments

This page was built for publication: Merkle-Damgård Revisited: How to Construct a Hash Function

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