Paper Info
Title
On the Weak Ideal Compression Functions
Abstract
In SAC 2006, Liskov introduced the weak ideal compression functions. He proved that a hash construction based on these functions is indifferentiable from the random oracle. In ICALP 2008, Hoch and Shamir applied Liskov's idea and proved the indifferentiability of another hash construction. However, these proofs of indifferentiability can have gaps in certain situations. In this paper, we formalize these situations and propose the simulation method which covers these situations. In particular, we apply our simulation method to the latter proof of indifferentiability, and concretely analyze the security of the latter hash construction. We can derive a lower bound to find a collision in the concatenated hash construction, which covers the gaps of the original proof.
Year
DOI
Venue
2009
10.1007/978-3-642-02620-1_16
ACISP
Keywords
Field
DocType
weak ideal compression functions,weak ideal compression function,original proof,random oracle,certain situation,latter hash construction,hash construction,latter proof,simulation method,concatenated hash construction,lower bound
Discrete mathematics,Double hashing,Computer science,Collision resistance,Cryptographic hash function,Random oracle,Theoretical computer science,Hash function,SWIFFT,Hash chain,Merkle–Damgård construction
Conference
Volume
ISSN
Citations 
5594
0302-9743
0
PageRank 
References 
Authors
0.34
12
2
Name
Order
Citations
PageRank
Akira Numayama1171.61
Keisuke Tanaka227819.04