Hardness-preserving reductions via cuckoo hashing
From MaRDI portal
Publication:2423841
DOI10.1007/s00145-018-9293-0zbMath1434.94058arXiv2105.01409OpenAlexW2800331319MaRDI QIDQ2423841
Ilan Komargodski, Iftach Haitner, Moni Naor, Itay Berman
Publication date: 20 June 2019
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.01409
Related Items
Cuckoo hashing in cryptography: optimal parameters, robustness and applications, Bet-or-pass: adversarially robust Bloom filters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Explicit and efficient hash families suffice for cuckoo hashing with a stash
- Checking the correctness of memories
- One way functions and pseudorandom generators
- New hash functions and their use in authentication and set equality
- Universal classes of hash functions
- On the construction of pseudorandom permutations: Luby-Rackoff revisited
- Synthesizers and their application to the parallel construction of pseudo-random functions
- Constructing pseudo-random permutations with a prescribed structure
- Space efficient hash tables with worst case constant access time
- From non-adaptive to adaptive pseudorandom functions
- Balanced allocation and dictionaries with tightly packed constant size bins
- Derandomized constructions of \(k\)-wise (almost) independent permutations
- The Mix-and-Cut Shuffle: Small-Domain Encryption Secure against N Queries
- Foiling Birthday Attacks in Length-Doubling Transformations
- Hardness Preserving Constructions of Pseudorandom Functions
- An Enciphering Scheme Based on a Card Shuffle
- Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- Domain Extension for MACs Beyond the Birthday Barrier
- How to Encipher Messages on a Small Domain
- The square lattice shuffle
- A Proof of Security in O(2 n ) for the Benes Scheme
- Lightweight Privacy Preserving Authentication for RFID Using a Stream Cipher
- A Unified Method for Improving PRF Bounds for a Class of Blockcipher Based MACs
- Almost random graphs with simple hash functions
- Composition Implies Adaptive Security in Minicrypt
- Domain Extension of Public Random Functions: Beyond the Birthday Barrier
- Uniform Hashing in Constant Time and Optimal Space
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- A Pseudorandom Generator from any One-way Function
- Tracing traitors
- On Universal Classes of Extremely Random Constant-Time Hash Functions
- Cuckoo hashing
- Hardness Preserving Reductions via Cuckoo Hashing
- Understanding Adaptivity: Random Systems Revisited
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- The Power of Simple Tabulation Hashing
- Sometimes-Recurse Shuffle
- Composition Does Not Imply Adaptive Security
- An Analysis of Random-Walk Cuckoo Hashing
- More Robust Hashing: Cuckoo Hashing with a Stash
- Theory of Cryptography
