More Robust Hashing: Cuckoo Hashing with a Stash

DOI10.1007/978-3-540-87744-8_51MaRDI QIDQ5900468zbMATH OpenOpenAlexFDO

Authors Adam Kirsch, Michael Mitzenmacher, Udi Wieder

Publication date 25 November 2008

Published in Algorithms - ESA 2008 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-87744-8_51

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• More robust hashing: cuckoo hashing with a stash
• A further analysis of cuckoo hashing with a stash and random graphs of excess r
• Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes

Cited in

(10)

• Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
• Oblivious network RAM and leveraging parallelism to achieve obliviousness
• Generalized cuckoo hashing with a stash, revisited
• Efficient set intersection with simulation-based security
• Cuckoo hashing with pages
• Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
• A further analysis of cuckoo hashing with a stash and random graphs of excess r
• On the (in)security of hash-based oblivious RAM and a new balancing scheme
• More robust hashing: cuckoo hashing with a stash
• An improved version of cuckoo hashing: average case analysis of construction cost and search operations

This page was built for publication: More Robust Hashing: Cuckoo Hashing with a Stash

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900468)