Sciweavers

4 search results - page 1 / 1
» Collision-Resistant Hashing: Towards Making UOWHFs Practical
Sort
View
CRYPTO
1997
Springer
128views Cryptology» more  CRYPTO 1997»
13 years 9 months ago
Collision-Resistant Hashing: Towards Making UOWHFs Practical
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...
Mihir Bellare, Phillip Rogaway
ASIACRYPT
2007
Springer
13 years 11 months ago
How to Build a Hash Function from Any Collision-Resistant Function
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 ...
Thomas Ristenpart, Thomas Shrimpton
ASIACRYPT
2009
Springer
13 years 12 months ago
A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical
The design of cryptographic hash functions is a very complex and failure-prone process. For this reason, this paper puts forward a completely modular and fault-tolerant approach to...
Anja Lehmann, Stefano Tessaro
EUROCRYPT
2008
Springer
13 years 7 months ago
Security/Efficiency Tradeoffs for Permutation-Based Hashing
We provide attacks and analysis that capture a tradeoff, in the ideal-permutation model, between the speed of a permutation-based hash function and its potential security. For coll...
Phillip Rogaway, John P. Steinberger