Cuckoo hashing in cryptography: optimal parameters, robustness and applications

DOI10.1007/978-3-031-38551-3_7arXiv2306.11220MaRDI QIDQ6149606

Kevin Yeo

Publication date: 6 February 2024

Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Explicit and efficient hash families suffice for cuckoo hashing with a stash
• Cuckoo hashing: Further analysis
• Efficient circuit-based PSI via cuckoo hashing
• Space efficient hash tables with worst case constant access time
• Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution
• OptORAMa: optimal oblivious RAM
• PSI from PaXoS: fast, malicious private set intersection
• Oblivious key-value stores and amplification for private set intersection
• SSE and SSD: page-efficient searchable symmetric encryption
• Property-preserving hash functions for Hamming distance from standard assumptions
• Balanced allocation and dictionaries with tightly packed constant size bins
• Hardness-preserving reductions via cuckoo hashing
• Generalized cuckoo hashing with a stash, revisited
• \textsf{Catalic}: delegated PSI cardinality with applications to contact tracing
• Balanced allocations (extended abstract)
• Balls into Bins Made Faster
• Batch Codes Through Dense Graphs Without Short Cycles
• Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
• Private information retrieval
• Sketching in Adversarial Environments
• Bloom Filters in Adversarial Environments
• History-Independent Cuckoo Hashing
• Multi-query Computationally-Private Information Retrieval with Constant Communication Rate
• Batch codes and their applications
• Oblivious RAM Revisited
• Tight Thresholds for Cuckoo Hashing via XORSAT
• Uniform Hashing in Constant Time and Optimal Space
• De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
• Cuckoo hashing
• A Framework for Adversarially Robust Streaming Algorithms
• Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
• The Power of Simple Tabulation Hashing
• On the Insertion Time of Cuckoo Hashing
• How robust are linear sketches to adaptive inputs?
• Automata, Languages and Programming
• More Robust Hashing: Cuckoo Hashing with a Stash
• An Analysis of Random-Walk Cuckoo Hashing
• Nearly optimal property preserving hashing
• Lower bounds for (batch) PIR with private preprocessing

This page was built for publication: Cuckoo hashing in cryptography: optimal parameters, robustness and applications