21 search results - page 1 / 5 » VSH, an Efficient and Provable Collision-Resistant Hash Func... |
EUROCRYPT
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant assuming the hardness of finding nontrivial modular square roots of ver...
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 ...
CRYPTO
2006
Springer
13 years 8 months ago
2006
Springer
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...
ASIACRYPT
1992
Springer
13 years 9 months ago
1992
Springer
Collision resistant hash functions are an important basic tool for cryptographic applications such as digital signature schemes and integrity protection based on "fingerprinti...
FSE
2009
Springer
14 years 5 months ago
2009
Springer
Enhanced Target Collision Resistance (eTCR) property for a hash function was put forth by Halevi and Krawczyk in Crypto 2006, in conjunction with the randomized hashing mode that i...