Generalized cuckoo hashing with a stash, revisited

DOI10.1016/j.ipl.2022.106356OpenAlexW4313594220MaRDI QIDQ2681400

Brice Minaud, Charalampos Papamanthou

Publication date: 3 February 2023

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.01890

zbMATH Keywords

cryptographyanalysis of algorithmsrandomized algorithmscuckoo hashingballs and bins

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Cuckoo hashing in cryptography: optimal parameters, robustness and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Explicit and efficient hash families suffice for cuckoo hashing with a stash
• Space efficient hash tables with worst case constant access time
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution
• SSE and SSD: page-efficient searchable symmetric encryption
• Balanced allocation and dictionaries with tightly packed constant size bins
• Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
• On the degrees of the vertices of a directed graph
• Balanced allocations (extended abstract)
• Cuckoo hashing
• More Robust Hashing: Cuckoo Hashing with a Stash

This page was built for publication: Generalized cuckoo hashing with a stash, revisited