Cuckoo hashing
From MaRDI portal
Publication:4736815
DOI10.1016/j.jalgor.2003.12.002zbMath1091.68036OpenAlexW2912601938WikidataQ56021022 ScholiaQ56021022MaRDI QIDQ4736815
Flemming Friche Rodler, Rasmus Pagh
Publication date: 6 August 2004
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgor.2003.12.002
Searching and sorting (68P10) Data structures (68P05) Information storage and retrieval of data (68P20)
Related Items (72)
Efficient set intersection with simulation-based security ⋮ SSE and SSD: page-efficient searchable symmetric encryption ⋮ HalftimeHash: modern hashing without 64-bit multipliers or finite fields ⋮ Support optimality and adaptive cuckoo filters ⋮ Sharp load thresholds for cuckoo hashing ⋮ Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables ⋮ The property suffix tree with dynamic properties ⋮ Balanced allocation and dictionaries with tightly packed constant size bins ⋮ Hardness of peeling with stashes ⋮ Unnamed Item ⋮ Bloom Filters in Adversarial Environments ⋮ Hyper-minimisation Made Efficient ⋮ Online Stochastic Matching: Online Actions Based on Offline Statistics ⋮ Load Thresholds for Cuckoo Hashing with Overlapping Blocks ⋮ External-memory multimaps ⋮ Validating the Knuth-Morris-Pratt failure function, fast and online ⋮ Scalable Load Balancing in Networked Systems: A Survey of Recent Advances ⋮ CuCoTrack: cuckoo filter based connection tracking ⋮ c-trie++: a dynamic trie tailored for fast prefix searches ⋮ Balanced allocation through random walk ⋮ MPCCache: privacy-preserving multi-party cooperative cache sharing at the edge ⋮ Load Thresholds for Cuckoo Hashing with Overlapping Blocks ⋮ Phase transition in count approximation by count-min sketch with conservative updates ⋮ Generalized cuckoo hashing with a stash, revisited ⋮ Dynamic local searchable symmetric encryption ⋮ Efficient private set intersection cardinality protocol in the reverse unbalanced setting ⋮ Hardness-preserving reductions via cuckoo hashing ⋮ Encapsulated search index: public-key, sub-linear, distributed, and delegatable ⋮ Adaptively code-correlation robustness functions and its applications to private set intersection ⋮ The universality of iterated hashing over variable-length strings ⋮ An improved version of cuckoo hashing: average case analysis of construction cost and search operations ⋮ Individual cryptography ⋮ Cuckoo hashing in cryptography: optimal parameters, robustness and applications ⋮ Universal Hashing via Integer Arithmetic Without Primes, Revisited ⋮ Unnamed Item ⋮ Bet-or-pass: adversarially robust Bloom filters ⋮ \textsf{MacORAMa}: optimal oblivious RAM with integrity ⋮ Low-contention data structures ⋮ Oblivious RAM with worst-case logarithmic overhead ⋮ Approximate nearest neighbor for curves: simple, efficient, and deterministic ⋮ An efficient state recovery attack on the X-FCSR family of stream ciphers ⋮ Hopscotch Hashing ⋮ Cache-oblivious hashing ⋮ Explicit and efficient hash families suffice for cuckoo hashing with a stash ⋮ A generalized birthday approach for efficiently finding linear relations in \(\ell\)-sequences ⋮ Transactional memory ⋮ Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version) ⋮ Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation ⋮ Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations ⋮ Dynamic proofs of retrievability via oblivious RAM ⋮ Thresholds for extreme orientability ⋮ Dynamic space efficient hashing ⋮ Layered hashing algorithm for real-time systems ⋮ Pseudo-random graphs and bit probe schemes with one-sided error ⋮ Unnamed Item ⋮ Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes ⋮ Tight tradeoffs in searchable symmetric encryption ⋮ Towards a scalable and robust DHT ⋮ Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization ⋮ Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process ⋮ Robust property-preserving hash functions for Hamming distance and more ⋮ Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution ⋮ Garbage Collection for Reversible Functional Languages ⋮ Oblivious network RAM and leveraging parallelism to achieve obliviousness ⋮ Dynamic Space Efficient Hashing. ⋮ Load Thresholds for Cuckoo Hashing with Double Hashing ⋮ Fully Dynamic Maximal Matching in $O(\log n)$ Update Time ⋮ Unnamed Item ⋮ Two-sided malicious security for private intersection-sum with cardinality ⋮ Private set intersection in the internet setting from lightweight oblivious PRF ⋮ Adaptive Cuckoo Filters ⋮ PSI from PaXoS: fast, malicious private set intersection
This page was built for publication: Cuckoo hashing
