{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:26:21Z","timestamp":1765106781025,"version":"3.46.0"},"publisher-location":"Singapore","reference-count":30,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819550951","type":"print"},{"value":"9789819550968","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-5096-8_6","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:24:36Z","timestamp":1765106676000},"page":"171-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Adversary Resilient Learned Bloom Filters"],"prefix":"10.1007","author":[{"given":"Ghada","family":"Almashaqbeh","sequence":"first","affiliation":[]},{"given":"Allison","family":"Bishop","sequence":"additional","affiliation":[]},{"given":"Hayder","family":"Tirmazi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"6_CR1","unstructured":"Anderson, H.S., Roth, P.: Ember: an open dataset for training static pe malware machine learning models. arXiv preprint arXiv:1804.04637 (2018)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Boskov, N., Trachtenberg, A., Starobinski, D.: Birdwatching: false negatives in cuckoo filters. In: Proceedings of the Student Workshop, pp. 13\u201314 (2020)","DOI":"10.1145\/3426746.3434063"},{"issue":"4","key":"6_CR3","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","volume":"1","author":"A Broder","year":"2004","unstructured":"Broder, A., Mitzenmacher, M.: Network applications of bloom filters: a survey. Internet Math. 1(4), 485\u2013509 (2004)","journal-title":"Internet Math."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Clayton, D., Patton, C., Shrimpton, T.: Probabilistic data structures in adversarial environments. In: ACM SIGSAC Conference on Computer and Communications Security (CCS) (2019)","DOI":"10.1145\/3319535.3354235"},{"key":"6_CR5","unstructured":"Dai, Z., Shrivastava, A.: Adaptive learned bloom filter (ada-bf): efficient utilization of the classifier with application to real-time information filtering on the web. In: Advances in Neural Information Processing Systems (NeurIPS) (2020)"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Dayan, N., Athanassoulis, M., Idreos, S.: Monkey: optimal navigable key-value store. In: Proceedings of the 2017 ACM International Conference on Management of Data, pp. 79\u201394 (2017)","DOI":"10.1145\/3035918.3064054"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Fan, B., Andersen, D.G., Kaminsky, M., Mitzenmacher, M.D.: Cuckoo filter: practically better than bloom. In: Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies, pp. 75\u201388 (2014)","DOI":"10.1145\/2674005.2674994"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Filic, M., Paterson, K.G., Unnikrishnan, A., Virdia, F.: Adversarial correctness and privacy for probabilistic data structures. In: ACM SIGSAC Conference on Computer and Communications Security (CCS) (2022)","DOI":"10.1145\/3548606.3560621"},{"key":"6_CR9","unstructured":"Gerbet, T., Kumar, A., Lauradoux, C.: On the (in) security of google safe browsing. INRIA ePrint (2014)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Gerbet, T., Kumar, A., Lauradoux, C.: The power of evil choices in bloom filters. In: IEEE\/IFIP International Conference on Dependable Systems and Networks (2015)","DOI":"10.1109\/DSN.2015.21"},{"key":"6_CR11","unstructured":"Google: LevelDB Bloom Filter. https:\/\/github.com\/google\/leveldb\/blob\/main\/util\/bloom.cc, Accessed 04 May 2023"},{"key":"6_CR12","unstructured":"Open Source Implementation and Experiments (2025). https:\/\/github.com\/jadidbourbaki\/permuted-partitioned-lbf"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Kornaropoulos, E.M., Ren, S., Tamassia, R.: The price of tailoring the index to your data: Poisoning attacks on learned index structures. In: Proceedings of the 2022 International Conference on Management of Data, pp. 1331\u20131344 (2022)","DOI":"10.1145\/3514221.3517867"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Kraska, T., Beutel, A., Chi, E.H., Dean, J., Polyzotis, N.: The case for learned index structures. In: International Conference on Management of Data (2018)","DOI":"10.1145\/3183713.3196909"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Lotan, C., Naor, M.: Adversarially robust bloom filters: monotonicity and betting. IACR Commun. Cryptol. 2(1) (2025)","DOI":"10.62056\/a3txom2hd"},{"key":"6_CR16","unstructured":"Mangal, A., Roy, S., Akinapelli, S., Singh, A., Boulon, J.: How roblox reduces spark join query costs with machine learning optimized bloom filters. https:\/\/corp.roblox.com\/newsroom\/2023\/11\/roblox-reduces-spark-join-query-costs-machine-learning-optimized-bloom-filters"},{"key":"6_CR17","unstructured":"Meta: RocksDB Bloom Filter. https:\/\/github.com\/facebook\/rocksdb\/blob\/main\/util\/dynamic_bloom.h, Accessed 04 May 2023"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M.: A model for learned bloom filters and optimizing by sandwiching. Adv. Neural Inform. Process. Syst. 31 (2018)","DOI":"10.1007\/978-1-4614-8265-9_751"},{"issue":"2","key":"6_CR19","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1561\/0400000002","volume":"1","author":"S Muthukrishnan","year":"2005","unstructured":"Muthukrishnan, S.: Data streams: algorithms and applications. Found. Trends Theor. Comput. Sci. 1(2), 117\u2013236 (2005)","journal-title":"Found. Trends Theor. Comput. Sci."},{"issue":"3","key":"6_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3306193","volume":"15","author":"M Naor","year":"2019","unstructured":"Naor, M., Eylon, Y.: Bloom filters in adversarial environments. ACM Trans. Algorit. (TALG) 15(3), 1\u201330 (2019)","journal-title":"ACM Trans. Algorit. (TALG)"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Naor, M., Oved, N.: Bet-or-pass: adversarially robust bloom filters. In: Theory of Cryptography Conference (2022)","DOI":"10.1007\/978-3-031-22365-5_27"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-44676-1_10","volume-title":"Algorithms \u2014 ESA 2001","author":"R Pagh","year":"2001","unstructured":"Pagh, R., Rodler, F.F.: Cuckoo hashing. In: auf der Heide, F.M. (ed.) ESA 2001. LNCS, vol. 2161, pp. 121\u2013133. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44676-1_10"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Reviriego, P., Hern\u00e1ndez, J.A., Dai, Z., Shrivastava, A.: Learned bloom filters in adversarial environments: A malicious url detection use-case. In: IEEE International Conference on High Performance Switching and Routing (HPSR). IEEE (2021)","DOI":"10.1109\/HPSR52026.2021.9481857"},{"key":"6_CR24","unstructured":"Sato, A., Matsui, Y.: Fast partitioned learned bloom filter. In: International Conference on Neural Information Processing Systems (NeurIPS) (2024)"},{"key":"6_CR25","unstructured":"Siddharta, M.: Malicious URLs Dataset. https:\/\/www.kaggle.com\/datasets\/sid321axn\/malicious-urls-dataset"},{"key":"6_CR26","unstructured":"Source, O.: PyCryptoDome library. https:\/\/www.pycryptodome.org\/"},{"key":"6_CR27","unstructured":"Source, O.: Joblib (2025). https:\/\/joblib.readthedocs.io"},{"issue":"1","key":"6_CR28","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1109\/SURV.2011.031611.00024","volume":"14","author":"S Tarkoma","year":"2012","unstructured":"Tarkoma, S., Rothenberg, C.E., Lagerspetz, E.: Theory and practice of bloom filters for distributed systems. IEEE Commun. Surv. Tutorials 14(1), 131\u2013155 (2012)","journal-title":"IEEE Commun. Surv. Tutorials"},{"key":"6_CR29","unstructured":"Tirmazi, H.: Lsm trees in adversarial environments. arXiv preprint arXiv:2502.08832 (2025)"},{"key":"6_CR30","unstructured":"Vaidya, K., Knorr, E., Mitzenmacher, M., Kraska, T.: Partitioned learned bloom filters. In: International Conference on Learning Representations (2021)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5096-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:24:40Z","timestamp":1765106680000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5096-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819550951","9789819550968"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5096-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,8]]},"assertion":[{"value":"8 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The paper was written directly by the authors. The student author used ChatGPT by OpenAI and Claude by Anthropic for feedback on technical writing and to edit and debug the Ti\n                      k\n                      Z and matplotlib figure code in the LaTeX manuscript. The artifacts of our work were primarily written and verified by the authors. The student author used Cursor IDE, which includes a generative AI code assistant, for the following tertiary coding tasks: unit-test generation, code refactoring, feedback on bug-fixing, feedback on anonymizing the artifact, and code reviews.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Generative AI Disclosure"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}