38 search results - page 1 / 8 » How to Build a Hash Function from Any Collision-Resistant Fu... |
ASIACRYPT
2007
Springer
13 years 11 months ago
2007
Springer
Recent collision-finding attacks against hash functions such as MD5 and SHA-1 motivate the use of provably collision-resistant (CR) functions in their place. Finding a collision ...
SECRYPT
2007
13 years 6 months ago
2007
Lately, hash function security has received increased attention. Especially after the recent attacks that were presented for SHA-1 and MD5, the need for a new and more robust hash...
EUROCRYPT
2007
Springer
13 years 11 months ago
2007
Springer
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 ...
CRYPTO
2008
Springer
13 years 7 months ago
2008
Springer
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...
CRYPTO
1997
Springer
13 years 9 months ago
1997
Springer
ded abstract of this paper appears in Advances in Cryptology { Crypto 97 Proceedings, Lecture Notes in Computer Science Vol. 1294, B. Kaliski ed., Springer-Verlag, 1997. This is th...