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
الصفحات565-584
عدد الصفحات20
المعرِّفات الرقمية للأشياء
حالة النشرنُشِر - 2015
منشور خارجيًانعم
الحدث35th Annual Cryptology Conference, CRYPTO 2015 - Santa Barbara, الولايات المتّحدة
المدة: ١٦ أغسطس ٢٠١٥٢٠ أغسطس ٢٠١٥

سلسلة المنشورات

الاسمLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
مستوى الصوت9216

!!Conference

!!Conference35th Annual Cryptology Conference, CRYPTO 2015
الدولة/الإقليمالولايات المتّحدة
المدينةSanta Barbara
المدة١٦/٠٨/١٥٢٠/٠٨/١٥

All Science Journal Classification (ASJC) codes

  • !!Theoretical Computer Science
  • !!General Computer Science

بصمة

أدرس بدقة موضوعات البحث “Bloom filters in adversarial environments'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا