{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T22:24:02Z","timestamp":1772490242388,"version":"3.50.1"},"reference-count":49,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T00:00:00Z","timestamp":1764806400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The Bloom filter remains one of the most influential constructs in probabilistic computation, a structure that achieves a mathematically elegant balance between accuracy, space efficiency, and computational speed. Since the original formulation of Dr. Burton H. Bloom in 1970, its design principles have expanded into a family of approximate membership query (AMQ) structures that now underpin a wide spectrum of modern computational systems. This review synthesizes the theoretical, algorithmic, and applied dimensions of Bloom filters, tracing their evolution from classical bit-vector models to contemporary learned and cryptographically reinforced variants. It further underscores their relevance in artificial intelligence and blockchain environments, where they act as relevance filters. Core developments, which include counting, scalable, stable, and spectral filters, are outlined alongside information-theoretic bounds that formalize their optimality. The analysis extends to adversarial environments, where cryptographic hashing and privacy-oriented adaptations enhance resilience under active attack, and to data-intensive domains such as network systems, databases, cybersecurity, and bioinformatics. Through the integration of historical insight and contemporary advances in learning, security, and system design, the Bloom filter emerges not merely as a data structure but as a unified paradigm for computation under uncertainty. The results presented in this review support practical advances in network traffic control, cybersecurity analysis, distributed storage systems, and large-scale data platforms that depend on compact and fast probabilistic structures.<\/jats:p>","DOI":"10.3390\/a18120767","type":"journal-article","created":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T18:42:02Z","timestamp":1764960122000},"page":"767","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bloom Filters at Fifty: From Probabilistic Foundations to Modern Engineering and Applications"],"prefix":"10.3390","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9350-1530","authenticated-orcid":false,"given":"Paul A.","family":"Gagniuc","sequence":"first","affiliation":[{"name":"Faculty of Engineering in Foreign Languages, National University of Science and Technology Politehnica Bucharest, RO-060042 Bucharest, Romania"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2651-7975","authenticated-orcid":false,"given":"Ionel-Bujorel","family":"P\u0103v\u0103loiu","sequence":"additional","affiliation":[{"name":"Faculty of Engineering in Foreign Languages, National University of Science and Technology Politehnica Bucharest, RO-060042 Bucharest, Romania"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8824-5704","authenticated-orcid":false,"given":"Maria-Iuliana","family":"Dasc\u0103lu","sequence":"additional","affiliation":[{"name":"Faculty of Engineering in Foreign Languages, National University of Science and Technology Politehnica Bucharest, RO-060042 Bucharest, Romania"}]}],"member":"1968","published-online":{"date-parts":[[2025,12,4]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","article-title":"Space\/Time Trade-offs in Hash Coding with Allowable Errors","volume":"13","author":"Bloom","year":"1970","journal-title":"Commun. ACM"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","article-title":"Network Applications of Bloom Filters: A Survey","volume":"1","author":"Broder","year":"2004","journal-title":"Internet Math."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1109\/TNET.2002.803864","article-title":"Compressed Bloom Filters","volume":"10","author":"Mitzenmacher","year":"2002","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.ipl.2006.10.007","article-title":"Scalable Bloom Filters","volume":"101","author":"Almeida","year":"2007","journal-title":"Inf. Process. Lett."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Bonomi, F., Mitzenmacher, M., Panigrahy, R., Singh, S., and Varghese, G. (2006, January 11\u201313). An Improved Construction for Counting Bloom Filters. Proceedings of the European Symposium on Algorithms (ESA), Zurich, Switzerland.","DOI":"10.1007\/11841036_61"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M. (2018). A Model for Learned Bloom Filters and Related Structures. arXiv.","DOI":"10.1007\/978-1-4614-8265-9_751"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Gagniuc, P.A. (2024). Antivirus Engines: From Methods to Innovations, Design, and Applications, Elsevier Syngress.","DOI":"10.1016\/B978-0-443-32952-4.00018-8"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/rsa.20208","article-title":"Less Hashing, Same Performance: Building a Better Bloom Filter","volume":"33","author":"Kirsch","year":"2008","journal-title":"Random Struct. Algorithms"},{"key":"ref_9","unstructured":"Pagh, A., Pagh, R., and Rao, S.S. (2005, January 23). An Optimal Bloom Filter Replacement. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), Vancouver, British Columbia."},{"key":"ref_10","first-page":"569","article-title":"Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic without Primes","volume":"Volume 1046","author":"Dietzfelbinger","year":"1996","journal-title":"Proceedings of the Annual Symposium on Theoretical Aspects of Computer Science"},{"key":"ref_11","unstructured":"Mitzenmacher, M., and Vadhan, S. (2008, January 20\u201322). Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream. Proceedings of the ACM\u2013SIAM Symposium on Discrete Algorithms (SODA), San Fracisco, CA, USA."},{"key":"ref_12","unstructured":"Thorup, M. (2015). High Speed Hashing for Integers and Strings. arXiv."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1498698.1594230","article-title":"Cache-, Hash-, and Space-Efficient Bloom Filters","volume":"14","author":"Putze","year":"2009","journal-title":"J. Exp. Algorithmics"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Cohen, S., and Matias, Y. (2003, January 10\u201312). Spectral Bloom Filters. Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD), San Diego, CA, USA.","DOI":"10.1145\/872785.872787"},{"key":"ref_15","unstructured":"Luo, G. (2009, January 11\u201314). Dynamic Bloom Filters. Proceedings of the IEEE International Conference on Computer and Information Technology (CIT), Xiamen, China."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1109\/90.851975","article-title":"Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol","volume":"8","author":"Fan","year":"2000","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_17","unstructured":"Lee, K.S., Byun, H., and Kim, S.W. (2012, January 10\u201315). Partitioned Bloom Filters. Proceedings of the IEEE International Conference Communications (ICC), Ottawa, ON, Canada."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Donnet, B., Baynat, B., and Friedman, T. (2006, January 4\u20137). Retouched Bloom Filters: Allowing Networked Applications to Trade Off False Positives Against False Negatives. Proceedings of the ACM CoNEXT Conference, Lisboa, Portugal.","DOI":"10.1145\/1368436.1368454"},{"key":"ref_19","unstructured":"Chazelle, B., Kilian, J., Rubinfeld, R., and Tal, A. (2004, January 11\u201314). The Bloomier Filter: An Efficient Data Structure for Static Support Lookup Tables. Proceedings of the ACM\u2013SIAM Symposium on Discrete Algorithms (SODA), New Orleans, LA, USA."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Fan, B., Andersen, D.G., Kaminsky, M., and Mitzenmacher, M. (2014, January 2\u20135). Cuckoo Filter: Practically Better Than Bloom. Proceedings of the ACM International Conference on Emerging Networking Experiments and Technologies (CoNEXT), Sydney, Australia.","DOI":"10.1145\/2674005.2674994"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-Colton, M., Johnson, R., Kraner, R., Kuszmaul, B.C., Medjedovic, D., Montes, P., Shetty, P., Spillane, R.P., and Zadok, E. (2012, January 13\u201314). Don\u2019t Thrash: How to Cache Your Hash on Flash. Proceedings of the USENIX Workshop on Hot Topics in Storage and File Systems (HotStorage), Boston, MA, USA.","DOI":"10.14778\/2350229.2350275"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3376122","article-title":"XOR Filters: Faster and Smaller Than Bloom and Cuckoo Filters","volume":"25","author":"Graf","year":"2020","journal-title":"J. Exp. Algorithmics"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.14778\/3213880.3213884","article-title":"Breslow and Nuwan S. Jayasena. Morton Filters: Faster, Space-Efficient Cuckoo Filters via Biasing, Compression, and Decoupled Logical Sparsity","volume":"11","author":"Alex","year":"2018","journal-title":"Proc. VLDB Endow."},{"key":"ref_24","unstructured":"Li, M., Zheng, J., and Wang, K. (2023, January 3\u20137). Vacuum Filters: More Space-Efficient and Faster Replacement for Bloom and Cuckoo Filters. Proceedings of the IEEE International Conference Data Engineering (ICDE), Anaheim, CA, USA."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Kraska, T., Alizadeh, M., Beutel, A., Chi, E.H., Dean, A., and Polyzotis, N. (2018, January 10\u201315). The Case for Learned Index Structures. Proceedings of the ACM SIGMOD International Conference Management of Data (SIGMOD), Houston, TX, USA.","DOI":"10.1145\/3183713.3196909"},{"key":"ref_26","unstructured":"Sato, S., Yamamoto, T., and Onizuka, M. (2023, January 18\u201323). Partitioned and Fast Learned Bloom Filters. Proceedings of the ACM SIGMOD International Conference Management of Data (SIGMOD), Seattle, WA, USA."},{"key":"ref_27","unstructured":"Naor, M., and Yogev, E. (2015, January 23\u201325). Bloom Filters in Adversarial Environments. Proceedings of the International Conference Theory of Cryptography (TCC), Warsaw, Poland."},{"key":"ref_28","unstructured":"Pinkas, B., Schneider, T., and Zohner, M. (2014, January 20\u201322). Faster Private Set Intersection Based on OT Extension. Proceedings of the USENIX Security Symposium, San Diego, CA, USA."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Dong, C., Chen, L., and Wen, Z. (2013, January 4\u20138). When Private Set Intersection Meets Big Data: An Efficient and Scalable Protocol. Proceedings of the ACM Conference Computer and Communications Security (CCS), Berlin, Germany.","DOI":"10.1145\/2508859.2516701"},{"key":"ref_30","unstructured":"Faber, S., Jarecki, S., Krawczyk, H., Nguyen, Q., Rosulek, M., and Steiner, M. (2015, January 12\u201316). Privacy-Preserving Data Sharing and Bloom Filters. Proceedings of the ACM Conference Computer and Communications Security (CCS), Denver, CO, USA."},{"key":"ref_31","first-page":"59","article-title":"Cryptanalysis of Basic Bloom Filters Used for Priva-cy-Preserving Record Linkage","volume":"6","author":"Niedermeyer","year":"2014","journal-title":"J. Priv. Confidentiality"},{"key":"ref_32","unstructured":"Zawoad, S., and Hasan, R. (2013, January 2\u20135). Providing Proofs of Past Data Possession in Cloud Forensics. Proceedings of the 2013 IEEE 5th International Conference on Cloud Computing Technology and Science (CloudCom 2013), Bristol, UK."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"104619","DOI":"10.1016\/j.micpro.2022.104619","article-title":"Hardware-oriented optimization of Bloom filter algorithms and architectures for ultra-high-speed lookups in network applications","volume":"94","author":"Sateesan","year":"2022","journal-title":"Microprocess. Microsyst."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.jnca.2017.03.006","article-title":"Frequent traffic flow identification through probabilistic Bloom filter and its GPU-based acceleration","volume":"87","author":"Xiong","year":"2017","journal-title":"J. Netw. Comput. Appl."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"166","DOI":"10.47738\/jcrb.v1i3.20","article-title":"Blockchain and the Evolution of Decentralized Finance: Navigating Growth and Vulnerabilities","volume":"1","author":"Durachman","year":"2024","journal-title":"J. Curr. Res. Blockchain"},{"key":"ref_36","first-page":"216","article-title":"Examining the Association Between Social Media Use and Self-Reported Social Energy Depletion: A Machine Learning Approach","volume":"1","author":"Kumar","year":"2025","journal-title":"J. Digit. Soc."},{"key":"ref_37","first-page":"264","article-title":"Quantifying the Financial Impact of Cyber Incidents: A Machine Learning Approach to Inform Legal Standards and Risk Management","volume":"1","author":"Alamsyah","year":"2025","journal-title":"J. Cyber Law"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.47738\/ijaim.v3i1.51","article-title":"Using Information Technology to Quantitatively Evaluate and Prevent Cybersecurity Threats in a Hierarchical Manner","volume":"3","author":"Mai","year":"2023","journal-title":"Int. J. Appl. Inf. Manag."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"2127","DOI":"10.47738\/jads.v6i3.717","article-title":"Firefly Algorithm-Optimized Deep Learning Model for Cyber Intrusion Detection in Wireless Sensor Networks Using SMOTE-Tomek","volume":"6","author":"Hamad","year":"2025","journal-title":"J. Appl. Data Sci."},{"key":"ref_40","first-page":"174","article-title":"Predicting User Engagement in E-Learning Platforms Using Decision Tree Classification: Analysis of Early Activity and Device Interaction Patterns","volume":"1","author":"Lenus","year":"2025","journal-title":"Artif. Intell. Learn."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"114","DOI":"10.47738\/jdmdc.v2i2.30","article-title":"Examination of User Satisfaction and Continuous Usage Intention in Digital Financial Advisory Platforms: An Integrated-Model Perspective","volume":"2","author":"Sanyour","year":"2025","journal-title":"J. Digit. Mark. Digit. Curr."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/s12525-023-00637-4","article-title":"A multivocal literature review of decentralized finance: Current knowledge and future research avenues","volume":"33","author":"Gramlich","year":"2023","journal-title":"Electron. Mark."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"59","DOI":"10.47738\/ijrm.v1i1.5","article-title":"Navigating Financial Transactions in the Metaverse: Risk Analysis, Anomaly Detection, and Regulatory Implications","volume":"1","author":"Srinivasan","year":"2024","journal-title":"Int. J. Res. Metaverse"},{"key":"ref_44","doi-asserted-by":"crossref","unstructured":"Schnell, R., Bachteler, T., and Reiher, J. (2009). Privacy-preserving record linkage using Bloom filters. BMC Med. Inform. Decis. Mak., 9.","DOI":"10.1186\/1472-6947-9-41"},{"key":"ref_45","first-page":"516298","article-title":"Accurate Counting Bloom Filters for Large-Scale Data Processing","volume":"2013","author":"Li","year":"2013","journal-title":"Math. Probl. Eng."},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Liu, B., Zhang, X., Shi, R., Zhang, M., and Zhang, G. (2022). SEPSI: A Secure and Efficient Privacy-Preserving Set Intersection with Identity Authentication in IoT. Mathematics, 10.","DOI":"10.3390\/math10122120"},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1016\/j.is.2012.11.005","article-title":"A Taxonomy of Privacy-Preserving Record Linkage Techniques","volume":"38","author":"Vatsalan","year":"2013","journal-title":"Inf. Syst."},{"key":"ref_48","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Schneider, T., Tkachenko, O., and Yanai, A. (2019, January 19\u201323). Efficient Circuit-Based PSI with Linear Communication. Proceedings of the Advances in Cryptology\u2014EUROCRYPT, Darmstadt, Germany.","DOI":"10.1007\/978-3-030-17659-4_5"},{"key":"ref_49","first-page":"131","article-title":"Applied Cryptography and Practical Scenarios for Cyber Security Defense","volume":"75","author":"Simion","year":"2013","journal-title":"UPB Sci. Bull. Ser. C"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/12\/767\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T19:00:03Z","timestamp":1764961203000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/12\/767"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,4]]},"references-count":49,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["a18120767"],"URL":"https:\/\/doi.org\/10.3390\/a18120767","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,4]]}}}