Abstract
Many efficient data structures use randomness, allowing them to improve upon deterministic ones. Usually, their efficiency and/or correctness are analyzed using probabilistic tools under the assumption that the inputs and queries are independent of the internal randomness of the data structure. In this work, we consider data structures in a more robust model, which we call the adversarial model. Roughly speaking, this model allows an adversary to choose inputs and queries adaptively according to previous responses. Specifically, we consider a data structure known as “Bloom filter” and prove a tight connection between Bloom filters in this model and cryptography. 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. In the adversarial model, we consider both efficient adversaries (that run in polynomial time) and computationally unbounded adversaries that are only bounded in the amount of queries they can make. For computationally bounded adversaries, we show that non-trivial (memory-wise) Bloom filters exist if and only if one-way functions exist. For unbounded adversaries we show that there exists a Bloom filter for sets of size n and error ε, that is secure against t queries and uses only O(n log 1/ε +t) bits of memory. In comparison, n log 1/ε is the best possible under a non-adaptive adversary.
Original language | English |
---|---|
Title of host publication | Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference, Proceedings |
Editors | Rosario Gennaro, Matthew Robshaw |
Publisher | Springer Verlag |
Pages | 565-584 |
Number of pages | 20 |
ISBN (Print) | 9783662479995 |
DOIs | |
State | Published - 2015 |
Externally published | Yes |
Event | 35th Annual Cryptology Conference, CRYPTO 2015 - Santa Barbara, United States Duration: 16 Aug 2015 → 20 Aug 2015 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 9216 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 35th Annual Cryptology Conference, CRYPTO 2015 |
---|---|
Country/Territory | United States |
City | Santa Barbara |
Period | 16/08/15 → 20/08/15 |
Bibliographical note
Publisher Copyright:© International Association for Cryptologic Research 2015.
Funding
E. Yogev—Supported in part by a grant from the I-CORE Program of the Planning and Budgeting Committee, the Israel Science Foundation, BSF and the Israeli Ministry of Science and Technology.
Funders | Funder number |
---|---|
Israeli Centers for Research Excellence | |
Israel Science Foundation | |
United States-Israel Binational Science Foundation | |
Ministry of science and technology, Israel |