{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T01:21:22Z","timestamp":1765502482652,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100022943","name":"Universities Australia","doi-asserted-by":"publisher","award":["57559735"],"award-info":[{"award-number":["57559735"]}],"id":[{"id":"10.13039\/501100022943","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,10]]},"DOI":"10.1145\/3746252.3761302","type":"proceedings-article","created":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T01:03:42Z","timestamp":1762563822000},"page":"4582-4591","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Vulnerability-Aware Hardening for Secure Privacy-Preserving Record Linkage"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-5844-0111","authenticated-orcid":false,"given":"Sumayya","family":"Ziyad","sequence":"first","affiliation":[{"name":"School of Computing, The Australian National University, Canberra, ACT, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3435-2015","authenticated-orcid":false,"given":"Peter","family":"Christen","sequence":"additional","affiliation":[{"name":"School of Computing, The Australian National University, Canberra, ACT, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5386-5871","authenticated-orcid":false,"given":"Anushka","family":"Vidanage","sequence":"additional","affiliation":[{"name":"School of Computing, The Australian National University, Canberra, ACT, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7603-1845","authenticated-orcid":false,"given":"Charini","family":"Nanayakkara","sequence":"additional","affiliation":[{"name":"School of Computing, The Australian National University, Canberra, ACT, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7843-4974","authenticated-orcid":false,"given":"Rainer","family":"Schnell","sequence":"additional","affiliation":[{"name":"Research Methodology Group, University of Duisburg-Essen, Duisburg, NRW, Germany"}]}],"member":"320","published-online":{"date-parts":[[2025,11,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.56553\/popets-2023-0054"},{"key":"e_1_3_2_1_2_1","volume-title":"Science Advances","volume":"8","author":"Binette Olivier","year":"2022","unstructured":"Olivier Binette and Rebecca C Steorts. 2022. (Almost) all of entity resolution. Science Advances, Vol. 8, 12 (2022), eabi8021."},{"volume-title":"Entity Resolution, and Duplicate Detection","author":"Christen Peter","key":"e_1_3_2_1_3_1","unstructured":"Peter Christen. 2012. Data Matching - Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection. Springer, Heidelberg."},{"volume-title":"Linking Sensitive Data","author":"Christen Peter","key":"e_1_3_2_1_4_1","unstructured":"Peter Christen, Thilina Ranbaduge, and Rainer Schnell. 2020. Linking Sensitive Data. Springer, Heidelberg."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.23889\/ijpds.v8i1.2115"},{"volume-title":"Pattern-mining based cryptanalysis of Bloom filters for PPRL","author":"Christen Peter","key":"e_1_3_2_1_6_1","unstructured":"Peter Christen, Anushka Vidanage, Thilina Ranbaduge, and Rainer Schnell. 2018. Pattern-mining based cryptanalysis of Bloom filters for PPRL. In PAKDD. Springer, Melbourne, 628-640."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41060-022-00377-2"},{"key":"e_1_3_2_1_8_1","first-page":"233","article-title":"The relationship between Precision-Recall and ROC curves. In ICML. ACM","author":"Davis Jesse","year":"2006","unstructured":"Jesse Davis and Mark Goadrich. 2006. The relationship between Precision-Recall and ROC curves. In ICML. ACM, Pittsburgh, 233-240.","journal-title":"Pittsburgh"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516701"},{"volume-title":"International Colloquium on Automata, Languages and Programming","key":"e_1_3_2_1_10_1","unstructured":"Cynthia. Dwork. 2006. Differential privacy. In International Colloquium on Automata, Languages and Programming. Springer, Venice, 1-12."},{"key":"e_1_3_2_1_11_1","first-page":"1054","article-title":"Rappor: Randomized aggregatable privacy-preserving ordinal response. In SIGSAC. ACM","author":"Erlingsson \u00dalfar","year":"2014","unstructured":"\u00dalfar Erlingsson, Vasyl Pihur, and Aleksandra Korolova. 2014. Rappor: Randomized aggregatable privacy-preserving ordinal response. In SIGSAC. ACM, Scottsdale, 1054-1067.","journal-title":"Scottsdale"},{"key":"e_1_3_2_1_12_1","first-page":"4966","article-title":"Modern Privacy-Preserving Record Linkage Techniques","volume":"16","author":"Gkoulalas-Divanis Aris","year":"2021","unstructured":"Aris Gkoulalas-Divanis, Dinusha Vatsalan, Dimitrios Karapiperis, and Murat Kantarcioglu. 2021. Modern Privacy-Preserving Record Linkage Techniques: An Overview. IEEE TIFS, Vol. 16 (2021), 4966-4987.","journal-title":"An Overview. IEEE TIFS"},{"key":"e_1_3_2_1_13_1","volume-title":"Fienberg","author":"Hall Rob","year":"2010","unstructured":"Rob Hall and Stephen E. Fienberg. 2010. Privacy-preserving record linkage. In Privacy in Statistical Databases. Springer, Corfu, Greece, 269-283."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-017-9746-6"},{"key":"e_1_3_2_1_15_1","volume-title":"Winkler","author":"Herzog Thomas N.","year":"2007","unstructured":"Thomas N. Herzog, Fritz Scheuren, and William E. Winkler. 2007. Data Quality and Record Linkage Techniques. Springer Verlag, New York."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41483-6_5"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.29012\/jpc.v1i1.566"},{"key":"e_1_3_2_1_18_1","first-page":"1285","article-title":"Anonymizing healthcare data: a case study on the blood transfusion service. In SIGKDD. ACM","author":"Mohammed Noman","year":"2009","unstructured":"Noman Mohammed, Benjamin CM Fung, Patrick CK Hung, and Cheuk-kwong Lee. 2009. Anonymizing healthcare data: a case study on the blood transfusion service. In SIGKDD. ACM, Paris, 1285-1294.","journal-title":"Paris"},{"key":"e_1_3_2_1_19_1","first-page":"4354","article-title":"Locality sensitive hashing with temporal and spatial constraints for efficient population record linkage. In CIKM. ACM","author":"Nanayakkara Charini","year":"2022","unstructured":"Charini Nanayakkara and Peter Christen. 2022. Locality sensitive hashing with temporal and spatial constraints for efficient population record linkage. In CIKM. ACM, Atlanta, 4354-4358.","journal-title":"Atlanta"},{"volume-title":"An Introduction to Duplicate Detection","author":"Naumann Felix","key":"e_1_3_2_1_20_1","unstructured":"Felix Naumann and Melanie Herschel. 2010. An Introduction to Duplicate Detection. Morgan and Claypool Publishers."},{"key":"e_1_3_2_1_21_1","first-page":"59","volume-title":"JPC","volume":"6","author":"Niedermeyer Frank","year":"2014","unstructured":"Frank Niedermeyer, Simone Steinmetzer, Martin Kroll, and Rainer Schnell. 2014. Cryptanalysis of Basic Bloom Filters Used for Privacy Preserving Record Linkage. JPC, Vol. 6, 2 (2014), 59-79."},{"volume-title":"Secure and Accurate Two-step Hash Encoding for Privacy-Preserving Record Linkage","author":"Ranbaduge Thilina","key":"e_1_3_2_1_22_1","unstructured":"Thilina Ranbaduge, Peter Christen, and Rainer Schnell. 2020a. Secure and Accurate Two-step Hash Encoding for Privacy-Preserving Record Linkage. In PAKDD. Springer, Singapore, 139-151."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Thilina Ranbaduge and Rainer Schnell. 2020. Securing Bloom filters for privacy-preserving record linkage. In CIKM. ACM Galway (online) 2185-2188.","DOI":"10.1145\/3340531.3412105"},{"key":"e_1_3_2_1_24_1","first-page":"25","article-title":"Secure Multi-party Summation Protocols: Are They Secure Enough Under Collusion","volume":"13","author":"Ranbaduge Thilina","year":"2020","unstructured":"Thilina Ranbaduge, Dinusha Vatsalan, and Peter Christen. 2020b. Secure Multi-party Summation Protocols: Are They Secure Enough Under Collusion? Transactions on Data Privacy, Vol. 13, 1 (2020), 25-60.","journal-title":"Transactions on Data Privacy"},{"key":"e_1_3_2_1_25_1","first-page":"6839","article-title":"Privacy-preserving deep learning based record linkage","volume":"36","author":"Ranbaduge Thilina","year":"2023","unstructured":"Thilina Ranbaduge, Dinusha Vatsalan, and Ming Ding. 2023. Privacy-preserving deep learning based record linkage. TKDE, Vol. 36 (2023), 6839-6850. Issue 11.","journal-title":"TKDE"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijmedinf.2024.105582"},{"volume-title":"Methodological Developments in Data Linkage","author":"Schnell Rainer","key":"e_1_3_2_1_27_1","unstructured":"Rainer Schnell. 2015. Privacy-Preserving Record Linkage. In Methodological Developments in Data Linkage, Katie Harron, Harvey Goldstein, and Chris Dibben (Eds.). John Wiley & Sons, 201-225."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1186\/1472-6947-9-41"},{"key":"e_1_3_2_1_29_1","volume-title":"Randomized Response and Balanced Bloom Filters for Privacy Preserving Record Linkage. In ICDM DINA workshop. IEEE, Barcelona, 5 pages.","author":"Schnell Rainer","year":"2016","unstructured":"Rainer Schnell and Christian Borgs. 2016a. Randomized Response and Balanced Bloom Filters for Privacy Preserving Record Linkage. In ICDM DINA workshop. IEEE, Barcelona, 5 pages."},{"key":"e_1_3_2_1_30_1","volume-title":"WP-GRLC-2016-03","author":"Schnell Rainer","year":"2016","unstructured":"Rainer Schnell and Christian Borgs. 2016b. XOR-Folding for Bloom Filter-based Encryptions for Privacy-preserving Record Linkage. German RLC, WP-GRLC-2016-03 (2016), 9 pages."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2018.00082"},{"key":"e_1_3_2_1_32_1","first-page":"91","article-title":"Protecting Record Linkage Identifiers Using a Language Model for Patient Names","volume":"253","author":"Schnell Rainer","year":"2018","unstructured":"Rainer Schnell and Christian Borgs. 2018b. Protecting Record Linkage Identifiers Using a Language Model for Patient Names. Studies in Health Technology and Informatics, Vol. 253 (2018), 91-95.","journal-title":"Studies in Health Technology and Informatics"},{"volume-title":"Reference Values Based Hardening for Bloom Filters Based Privacy-Preserving Record Linkage","author":"Vaiwsri Sirintra","key":"e_1_3_2_1_33_1","unstructured":"Sirintra Vaiwsri, Thilina Ranbaduge, and Peter Christen. 2018. Reference Values Based Hardening for Bloom Filters Based Privacy-Preserving Record Linkage. In AusDM. Springer, Bathurst, 189-202."},{"key":"e_1_3_2_1_34_1","first-page":"1949","article-title":"Efficient Two-party Private Blocking Based on Sorted Nearest Neighborhood Clustering. In CIKM. ACM","author":"Vatsalan Dinusha","year":"2013","unstructured":"Dinusha Vatsalan, Peter Christen, and Vassilios S. Verykios. 2013. Efficient Two-party Private Blocking Based on Sorted Nearest Neighborhood Clustering. In CIKM. ACM, San Francisco, 1949-1958.","journal-title":"San Francisco"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589641"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.29012\/jpc.764"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2554850.2555001"},{"key":"e_1_3_2_1_38_1","unstructured":"Stephen Wolfram. 2002. A New Kind of Science. Wolfram Media Champaign."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2025.102569"}],"event":{"name":"CIKM '25: The 34th ACM International Conference on Information and Knowledge Management","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Seoul Republic of Korea","acronym":"CIKM '25"},"container-title":["Proceedings of the 34th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3746252.3761302","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T01:17:17Z","timestamp":1765502237000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3746252.3761302"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,10]]},"references-count":39,"alternative-id":["10.1145\/3746252.3761302","10.1145\/3746252"],"URL":"https:\/\/doi.org\/10.1145\/3746252.3761302","relation":{},"subject":[],"published":{"date-parts":[[2025,11,10]]},"assertion":[{"value":"2025-11-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}