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