{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T16:33:04Z","timestamp":1754152384197,"version":"3.41.2"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,8,7]]},"DOI":"10.1145\/3735358.3735362","type":"proceedings-article","created":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T23:08:27Z","timestamp":1752793707000},"page":"207-213","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Unmasking Vulnerabilities of HyperLogLog: Security via Parameter Extraction"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-4034-8695","authenticated-orcid":false,"given":"Shishi","family":"Zhang","sequence":"first","affiliation":[{"name":"Xiamen Key Laboratory of Intelligent Storage and Computing, School of Informatics, Xiamen University, Xiamen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-6017-8878","authenticated-orcid":false,"given":"Ning","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Informatics, Xiamen University, Xiamen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2923-6247","authenticated-orcid":false,"given":"Lu","family":"Tang","sequence":"additional","affiliation":[{"name":"Xiamen Key Laboratory of Intelligent Storage and Computing, School of Informatics, Xiamen University, Xiamen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,8,6]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/NFV-SDN53031.2021.9665095"},{"key":"e_1_3_3_1_3_2","volume-title":"Proceedings of the 2024 ICML","author":"Ahmadian Sara","year":"2024","unstructured":"Sara Ahmadian and Edith Cohen. 2024. Unmasking vulnerabilities: cardinality sketches under adaptive inputs. In Proceedings of the 2024 ICML."},{"key":"e_1_3_3_1_4_2","unstructured":"Amazon Web Services. 2025. Amazon Web Services. https:\/\/aws.amazon.com\/ Accessed: 2025-02-25."},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742797"},{"key":"e_1_3_3_1_6_2","first-page":"455","volume-title":"Proceedings of the 2024 USENIX NSDI","author":"Atre Nirav","year":"2024","unstructured":"Nirav Atre, Hugo Sadok, and Justine Sherry. 2024. BBQ: A Fast and Scalable Integer Priority Queue for Hardware Packet Scheduling. In Proceedings of the 2024 USENIX NSDI. 455\u2013475."},{"key":"e_1_3_3_1_7_2","unstructured":"Damien Desfontaines Andreas Lochbihler and David Basin. 2018. Cardinality estimators do not preserve privacy. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/1808.05879 (2018)."},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM52122.2024.10621185"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM53939.2023.10229088"},{"key":"e_1_3_3_1_10_2","first-page":"65","volume-title":"Proceedings of the 2014 USENIX Security","author":"Durumeric Zakir","year":"2014","unstructured":"Zakir Durumeric, Michael Bailey, and J\u00a0Alex Halderman. 2014. An Internet-Wide view of Internet-Wide scanning. In Proceedings of the 2014 USENIX Security. 65\u201378."},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.14778\/3654621.3654632"},{"key":"e_1_3_3_1_12_2","first-page":"817","volume-title":"Proceedings of the 2015 USENIX Security","author":"Fayaz Seyed\u00a0K","year":"2015","unstructured":"Seyed\u00a0K Fayaz, Yoshiaki Tobioka, Vyas Sekar, and Michael Bailey. 2015. Bohatei: Flexible and elastic DDoS defense. In Proceedings of the 2015 USENIX Security. 817\u2013832."},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"crossref","unstructured":"Philippe Flajolet \u00c9ric Fusy Olivier Gandouet and Fr\u00e9d\u00e9ric Meunier. 2007. Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm. Discrete mathematics & theoretical computer science (2007) 137\u2013156.","DOI":"10.46298\/dmtcs.3545"},{"key":"e_1_3_3_1_14_2","unstructured":"Google Cloud. 2025. Google Cloud. https:\/\/cloud.google.com\/ Accessed: 2025-02-25."},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/2452376.2452456"},{"key":"e_1_3_3_1_16_2","unstructured":"Mehrdad Honarkhah and Arya Talebzadeh. 2018. Hyperloglog in presto: A significantly faster way to handle cardinality estimation. Online: https:\/\/engineering. fb. com\/data-infrastructure\/hyperloglog (2018)."},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539246"},{"key":"e_1_3_3_1_18_2","unstructured":"Microsoft Azure. 2025. Microsoft Azure. https:\/\/azure.microsoft.com\/en-us\/ Accessed: 2025-02-25."},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"crossref","unstructured":"Rajeev Motwani and Prabhakar Raghavan. 1996. Randomized algorithms. Comput. Surveys 28 1 (1996) 33\u201337.","DOI":"10.1145\/234313.234327"},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP53844.2022.00018"},{"key":"e_1_3_3_1_21_2","unstructured":"Redis. 2025. Redis. https:\/\/redis.io\/ Accessed: 2025-02-25."},{"key":"e_1_3_3_1_22_2","unstructured":"Pedro Reviriego Pablo Adell and Daniel Ting. 2020. Hyperloglog (hll) security: Inflating cardinality estimates. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2011.10355 (2020)."},{"key":"e_1_3_3_1_23_2","doi-asserted-by":"crossref","unstructured":"Pedro Reviriego and Daniel Ting. 2020. Security of HyperLogLog (HLL) cardinality estimation: Vulnerabilities and protection. IEEE Communications Letters 24 5 (2020) 976\u2013980.","DOI":"10.1109\/LCOMM.2020.2972895"},{"key":"e_1_3_3_1_24_2","doi-asserted-by":"crossref","unstructured":"Bharath\u00a0K Samanthula and Wei Jiang. 2015. Secure multiset intersection cardinality and its application to jaccard coefficient. IEEE Transactions on Dependable and Secure Computing 13 5 (2015) 591\u2013604.","DOI":"10.1109\/TDSC.2015.2415482"},{"key":"e_1_3_3_1_25_2","doi-asserted-by":"crossref","unstructured":"Kyu-Young Whang Brad\u00a0T Vander-Zanden and Howard\u00a0M Taylor. 1990. A linear-time probabilistic counting algorithm for database applications. ACM Transactions on Database Systems 15 2 (1990) 208\u2013229.","DOI":"10.1145\/78922.78925"},{"key":"e_1_3_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057088"}],"event":{"name":"APNET 2025: The 9th Asia-Pacific Workshop on Networking","acronym":"APNET 2025","location":"Shang Hai China"},"container-title":["Proceedings of the 9th Asia-Pacific Workshop on Networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3735358.3735362","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,22]],"date-time":"2025-07-22T05:08:58Z","timestamp":1753160938000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3735358.3735362"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,6]]},"references-count":25,"alternative-id":["10.1145\/3735358.3735362","10.1145\/3735358"],"URL":"https:\/\/doi.org\/10.1145\/3735358.3735362","relation":{},"subject":[],"published":{"date-parts":[[2025,8,6]]},"assertion":[{"value":"2025-08-06","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}