19 search results - page 1 / 4 » On the Impossibility of Efficiently Combining Collision Resi... |
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...
TISSEC
2010
12 years 11 months ago
2010
We revisit the problem of constructing a protocol for performing authenticated encryption with associated data (AEAD). A technique is described which combines a collision resistant...
ASIACRYPT
1992
Springer
13 years 8 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...
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...
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 ...