Practical performance of Bloom filters and parallel free-text searching
Communications of the ACM
OPUS: preventing weak password choices
Computers and Security
Differential files: their application to the maintenance of large databases
ACM Transactions on Database Systems (TODS)
Summary cache: a scalable wide-area web cache sharing protocol
IEEE/ACM Transactions on Networking (TON)
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
An architecture for secure wide-area service discovery
Wireless Networks - Selected Papers from Mobicom'99
Bloom filtering cache misses for accurate data speculation and prefetching
ICS '02 Proceedings of the 16th international conference on Supercomputing
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice
ACM Transactions on Computer Systems (TOCS)
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Space-code bloom filter for efficient traffic flow measurement
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
The Bloomier filter: an efficient data structure for static support lookup tables
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximately detecting duplicates for streaming data using stable bloom filters
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Incremental service deployment using the hop-by-hop multicast routing protocol
IEEE/ACM Transactions on Networking (TON)
Beyond bloom filters: from approximate membership checks to approximate state machines
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Information Processing Letters
Building high accuracy bloom filters using partitioned hashing
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Towards Stateless Single-Packet IP Traceback
LCN '07 Proceedings of the 32nd IEEE Conference on Local Computer Networks
Detector SherLOCK: Enhancing TRW with Bloom filters under memory and performance constraints
Computer Networks: The International Journal of Computer and Telecommunications Networking
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
Aging Bloom Filter with Two Active Buffers for Dynamic Sets
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Receiver-oriented design of Bloom filters for data-centric routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Maintaining time-decaying stream aggregates
Journal of Algorithms
False Negative Problem of Counting Bloom Filter
IEEE Transactions on Knowledge and Data Engineering
Time-decaying bloom filters for efficient middle-tier data management
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part III
Inferential time-decaying Bloom filters
Proceedings of the 16th International Conference on Extending Database Technology
| Hi-index | 0.00 |
Distributed applications use Bloom filters to transmit large sets in a compact form. However, attackers can easily disrupt these applications by using or advertising saturated filters. In this paper we introduce the Generalized Bloom Filter (GBF), a space-efficient data structure to securely represent a set in distributed applications, such as IP traceback, web caching, and peer-to-peer networks. Different from the standard Bloom filter, the GBF has an upper bound on the false-positive probability, limiting the effect of these attacks. The key idea of the GBF is to not only set, but also reset bits of the filter at each insertion. This procedure limits the false positives at the expense of introducing false negatives in membership queries. We derive expressions for the false-positive and false-negative rates and show that they are both upper-bounded in the GBF. We conduct simulations that validate the derived expressions and explore the tradeoffs of this data structure.