Bloom filters in adversarial environments

פרסום מחקרי: פרק בספר / בדוח / בכנספרסום בספר כנסביקורת עמיתים


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.

שפה מקוריתאנגלית
כותר פרסום המארחAdvances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference, Proceedings
עורכיםRosario Gennaro, Matthew Robshaw
מספר עמודים20
מזהי עצם דיגיטלי (DOIs)
סטטוס פרסוםפורסם - 2015
פורסם באופן חיצוניכן
אירוע35th Annual Cryptology Conference, CRYPTO 2015 - Santa Barbara, ארצות הברית
משך הזמן: 16 אוג׳ 201520 אוג׳ 2015

סדרות פרסומים

שםLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)


כנס35th Annual Cryptology Conference, CRYPTO 2015
מדינה/אזורארצות הברית
עירSanta Barbara

ASJC Scopus subject areas

  • ???subjectarea.asjc.2600.2614???
  • ???subjectarea.asjc.1700.1700???

טביעת אצבע

להלן מוצגים תחומי המחקר של הפרסום 'Bloom filters in adversarial environments'. יחד הם יוצרים טביעת אצבע ייחודית.

פורמט ציטוט ביבליוגרפי