Cuckoo hashing
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1875412
- Space efficient hash tables with worst case constant access time
- De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
- scientific article; zbMATH DE number 1962820
- A dictionary implementation based on dynamic perfect hashing
Cited in
(99)- Validating the Knuth-Morris-Pratt failure function, fast and online
- Balanced allocation through random walk
- Space efficient hash tables with worst case constant access time
- Dynamic space efficient hashing
- Robust property-preserving hash functions for Hamming distance and more
- Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution
- Two-sided malicious security for private intersection-sum with cardinality
- Private set intersection in the internet setting from lightweight oblivious PRF
- PSI from PaXoS: fast, malicious private set intersection
- SSE and SSD: page-efficient searchable symmetric encryption
- Thresholds for extreme orientability
- Oblivious network RAM and leveraging parallelism to achieve obliviousness
- Balanced allocation and dictionaries with tightly packed constant size bins
- CuCoTrack: cuckoo filter based connection tracking
- Hardness-preserving reductions via cuckoo hashing
- An efficient state recovery attack on the X-FCSR family of stream ciphers
- Hardness of peeling with stashes
- c-trie++: a dynamic trie tailored for fast prefix searches
- Generalized cuckoo hashing with a stash, revisited
- Adaptively code-correlation robustness functions and its applications to private set intersection
- Oblivious RAM with worst-case logarithmic overhead
- Approximate nearest neighbor for curves: simple, efficient, and deterministic
- Efficient set intersection with simulation-based security
- Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization
- Garbage Collection for Reversible Functional Languages
- The property suffix tree with dynamic properties
- Privacy-preserving access of outsourced data via oblivious RAM simulation
- Cuckoo hashing with pages
- Sharp load thresholds for cuckoo hashing
- Maximum matchings in random bipartite graphs and the space utilization of cuckoo hash tables
- Hyper-minimisation Made Efficient
- Succinct oblivious RAM
- Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process
- History-Independent Cuckoo Hashing
- Hopscotch Hashing
- Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
- De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
- The universality of iterated hashing over variable-length strings
- Nonoblivious hashing
- Low-contention data structures
- scientific article; zbMATH DE number 1962820 (Why is no real title available?)
- On risks of using cuckoo hashing with simple universal hash classes
- Fully dynamic maximal matching in O( n) update time (corrected version)
- Cache-oblivious hashing
- scientific article; zbMATH DE number 1875412 (Why is no real title available?)
- A generalized birthday approach for efficiently finding linear relations in \(\ell\)-sequences
- Power of \(d\) choices with simple tabulation
- Load Thresholds for Cuckoo Hashing with Overlapping Blocks
- Dense peelable random uniform hypergraphs
- Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
- Dynamic space efficient hashing
- Load thresholds for cuckoo hashing with double hashing
- Dynamic proofs of retrievability via oblivious RAM
- Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
- Fully dynamic maximal matching in O( n) update time
- A dictionary implementation based on dynamic perfect hashing
- Two-Way Chaining with Reassignment
- Privacy-preserving group data access via stateless oblivious RAM simulation
- Tight tradeoffs in searchable symmetric encryption
- Adaptive Cuckoo Filters
- 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
- Dynamic local searchable symmetric encryption
- Efficient private set intersection cardinality protocol in the reverse unbalanced setting
- Encapsulated search index: public-key, sub-linear, distributed, and delegatable
- Individual cryptography
- Cuckoo hashing in cryptography: optimal parameters, robustness and applications
- Universal Hashing via Integer Arithmetic Without Primes, Revisited
- Bet-or-pass: adversarially robust Bloom filters
- \textsf{MacORAMa}: optimal oblivious RAM with integrity
- An improved version of cuckoo hashing: average case analysis of construction cost and search operations
- Linear Complexity Private Set Intersection for Secure Two-Party Protocols
- Predicate private set intersection with linear complexity
- CAGE: cache-aware graphlet enumeration
- Count-min sketch with variable number of hash functions: an experimental study
- OptORAMa: Optimal oblivious RAM
- 3-party secure computation for RAMs: optimal and concretely efficient
- Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces
- Efficient pre-processing PIR without public-key cryptography
- Universal vector commitments
- Transactional memory
- Approximate nearest neighbor for curves -- simple, efficient, and deterministic
- Towards an analysis of quadratic probing
- Tiny pointers
- Peeling close to the orientability threshold. Spatial coupling in hashing-based data structures
- ShockHash: near optimal-space minimal perfect hashing beyond brute-force
- Layered hashing algorithm for real-time systems
- An efficient toolkit for computing third-party private set intersection
- Insertion time of random walk cuckoo hashing below the peeling threshold
- Static and streaming data structures for Fréchet distance queries
- Iceberg hashing: optimizing many hash-table criteria at once
- MorphisHash: improving space efficiency of ShockHash for minimal perfect hashing
- Tighter concrete security for the simplest OT
- Adversarially robust Bloom filters: monotonicity and betting
- Towards a scalable and robust DHT
- A new impossibility result for online bipartite matching problems
- HalftimeHash: modern hashing without 64-bit multipliers or finite fields
- Support optimality and adaptive cuckoo filters
This page was built for publication: Cuckoo hashing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736815)
