Paper 2025/125
Adversarially Robust Bloom Filters: Privacy, Reductions, and Open Problems
Abstract
A Bloom filter is a space-efficient probabilistic data structure that represents a set
Metadata
- Available format(s)
-
PDF
- Category
- Applications
- Publication info
- Preprint.
- Keywords
- Bloom filterspseudorandomnessdifferential privacy
- Contact author(s)
- hayder research @ gmail com
- History
- 2025-06-16: last of 3 revisions
- 2025-01-27: received
- See all versions
- Short URL
- https://ia.cr/2025/125
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/125, author = {Hayder Tirmazi}, title = {Adversarially Robust Bloom Filters: Privacy, Reductions, and Open Problems}, howpublished = {Cryptology {ePrint} Archive, Paper 2025/125}, year = {2025}, url = {https://eprint.iacr.org/2025/125} }