On the privacy of counting Bloom filters Articles uri icon

authors

  • REVIRIEGO VASALLO, PEDRO
  • SANCHEZ-MACIAN, ALFONSO
  • WALZER, STEFAN
  • Merino G√≥mez, Elena
  • LIU, SHANSHAN
  • LOMBARDI, FABRIZIO

publication date

  • March 2022

start page

  • 1488

end page

  • 1499

issue

  • 2

volume

  • 20

International Standard Serial Number (ISSN)

  • 1545-5971

Electronic International Standard Serial Number (EISSN)

  • 1941-0018

abstract

  • Bloom filters are widely used in networking and computing to accelerate membership checking. In many applications filters store sensitive data, so their privacy is of primary concern. At first glance, it seems that extracting the set of elements inserted from the filter would not be possible, because in Bloom filters elements are mapped to positions using hash functions. However, previous works have shown that for the Bloom filter, it may be possible to identify few of the elements inserted in the filter. In this work, we consider the case of counting Bloom filters (CBFs) and show that in some cases, the entire set of elements used to create the filter can be extracted from the filter. This poses serious privacy and security concerns when an attacker can get access to the filter contents. In this article, an algorithm to extract the elements inserted from the filter is presented and analyzed theoretically; then, the feasibility of the CBF inversion is shown by simulation. A case study is presented in detail to illustrate that in practical applications, these conditions can be met by using additional restrictions that are implicit in the nature of the application itself.

subjects

  • Telecommunications

keywords

  • security; privacy; bloom filters; approximate membership checking