Bloom Filters in Adversarial Environments
- 1 August 2015
- book chapter
- Published by Springer Nature
- p. 565-584
Abstract
No abstract availableKeywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a StashAlgorithmica, 2013
- How robust are linear sketches to adaptive inputs?2013
- Hardness Preserving Reductions via Cuckoo Hashing2013
- Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation2010
- Approximately detecting duplicates for streaming data using stable bloom filters2006
- Calibrating Noise to Sensitivity in Private Data Analysis2006
- Deep packet inspection using parallel bloom filtersIEEE Micro, 2004
- Summary cache: a scalable wide-area Web cache sharing protocolIEEE/ACM Transactions on Networking, 2000
- Cryptographic Primitives Based on Hard Learning Problems1994
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970