5 search results - page 1 / 1 » Weaknesses of Cuckoo Hashing with a Simple Universal Hash Cl... |
SOFSEM
2009
Springer
14 years 1 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...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
EUROCRYPT
2010
Springer
13 years 9 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...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
STOC
2010
ACM
13 years 5 months ago
2010
ACM
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...