Open AccessPosted Content
History-Independent Cuckoo Hashing.
Moni Naor,Gil Segev,Udi Wieder +2 more
Reads0
Chats0
TLDR
In this paper, a history-independent dictionary based on cuckoo hashing is presented, which is an efficient and practical dynamic dictionary that provides expected amortized constant update time, worst case constant lookup time, and good memory utilization.Abstract:
Cuckoo hashing is an efficient and practical dynamic dictionary. It provides expected amortized constant update time, worst case constant lookup time, and good memory utilization. Various experiments demonstrated that cuckoo hashing is highly suitable for modern computer architectures and distributed settings, and offers significant improvements compared to other schemes.
In this work we construct a practical history-independentdynamic dictionary based on cuckoo hashing. In a history-independent data structure, the memory representation at any point in time yields no information on the specific sequence of insertions and deletions that led to its current content, other than the content itself. Such a property is significant when preventing unintended leakage of information, and was also found useful in several algorithmic settings.
Our construction enjoys most of the attractive properties of cuckoo hashing. In particular, no dynamic memory allocation is required, updates are performed in expected amortized constant time, and membership queries are performed in worst case constant time. Moreover, with high probability, the lookup procedure queries only two memory entries which are independent and can be queried in parallel. The approach underlying our construction is to enforce a canonical memory representation on cuckoo hashing. That is, up to the initial randomness, each set of elements has a unique memory representation.read more
Citations
More filters
Journal ArticleDOI
More Robust Hashing: Cuckoo Hashing with a Stash
TL;DR: It is demonstrated both analytically and through simulations that stashes of size equivalent to only three or four items yield tremendous improvements, enhancing cuckoo hashing's practical viability in both hardware and software.
Posted Content
Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
TL;DR: In this article, the oblivious RAM simulation problem with a small logarithmic or polylogarithm amortized increase in access times was studied, with a very high probability of success, while keeping the external storage to be of size O(n).
Posted Content
Invertible Bloom Lookup Tables
TL;DR: This work presents a version of the Bloom filter data structure that supports not only the insertion, deletion, and lookup of key-value pairs, but also allows a complete listing of the pairs it contains with high probability, as long the number of keys is below a designed threshold.
Book ChapterDOI
More Robust Hashing: Cuckoo Hashing with a Stash
TL;DR: This paper shows that there is a polynomially small but practically significant probability that a failure occurs during the insertion of an item, requiring an expensive rehashing of all items in the table, can be dramatically reduced by the addition of a very small constant-sized stash.
Book ChapterDOI
Some Open Questions Related to Cuckoo Hashing
TL;DR: The purpose of this brief note is to describe recent work in the area of cuckoo hashing, including a clear description of several open problems, with the hope of spurring further research.
References
More filters
Proceedings ArticleDOI
Random graphs
TL;DR: Some of the major results in random graphs and some of the more challenging open problems are reviewed, including those related to the WWW.
Journal ArticleDOI
Storing a Sparse Table with 0(1) Worst Case Access Time
TL;DR: A data structure for representing a set of n items from a universe of m items, which uses space n+o(n) and accommodates membership queries in constant time and is easy to implement.
Book ChapterDOI
Incremental Cryptography: The Case of Hashing and Signing
TL;DR: The idea is that having once applied the transformation to some document M, the time to update the result upon modification of M should be "proportional" to the "amount of modification" done to M.
Proceedings ArticleDOI
Two algorithms for maintaining order in a list
Paul F. Dietz,Daniel D. Sleator +1 more
TL;DR: The order maintenance problem is that of maintaining a list under a sequence of Insert and Delete operations, while answering Order queries (determine which of two elements comes first in the list).