Interpreting hash function security proofs

Authors:
Juraj Šarinay
Affiliations:
EPFL, IC LACAL, Lausanne, Switzerland
Venue:
ProvSec'10 Proceedings of the 4th international conference on Provable security
Year:
2010

Citing 32
Cited 0

Hash functions based on block ciphers: a synthetic approach

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
A Generalized Birthday Problem

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
A Design Principle for Hash Functions

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Hashing with SL_2

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Another Look at "Provable Security"

Journal of Cryptology
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions

Computational Complexity
Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities

EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
SWIFFT: A Modest Proposal for FFT Hashing

Fast Software Encryption
Full Cryptanalysis of LPS and Morgenstern Hash Functions

SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Syndrome Based Collision Resistant Hashing

PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
Cryptographic Hash Functions from Expander Graphs

Journal of Cryptology
Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent Security

CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Blockcipher-Based Hashing Revisited

Fast Software Encryption
Security Bounds for the Design of Code-Based Cryptosystems

ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Secure Parameters for SWIFFT

INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
On building hash functions from multivariate quadratic equations

ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Analysis of multivariate hash functions

ICISC'07 Proceedings of the 10th international conference on Information security and cryptology
Predicting lattice reduction

EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Collisions for the LPS expander graph hash function

EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Cryptanalysis of the Tillich–Zémor Hash Function

Journal of Cryptology
Formalizing human ignorance

VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
Discrete logarithm variants of VSH

VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
Security of VSH in the real world

INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Another look at “provable security”. II

INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Generalized compact knapsacks are collision resistant

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
A family of fast syndrome based cryptographic hash functions

Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
Finding collisions in the full SHA-1

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
How to break MD5 and other hash functions

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
VSH, an efficient and provable collision-resistant hash function

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices

TCC'06 Proceedings of the Third conference on Theory of Cryptography
Analysis of QUAD

FSE'07 Proceedings of the 14th international conference on Fast Software Encryption

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide a concrete security treatment of several "provably secure" hash functions. Interpreting arguments behind MQ-HASH, FSB, SWIFFTX and VSH we identify similar lines of reasoning. We aim to formulate the main security claims in a language closer to that of attacks. We evaluate designers' claims of provable security and quantify them more precisely, deriving "second order" bounds on bounds. While the authors of FSB, MQ-HASH and SWIFFT(X) prove existence of non-trivial lower bounds on security, we show that the quantification of the bounds limits the practical significance of the proofs.