Open problems in hash function security
From MaRDI portal
Recommendations
- Cryptographic hash functions: theory and practice
- The NIST SHA-3 Competition: A Perspective on the Final Year
- Combining Compression Functions and Block Cipher-Based Hash Functions
- Getting the Best Out of Existing Hash Functions; or What if We Are Stuck with SHA?
- scientific article; zbMATH DE number 1304190
Cites work
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 4195165 (Why is no real title available?)
- scientific article; zbMATH DE number 3877077 (Why is no real title available?)
- scientific article; zbMATH DE number 177045 (Why is no real title available?)
- scientific article; zbMATH DE number 1303133 (Why is no real title available?)
- scientific article; zbMATH DE number 503258 (Why is no real title available?)
- scientific article; zbMATH DE number 503327 (Why is no real title available?)
- scientific article; zbMATH DE number 1024001 (Why is no real title available?)
- scientific article; zbMATH DE number 1024002 (Why is no real title available?)
- scientific article; zbMATH DE number 1024070 (Why is no real title available?)
- scientific article; zbMATH DE number 1088254 (Why is no real title available?)
- scientific article; zbMATH DE number 1088255 (Why is no real title available?)
- scientific article; zbMATH DE number 1942429 (Why is no real title available?)
- scientific article; zbMATH DE number 1951621 (Why is no real title available?)
- scientific article; zbMATH DE number 1775427 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- A New Mode of Operation for Block Ciphers and Length-Preserving MACs
- A Three-Property-Secure Hash Function
- A synthetic indifferentiability analysis of some block-cipher-based hash functions
- An analysis of the blockcipher-based hash functions from PGV
- Another glance at double-length hashing
- Attacking the Knudsen-Preneel Compression Functions
- Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
- Blockcipher-Based Hashing Revisited
- Blockcipher-based double-length hash functions for pseudorandom oracles
- Building a Collision-Resistant Compression Function from Non-compressing Primitives
- Building indifferentiable compression functions from the PGV compression functions
- Careful with composition: limitations of the indifferentiability framework
- Collision Resistance of the JH Hash Function
- Collision attacks against the Knudsen-Preneel compression functions
- Collisions Are Not Incidental: A Compression Function Exploiting Discrete Geometry
- Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
- Construction of secure and fast hash functions using nonbinary error-correcting codes
- Construction of universal one-way hash functions: tree hashing revisited
- Counter-\(b\)DM: a provably secure family of multi-block-length compression functions
- Cryptanalysis of MDC-2
- Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions
- Distinguisher and Related-Key Attack on the Full AES-256
- Duplexing the sponge: Single-pass authenticated encryption and other applications
- Efficient hashing using the AES instruction set
- Enhanced security notions for dedicated-key hash functions: definitions and relationships
- Fast Software Encryption
- Finding Collisions in the Full SHA-1
- Hash functions based on three permutations: a generic security analysis
- Herding Hash Functions and the Nostradamus Attack
- How to Break MD5 and Other Hash Functions
- How to Fill Up Merkle-Damgård Hash Functions
- Ideal-cipher (ir)reducibility for blockcipher-based hash functions
- Improved indifferentiability security bound for the JH mode
- Indifferentiability beyond the birthday bound for the xor of two public random permutations
- Indifferentiability of double length compression functions
- Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding
- MJH: a faster alternative to MDC-2
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Minimizing the two-round Even-Mansour cipher
- New directions in cryptography
- New parallel domain extenders for UOWHF
- On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
- On the Indifferentiability of the Sponge Construction
- On the XOR of multiple random permutations
- On the collision and preimage security of MDC-4 in the ideal cipher model
- On the security of iterated message authentication codes
- One Way Hash Functions and DES
- Optimal collision security in double block length hashing with single length key
- Provable security of the Knudsen-Preneel compression functions
- Provably Secure Double-Block-Length Hash Functions in a Black-Box Model
- RIPEMD-160: a strengthened version of RIPEMD
- Reset indifferentiability and its consequences
- Reset indifferentiability from weakened random oracle salvages one-pass hash functions
- Resource-restricted indifferentiability
- Sakura: a flexible coding for tree hashing
- Salvaging Merkle-Damgård for Practical Applications
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- Security Analysis and Comparison of the SHA-3 Finalists BLAKE, Grøstl, JH, Keccak, and Skein
- Security analysis of randomize-hash-then-sign digital signatures
- Security analysis of the mode of JH hash function
- Security of cyclic double block length hash functions
- Security reductions of the second round SHA-3 candidates
- Security/Efficiency Tradeoffs for Permutation-Based Hashing
- Seven-Property-Preserving Iterated Hashing: ROX
- Some Plausible Constructions of Double-Block-Length Hash Functions
- Stam's collision resistance conjecture
- Stam's conjecture and threshold phenomena in collision resistance
- Strengthening Digital Signatures Via Randomized Hashing
- The Collision Intractability of MDC-2 in the Ideal-Cipher Model
- The Grindahl Hash Functions
- The collision security of Tandem-DM in the ideal cipher model
- The preimage security of double-block-length compression functions
- The symbiosis between collision and preimage resistance
- Theory of Cryptography
Cited in
(8)- Cryptographic hash functions: theory and practice
- Interpreting hash function security proofs
- A Failure-Friendly Design Principle for Hash Functions
- Increasing the security of hash functions
- Combining Compression Functions and Block Cipher-Based Hash Functions
- A Critical Look at Cryptographic Hash Function Literature
- Getting the Best Out of Existing Hash Functions; or What if We Are Stuck with SHA?
- Chaotic hash function based on the dynamic S-box with variable parameters
This page was built for publication: Open problems in hash function security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q887443)
