14 search results - page 1 / 3 » A Composition Theorem for Universal One-Way Hash Functions |
109
Voted
EUROCRYPT
2000
Springer
15 years 4 months ago
2000
Springer
In this paper we present a new scheme for constructing universal one-way hash functions that hash arbitrarily long messages out of universal one-way hash functions that hash fixed...
115
Voted
ASIACRYPT
2004
Springer
15 years 6 months ago
2004
Springer
Universal One-Way Hash Functions (UOWHFs) are families of cryptographic hash functions for which first a target input is chosen and subsequently a key which selects a member from ...
152
Voted
EUROCRYPT
2010
Springer
15 years 5 months ago
2010
Springer
This paper revisits the construction of Universal One-Way Hash Functions (UOWHFs) from any one-way function due to Rompel (STOC 1990). We give a simpler construction of UOWHFs, whi...
106
Voted
FOCS
1999
IEEE
15 years 5 months ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
99
Voted
SOFSEM
2009
Springer
15 years 10 months ago
2009
Springer
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...