{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T10:02:16Z","timestamp":1766484136234,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T00:00:00Z","timestamp":1572998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1564444, 1816375"],"award-info":[{"award-number":["1564444, 1816375"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,6]]},"DOI":"10.1145\/3319535.3354235","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T13:08:32Z","timestamp":1573132112000},"page":"1317-1334","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":42,"title":["Probabilistic Data Structures in Adversarial Environments"],"prefix":"10.1145","author":[{"given":"David","family":"Clayton","sequence":"first","affiliation":[{"name":"University of Florida, GAINESVILLE, FL, USA"}]},{"given":"Christopher","family":"Patton","sequence":"additional","affiliation":[{"name":"University of Florida, GAINESVILLE, FL, USA"}]},{"given":"Thomas","family":"Shrimpton","sequence":"additional","affiliation":[{"name":"University of Florida, GAINESVILLE, FL, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,11,6]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/168588.168596"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_25"},{"key":"e_1_3_2_2_3_1","volume-title":"Cheswick","author":"Bellovin Steven M.","year":"2004","unstructured":"Steven M. Bellovin and William R . Cheswick . 2004 . Privacy-Enhanced Searches Using Encrypted Bloom Filters. Cryptology ePrint Archive, Report 2004\/022. http:\/\/eprint.iacr.org\/2004\/022. Steven M. Bellovin and William R. Cheswick. 2004. Privacy-Enhanced Searches Using Encrypted Bloom Filters. Cryptology ePrint Archive, Report 2004\/022. http:\/\/eprint.iacr.org\/2004\/022."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.836103"},{"key":"e_1_3_2_2_7_1","volume-title":"The Bloomier Filter: An Efficient Data Structure for Static Support Lookup Tables. In SODA 2004: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms.","author":"Chazelle Bernard","year":"2004","unstructured":"Bernard Chazelle , Joe Kilian , Ronitt Rubinfeld , and Ayellet Tal . 2004 . The Bloomier Filter: An Efficient Data Structure for Static Support Lookup Tables. In SODA 2004: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms. Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, and Ayellet Tal. 2004. The Bloomier Filter: An Efficient Data Structure for Static Support Lookup Tables. In SODA 2004: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"volume-title":"Proceedings of the 12th USENIX Security Symposium.","author":"Scott","key":"e_1_3_2_2_9_1","unstructured":"Scott A. Crosby and Dan S. Wallach. 2003. Denial of Service via Algorithmic Complexity Attacks . In Proceedings of the 12th USENIX Security Symposium. Scott A. Crosby and Dan S. Wallach. 2003. Denial of Service via Algorithmic Complexity Attacks. In Proceedings of the 12th USENIX Security Symposium."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142477"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70575-8_32"},{"key":"e_1_3_2_2_13_1","volume-title":"Loglog Counting of Large Cardinalities. In ESA 2003: Proceedings of the 11th Annual European Symposium on Algorithms.","author":"Durand Marianne","year":"2003","unstructured":"Marianne Durand and Philippe Flajolet . 2003 . Loglog Counting of Large Cardinalities. In ESA 2003: Proceedings of the 11th Annual European Symposium on Algorithms. Marianne Durand and Philippe Flajolet. 2003. Loglog Counting of Large Cardinalities. In ESA 2003: Proceedings of the 11th Annual European Symposium on Algorithms."},{"volume-title":"Proceedings of the 10th ACM International Conference on Emerging Networking Experiments and Technologies.","author":"Fan Bin","key":"e_1_3_2_2_14_1","unstructured":"Bin Fan , David G. Andersen , Michael Kaminsky , and Michael D. Mitzenmacher . 2014. Cuckoo filter: Practically better than bloom . In Proceedings of the 10th ACM International Conference on Emerging Networking Experiments and Technologies. Bin Fan, David G. Andersen, Michael Kaminsky, and Michael D. Mitzenmacher. 2014. Cuckoo filter: Practically better than bloom. In Proceedings of the 10th ACM International Conference on Emerging Networking Experiments and Technologies."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","DOI":"10.1109\/90.851975","article-title":"Summary cache: A scalable wide-area web cache sharing protocol","volume":"8","author":"Fan Li","year":"2000","unstructured":"Li Fan , Pei Cao , Jussara Almeida , and Andrei Z Broder . 2000 . Summary cache: A scalable wide-area web cache sharing protocol . IEEE\/ACM Transactions on Networking , Vol. 8 , 3 (2000). Li Fan, Pei Cao, Jussara Almeida, and Andrei Z Broder. 2000. Summary cache: A scalable wide-area web cache sharing protocol. IEEE\/ACM Transactions on Networking, Vol. 8, 3 (2000).","journal-title":"IEEE\/ACM Transactions on Networking"},{"volume-title":"Stochastic Fair Blue: A Queue Management Algorithm for Enforcing Fairness. In INFOCOM 2001: Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Society.","author":"Kandlur Dilip D.","key":"e_1_3_2_2_16_1","unstructured":"Wu-chang Feng, Dilip D. Kandlur , Debanjan Saha , and Kang G. Shin . 2001 . Stochastic Fair Blue: A Queue Management Algorithm for Enforcing Fairness. In INFOCOM 2001: Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Society. Wu-chang Feng, Dilip D. Kandlur, Debanjan Saha, and Kang G. Shin. 2001. Stochastic Fair Blue: A Queue Management Algorithm for Enforcing Fairness. In INFOCOM 2001: Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Society."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/828.1884"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2015.21"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2664243.2664267"},{"key":"e_1_3_2_2_20_1","volume-title":"Less Hashing","author":"Kirsch Adam","year":"2008","unstructured":"Adam Kirsch and Michael Mitzenmacher . 2008. Less Hashing , Same Performance : Building a Better Bloom Filter. Random Structures and Algorithms , Vol. 33 , 2 ( 2008 ). Adam Kirsch and Michael Mitzenmacher. 2008. Less Hashing, Same Performance: Building a Better Bloom Filter. Random Structures and Algorithms, Vol. 33, 2 (2008)."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.17"},{"key":"e_1_3_2_2_22_1","volume-title":"Naughton","author":"Lipton Richard J.","year":"1993","unstructured":"Richard J. Lipton and Jeffrey F . Naughton . 1993 . Clocked Adversaries for Hashing. Algorithmica , Vol. 9 , 3 (1993). Richard J. Lipton and Jeffrey F. Naughton. 1993. Clocked Adversaries for Hashing. Algorithmica, Vol. 9, 3 (1993)."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/080733772"},{"key":"e_1_3_2_2_24_1","volume-title":"Bloom Filters in Adversarial Environments. In CRYPTO 2015: Proceedings of the 35th Annual Cryptology Conference.","author":"Naor Moni","year":"2015","unstructured":"Moni Naor and Eylon Yogev . 2015 . Bloom Filters in Adversarial Environments. In CRYPTO 2015: Proceedings of the 35th Annual Cryptology Conference. Moni Naor and Eylon Yogev. 2015. Bloom Filters in Adversarial Environments. In CRYPTO 2015: Proceedings of the 35th Annual Cryptology Conference."},{"key":"e_1_3_2_2_25_1","article-title":"Cryptographically Secure Bloom-Filters","volume":"2","author":"Nojima Ryo","year":"2009","unstructured":"Ryo Nojima and Youki Kadobayashi . 2009 . Cryptographically Secure Bloom-Filters . Transactions on Data Privacy , Vol. 2 , 2 (2009). Ryo Nojima and Youki Kadobayashi. 2009. Cryptographically Secure Bloom-Filters. Transactions on Data Privacy, Vol. 2, 2 (2009).","journal-title":"Transactions on Data Privacy"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1515915.1515918"},{"volume-title":"A novel error-tolerant anonymous linking code. Working paper series no. WP-GRLC-2011-02","author":"Schnell Rainer","key":"e_1_3_2_2_27_1","unstructured":"Rainer Schnell , Tobias Bachteler , and J\u00f6rg Reiher . 2011. A novel error-tolerant anonymous linking code. Working paper series no. WP-GRLC-2011-02 , German Record Linkage Center . Rainer Schnell, Tobias Bachteler, and J\u00f6rg Reiher. 2011. A novel error-tolerant anonymous linking code. Working paper series no. WP-GRLC-2011-02, German Record Linkage Center."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2011.031611.00024"}],"event":{"name":"CCS '19: 2019 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"London United Kingdom","acronym":"CCS '19"},"container-title":["Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3354235","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3319535.3354235","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3319535.3354235","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:24:03Z","timestamp":1750202643000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3354235"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,6]]},"references-count":28,"alternative-id":["10.1145\/3319535.3354235","10.1145\/3319535"],"URL":"https:\/\/doi.org\/10.1145\/3319535.3354235","relation":{},"subject":[],"published":{"date-parts":[[2019,11,6]]},"assertion":[{"value":"2019-11-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}