Bet-or-pass: adversarially robust Bloom filters

DOI10.1007/978-3-031-22365-5_27zbMath1528.68094OpenAlexW4312246687MaRDI QIDQ6169433

Noa Oved, Moni Naor

Publication date: 14 August 2023

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-22365-5_27

Mathematics Subject Classification ID

Cryptography (94A60) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• On the construction of pseudorandom permutations: Luby-Rackoff revisited
• On the bit security of cryptographic primitives
• Separating adaptive streaming from oblivious streaming using the bounded storage model
• Hardness-preserving reductions via cuckoo hashing
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Bloom Filters in Adversarial Environments
• Almost random graphs with simple hash functions
• Uniform Hashing in Constant Time and Optimal Space
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• Foundations of Cryptography
• Cuckoo hashing
• Adaptive Cuckoo Filters
• Exact and approximate membership testers
• Elements of Information Theory
• How robust are linear sketches to adaptive inputs?
• Space/time trade-offs in hash coding with allowable errors
• Encyclopedia of Algorithms
• Telescoping Filter: A Practical Adaptive Filter.

This page was built for publication: Bet-or-pass: adversarially robust Bloom filters