Compressed bloom filters

DOI10.1145/383962.384004zbMath1333.68281OpenAlexW2088518924MaRDI QIDQ2787676

Michael Mitzenmacher

Publication date: 4 March 2016

Published in: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/383962.384004

Mathematics Subject Classification ID

Data structures (68P05) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (4)

Public-Key Puncturable Encryption: Modular and Compact Constructions ⋮ Less hashing, same performance: Building a better Bloom filter ⋮ On the false-positive rate of Bloom filters ⋮ A symmetric cryptographic scheme for data integrity verification in cloud databases

This page was built for publication: Compressed bloom filters