Open problems in hash function security
From MaRDI portal
Publication:887443
DOI10.1007/s10623-015-0096-0zbMath1356.94047OpenAlexW1203305141WikidataQ114852391 ScholiaQ114852391MaRDI QIDQ887443
Bart Mennink, Bart Preneel, Elena Andreeva
Publication date: 26 October 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/501602
reductionsopen problemscompression functionsblock cipher basedcryptographic hash functionpermutation based
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved indifferentiability security bound for the JH mode
- An analysis of the blockcipher-based hash functions from PGV
- A synthetic indifferentiability analysis of some block-cipher-based hash functions
- Security analysis of randomize-hash-then-sign digital signatures
- Construction of universal one-way hash functions: tree hashing revisited
- On the collision and preimage security of MDC-4 in the ideal cipher model
- On the XOR of Multiple Random Permutations
- Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions
- Reset Indifferentiability and Its Consequences
- Indifferentiability of Double Length Compression Functions
- Minimizing the Two-Round Even-Mansour Cipher
- Duplexing the Sponge: Single-Pass Authenticated Encryption and Other Applications
- Blockcipher-Based Double-Length Hash Functions for Pseudorandom Oracles
- Collisions Are Not Incidental: A Compression Function Exploiting Discrete Geometry
- Security Analysis and Comparison of the SHA-3 Finalists BLAKE, Grøstl, JH, Keccak, and Skein
- Hash Functions Based on Three Permutations: A Generic Security Analysis
- Stam’s Conjecture and Threshold Phenomena in Collision Resistance
- Careful with Composition: Limitations of the Indifferentiability Framework
- Collision Attacks against the Knudsen-Preneel Compression Functions
- Indifferentiability beyond the Birthday Bound for the Xor of Two Public Random Permutations
- MJH: A Faster Alternative to MDC-2
- Security Reductions of the Second Round SHA-3 Candidates
- The Preimage Security of Double-Block-Length Compression Functions
- The Symbiosis between Collision and Preimage Resistance
- Efficient Hashing Using the AES Instruction Set
- Distinguisher and Related-Key Attack on the Full AES-256
- Blockcipher-Based Hashing Revisited
- Building a Collision-Resistant Compression Function from Non-compressing Primitives
- The Grindahl Hash Functions
- Stam’s Collision Resistance Conjecture
- Attacking the Knudsen-Preneel Compression Functions
- Security Analysis of the Mode of JH Hash Function
- Enhanced Security Notions for Dedicated-Key Hash Functions: Definitions and Relationships
- Herding Hash Functions and the Nostradamus Attack
- Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
- Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
- How to Fill Up Merkle-Damgård Hash Functions
- Some Plausible Constructions of Double-Block-Length Hash Functions
- Cryptanalysis of MDC-2
- Salvaging Merkle-Damgård for Practical Applications
- A Three-Property-Secure Hash Function
- Security of Cyclic Double Block Length Hash Functions
- Another Glance at Double-Length Hashing
- New directions in cryptography
- RIPEMD-160: A strengthened version of RIPEMD
- Construction of secure and fast hash functions using nonbinary error-correcting codes
- On the security of iterated message authentication codes
- Provable Security of the Knudsen-Preneel Compression Functions
- Optimal Collision Security in Double Block Length Hashing with Single Length Key
- Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions
- Resource-Restricted Indifferentiability
- Counter-bDM: A Provably Secure Family of Multi-Block-Length Compression Functions
- Sakura: A Flexible Coding for Tree Hashing
- Reset Indifferentiability from Weakened Random Oracle Salvages One-Pass Hash Functions
- The Collision Security of Tandem-DM in the Ideal Cipher Model
- Collision Resistance of the JH Hash Function
- How to Break MD5 and Other Hash Functions
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
- Seven-Property-Preserving Iterated Hashing: ROX
- The Collision Intractability of MDC-2 in the Ideal-Cipher Model
- Provably Secure Double-Block-Length Hash Functions in a Black-Box Model
- Finding Collisions in the Full SHA-1
- Merkle-Damgård Revisited: How to Construct a Hash Function
- On the Indifferentiability of the Sponge Construction
- A New Mode of Operation for Block Ciphers and Length-Preserving MACs
- Security/Efficiency Tradeoffs for Permutation-Based Hashing
- Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding
- Fast Software Encryption
- Strengthening Digital Signatures Via Randomized Hashing
- Theory of Cryptography
- Advances in Cryptology - ASIACRYPT 2003
- Building indifferentiable compression functions from the PGV compression functions
- One Way Hash Functions and DES
This page was built for publication: Open problems in hash function security
