Sciweavers

8 search results - page 1 / 2
» Security-Amplifying Combiners for Collision-Resistant Hash F...
Sort
View
CRYPTO
2006
Springer
88views Cryptology» more  CRYPTO 2006»
13 years 8 months ago
On the Impossibility of Efficiently Combining Collision Resistant Hash Functions
Let H1, H2 be two hash functions. We wish to construct a new hash function H that is collision resistant if at least one of H1 or H2 is collision resistant. Concatenating the outpu...
Dan Boneh, Xavier Boyen
CTRSA
2006
Springer
146views Cryptology» more  CTRSA 2006»
13 years 8 months ago
Collision-Resistant Usage of MD5 and SHA-1 Via Message Preprocessing
A series of recent papers have demonstrated collision attacks on popularly used hash functions, including the widely deployed MD5 and SHA-1 algorithm. To assess this threat, the na...
Michael Szydlo, Yiqun Lisa Yin
EUROCRYPT
2007
Springer
13 years 11 months ago
Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don't Exist
A (k, )-robust combiner for collision-resistant hash-functions is a construction which from hash-functions constructs a hash-function which is collision-resistant if at least k of ...
Krzysztof Pietrzak
CRYPTO
2008
Springer
92views Cryptology» more  CRYPTO 2008»
13 years 6 months ago
Compression from Collisions, or Why CRHF Combiners Have a Long Output
A black-box combiner for collision resistant hash functions (CRHF) is a construction which given black-box access to two hash functions is collision resistant if at least one of th...
Krzysztof Pietrzak