Bloom Filters in Adversarial Environments

@article{Naor2015BloomFI,
  title={Bloom Filters in Adversarial Environments},
  author={Moni Naor and Eylon Yogev},
  journal={IACR Cryptology ePrint Archive},
  year={2015},
  volume={2015},
  pages={543}
}
A Bloom filter represents a set S of elements approximately, by using fewer bits than a precise representation. The price for succinctness is allowing some errors: for any x ∈ S it should always answer ‘Yes’, and for any x / ∈ S it should answer ‘Yes’ only with small probability. The latter are called false positive errors. In this work we study the possibility of Bloom filters in a stronger setting than the usual one, where an adversary can adaptively choose a sequence of queries according to… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 5 times over the past 90 days. VIEW TWEETS
7 Citations
39 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 39 references

Sometimes - recurse shufflealmostrandom permutations in logarithmic expected time , Advances in CryptologyEUROCRYPT

  • Ben Morris, Phillip Rogaway
  • Proceedings , Lecture Notes in Computer Science
  • 2014

Woodruff , How robust are linear sketches to adaptive inputs ?

  • Moritz Hardt, P. David
  • STOC , ACM
  • 2013

Similar Papers

Loading similar papers…