{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T17:54:25Z","timestamp":1773510865122,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T00:00:00Z","timestamp":1715558400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,5,13]]},"DOI":"10.1145\/3589334.3645655","type":"proceedings-article","created":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T07:08:13Z","timestamp":1715152093000},"page":"3076-3084","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Cardinality Counting in \"Alcatraz\": A Privacy-aware Federated Learning Approach"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6851-409X","authenticated-orcid":false,"given":"Nan","family":"Wu","sequence":"first","affiliation":[{"name":"CSIRO's Data61, Sydney, NSW, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9167-1613","authenticated-orcid":false,"given":"Xin","family":"Yuan","sequence":"additional","affiliation":[{"name":"CSIRO's Data61, Sydney, NSW, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8938-2364","authenticated-orcid":false,"given":"Shuo","family":"Wang","sequence":"additional","affiliation":[{"name":"CSIRO's Data61, Sydney, NSW, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4455-4227","authenticated-orcid":false,"given":"Hongsheng","family":"Hu","sequence":"additional","affiliation":[{"name":"CSIRO's Data61, Sydney, NSW, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9172-4252","authenticated-orcid":false,"given":"Minhui","family":"Xue","sequence":"additional","affiliation":[{"name":"CSIRO's Data61, Sydney, NSW, Australia"}]}],"member":"320","published-online":{"date-parts":[[2024,5,13]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.131"},{"key":"e_1_3_2_2_2_1","volume-title":"Data Science for Business: What you need to know about data mining and data-analytic thinking. \" O'Reilly Media","author":"Provost Foster","year":"2013","unstructured":"Foster Provost and Tom Fawcett. Data Science for Business: What you need to know about data mining and data-analytic thinking. \" O'Reilly Media, Inc.\", 2013."},{"key":"e_1_3_2_2_3_1","volume-title":"Set theory an introduction to independence proofs","author":"Kunen Kenneth","year":"2014","unstructured":"Kenneth Kunen. Set theory an introduction to independence proofs. Elsevier, 2014."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061990"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2940705"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/sim.2801"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6847958"},{"key":"e_1_3_2_2_8_1","volume-title":"Search log analysis: What it is, what's been done, how to do it","author":"Jansen Bernard J","year":"2006","unstructured":"Bernard J Jansen. Search log analysis: What it is, what's been done, how to do it. Library & information science research, 28(3):407--432, 2006."},{"key":"e_1_3_2_2_9_1","volume-title":"A linear-time probabilistic counting algorithm for database applications. ACM Transactions on Database Systems (TODS), 15(2):208--229","author":"Whang Kyu-Young","year":"1990","unstructured":"Kyu-Young Whang, Brad T Vander-Zanden, and Howard M Taylor. A linear-time probabilistic counting algorithm for database applications. ACM Transactions on Database Systems (TODS), 15(2):208--229, 1990."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45726-7_1"},{"key":"e_1_3_2_2_11_1","volume-title":"Onur Varol, Alessandro Flammini, and Filippo Menczer. The spread of fake news by social bots. arXiv preprint arXiv:1707.07592, 96:104","author":"Shao Chengcheng","year":"2017","unstructured":"Chengcheng Shao, Giovanni Luca Ciampaglia, Onur Varol, Alessandro Flammini, and Filippo Menczer. The spread of fake news by social bots. arXiv preprint arXiv:1707.07592, 96:104, 2017."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMPSAC.2017.81"},{"key":"e_1_3_2_2_13_1","volume-title":"Inferring internet denial-of-service activity. ACM Transactions on Computer Systems (TOCS), 24(2):115--139","author":"Moore David","year":"2006","unstructured":"David Moore, Colleen Shannon, Douglas J Brown, Geoffrey M Voelker, and Stefan Savage. Inferring internet denial-of-service activity. ACM Transactions on Computer Systems (TOCS), 24(2):115--139, 2006."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/IRI51335.2021.00055"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1186\/s12967-022-03671-6"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btaa764"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26831-2_5"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.46298\/dmtcs.3545"},{"key":"e_1_3_2_2_19_1","first-page":"1297","volume-title":"International Conference on Data Mining Workshops","author":"Chabchoub Yousra","year":"2010","unstructured":"Yousra Chabchoub and Georges H\u00e9brail. Sliding hyperloglog: Estimating cardinality in a data stream over a sliding window. In International Conference on Data Mining Workshops, pages 1297--1303. IEEE, 2010."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2452376.2452456"},{"key":"e_1_3_2_2_21_1","volume-title":"New cardinality estimation algorithms for hyperloglog sketches. arXiv preprint arXiv:1702.01284","author":"Ertl Otmar","year":"2017","unstructured":"Otmar Ertl. New cardinality estimation algorithms for hyperloglog sketches. arXiv preprint arXiv:1702.01284, 2017."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_2_23_1","volume-title":"Introduction to algorithms","author":"Cormen Thomas H","year":"2022","unstructured":"Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein. Introduction to algorithms. MIT press, 2022."},{"key":"e_1_3_2_2_24_1","volume-title":"Database management systems","author":"Ramakrishnan Raghu","year":"2003","unstructured":"Raghu Ramakrishnan, Johannes Gehrke, and Johannes Gehrke. Database management systems, volume 3. McGraw-Hill New York, 2003."},{"key":"e_1_3_2_2_25_1","volume-title":"Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm. Discrete mathematics & theoretical computer science, (Proceedings)","author":"Flajolet Philippe","year":"2007","unstructured":"Philippe Flajolet, \u00c9ric Fusy, Olivier Gandouet, and Fr\u00e9d\u00e9ric Meunier. Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm. Discrete mathematics & theoretical computer science, (Proceedings), 2007."},{"key":"e_1_3_2_2_26_1","first-page":"21","volume-title":"Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No. 97TB100171)","author":"Broder Andrei Z","year":"1997","unstructured":"Andrei Z Broder. On the resemblance and containment of documents. In Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No. 97TB100171), pages 21--29. IEEE, 1997."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_2_2_28_1","first-page":"1","volume-title":"USA","author":"Wright C","year":"2020","unstructured":"C Wright, E Skvortsov, B Kreuter, and Y Wang. Privacy-preserving secure cardinality and frequency estimation. Google LLC: Mountain View, CA, USA, pages 1--20, 2020."},{"key":"e_1_3_2_2_29_1","first-page":"19561","article-title":"The flajolet-martin sketch itself preserves differential privacy: Private counting with minimal space","volume":"33","author":"Smith Adam","year":"2020","unstructured":"Adam Smith, Shuang Song, and Abhradeep Guha Thakurta. The flajolet-martin sketch itself preserves differential privacy: Private counting with minimal space. Advances in Neural Information Processing Systems, 33:19561--19572, 2020.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2019-0018"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.41"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2643132"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3579856.3590338"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3258255"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372224.3419188"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2022.3191492"},{"key":"e_1_3_2_2_37_1","first-page":"88","article-title":"The right to be forgotten","volume":"64","author":"Rosen Jeffrey","year":"2011","unstructured":"Jeffrey Rosen. The right to be forgotten. Stan. L. Rev. Online, 64:88, 2011.","journal-title":"Stan. L. Rev. Online"},{"key":"e_1_3_2_2_38_1","first-page":"201","volume-title":"Methodological developments in data linkage","author":"Schnell Rainer","year":"2016","unstructured":"Rainer Schnell. Privacy preserving record linkage. In Katie Harron, Harvey Goldstein, and Chris Dibben, editors, Methodological developments in data linkage, pages 201--225. Wiley, Chichester, 2016."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2015.12.004"},{"key":"e_1_3_2_2_40_1","first-page":"1","article-title":"Precise and fast cryptanalysis for Bloom filter based privacy-preserving record linkage","author":"Christen Peter","year":"2018","unstructured":"Peter Christen, Thilina Ranbaduge, Dinusha Vatsalan, and Rainer Schnell. Precise and fast cryptanalysis for Bloom filter based privacy-preserving record linkage. IEEE Transactions on Knowledge and Data Engineering, page 1, 2018.","journal-title":"IEEE Transactions on Knowledge and Data Engineering, page"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93040-4_42"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2988575"}],"event":{"name":"WWW '24: The ACM Web Conference 2024","location":"Singapore Singapore","acronym":"WWW '24","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2024"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645655","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3589334.3645655","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:23:56Z","timestamp":1755822236000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645655"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,13]]},"references-count":42,"alternative-id":["10.1145\/3589334.3645655","10.1145\/3589334"],"URL":"https:\/\/doi.org\/10.1145\/3589334.3645655","relation":{},"subject":[],"published":{"date-parts":[[2024,5,13]]},"assertion":[{"value":"2024-05-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}