Interpreting Hash Function Security Proofs
From MaRDI portal
Publication:4933215
DOI10.1007/978-3-642-16280-0_8zbMath1286.94086OpenAlexW1603505516WikidataQ21740570 ScholiaQ21740570MaRDI QIDQ4933215
Publication date: 12 October 2010
Published in: Provable Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-16280-0_8
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Advances in cryptology - CRYPTO 2002. 22nd annual international cryptology conference, Santa Barbara, CA, USA, August 18--22, 2002. Proceedings
- Another look at ``provable security
- Cryptographic hash functions from expander graphs
- Cryptanalysis of the Tillich-Zémor hash function
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Advances in cryptology -- EUROCRYPT 2008. 27th annual international conference on the theory and applications of cryptographic techniques, Istanbul, Turkey, April 13--17, 2008. Proceedings
- Progress in cryptology -- INDOCRYPT 2006. 7th international conference on cryptology in India, Kolkata, India, December 11-13, 2006. Proceedings
- Formalizing Human Ignorance
- Discrete Logarithm Variants of VSH
- Blockcipher-Based Hashing Revisited
- Analysis of QUAD
- SWIFFT: A Modest Proposal for FFT Hashing
- Syndrome Based Collision Resistant Hashing
- Full Cryptanalysis of LPS and Morgenstern Hash Functions
- Generalized Compact Knapsacks Are Collision Resistant
- VSH, an Efficient and Provable Collision-Resistant Hash Function
- On Building Hash Functions from Multivariate Quadratic Equations
- Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent Security
- Security Bounds for the Design of Code-Based Cryptosystems
- Secure Parameters for SWIFFT
- FSBday
- Analysis of Multivariate Hash Functions
- How to Break MD5 and Other Hash Functions
- Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities
- Finding Collisions in the Full SHA-1
- Security of VSH in the Real World
- Another Look at “Provable Security”. II
- Predicting Lattice Reduction
- Collisions for the LPS Expander Graph Hash Function
- Progress in Cryptology – Mycrypt 2005
- Theory of Cryptography
This page was built for publication: Interpreting Hash Function Security Proofs
