{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T19:16:49Z","timestamp":1774725409510,"version":"3.50.1"},"reference-count":71,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T00:00:00Z","timestamp":1687824000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Universities Australia and the German Academic Exchange Service","award":["57559735"],"award-info":[{"award-number":["57559735"]}]},{"DOI":"10.13039\/501100001659","name":"German Research Foundation","doi-asserted-by":"crossref","award":["407023611"],"award-info":[{"award-number":["407023611"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Priv. Secur."],"published-print":{"date-parts":[[2023,8,30]]},"abstract":"<jats:p>The linkage of records to identify common entities across multiple data sources has gained increasing interest over the last few decades. In the absence of unique entity identifiers, quasi-identifying attributes such as personal names and addresses are generally used to link records. Due to privacy concerns that arise when such sensitive information is used, privacy-preserving record linkage (PPRL) methods have been proposed to link records without revealing any sensitive or confidential information about these records. Popular PPRL methods such as Bloom filter encoding, however, are known to be susceptible to various privacy attacks. Therefore, a systematic analysis of the privacy risks associated with sensitive databases as well as PPRL methods used in linkage projects is of great importance. In this article we present a novel framework to assess the vulnerabilities of sensitive databases and existing PPRL encoding methods. We discuss five types of vulnerabilities: frequency, length, co-occurrence, similarity, and similarity neighborhood, of both plaintext and encoded values that an adversary can exploit in order to reidentify sensitive plaintext values from encoded data. In an experimental evaluation we assess the vulnerabilities of two databases using five existing PPRL encoding methods. This evaluation shows that our proposed framework can be used in real-world linkage applications to assess the vulnerabilities associated with sensitive databases to be linked, as well as with PPRL encoding methods.<\/jats:p>","DOI":"10.1145\/3589641","type":"journal-article","created":{"date-parts":[[2023,4,3]],"date-time":"2023-04-03T12:20:05Z","timestamp":1680524405000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["A Vulnerability Assessment Framework for Privacy-preserving Record Linkage"],"prefix":"10.1145","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5386-5871","authenticated-orcid":false,"given":"Anushka","family":"Vidanage","sequence":"first","affiliation":[{"name":"The Australian National University, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3435-2015","authenticated-orcid":false,"given":"Peter","family":"Christen","sequence":"additional","affiliation":[{"name":"The Australian National University, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5405-3704","authenticated-orcid":false,"given":"Thilina","family":"Ranbaduge","sequence":"additional","affiliation":[{"name":"Data61, CSIRO, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7843-4974","authenticated-orcid":false,"given":"Rainer","family":"Schnell","sequence":"additional","affiliation":[{"name":"University Duisburg-Essen, Germany"}]}],"member":"320","published-online":{"date-parts":[[2023,6,27]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"crossref","unstructured":"Athanasios Andreou Oana Goga and Patrick Loiseau. 2017. Identity vs. attribute disclosure risks for users with multiple social profiles. In International Conference on Advances in Social Networks Analysis and Mining (ASONAM\u201917) . IEEE\/ACM 163\u2013170.","DOI":"10.1145\/3110025.3110046"},{"key":"e_1_3_3_3_2","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/978-3-540-70936-7_8","volume-title":"Theory of Cryptography Conference (TCC\u201907)","author":"Aumann Yonatan","year":"2007","unstructured":"Yonatan Aumann and Yehuda Lindell. 2007. Security against covert adversaries: Efficient protocols for realistic adversaries. In Theory of Cryptography Conference (TCC\u201907). Springer, 137\u2013156."},{"key":"e_1_3_3_4_2","doi-asserted-by":"crossref","unstructured":"Mihir Bellare Ran Canetti and Hugo Krawczyk. 1996. Keying hash functions for message authentication. Advances in Cryptology (CRYPTO\u201996) . Springer Berlin 1\u201315.","DOI":"10.1007\/3-540-68697-5_1"},{"issue":"7","key":"e_1_3_3_5_2","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","article-title":"Space\/time trade-offs in hash coding with allowable errors","volume":"13","author":"Bloom Burton H.","year":"1970","unstructured":"Burton H. Bloom. 1970. Space\/time trade-offs in hash coding with allowable errors. Communications of the ACM 13, 7 (1970), 422\u2013426.","journal-title":"Communications of the ACM"},{"key":"e_1_3_3_6_2","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/978-3-319-23633-9_11","volume-title":"Medical Data Privacy Handbook","author":"Boyd James H.","year":"2015","unstructured":"James H. Boyd, Sean M. Randall, and Anna M. Ferrante. 2015. Application of privacy-preserving techniques in operational record linkage centres. In Medical Data Privacy Handbook. Springer, Cham, 267\u2013287."},{"key":"e_1_3_3_7_2","doi-asserted-by":"crossref","unstructured":"Jianneng Cao Fang-Yu Rao Elisa Bertino and Murat Kantarcioglu. 2015. A hybrid private record linkage scheme: Separating differentially private synopses from matching records. International Conference on Data Engineering (ICDE\u201915) . IEEE New York NY 1011\u20131022.","DOI":"10.1109\/ICDE.2015.7113352"},{"key":"e_1_3_3_8_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-31164-2","volume-title":"Data Matching \u2013 Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection","author":"Christen Peter","year":"2012","unstructured":"Peter Christen. 2012. Data Matching \u2013 Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection. Springer, Berlin."},{"key":"e_1_3_3_9_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-59706-1","volume-title":"Linking Sensitive Data \u2013 Methods and Techniques for Practical Privacy-Preserving Information Sharing","author":"Christen Peter","year":"2020","unstructured":"Peter Christen, Thilina Ranbaduge, and Rainer Schnell. 2020. Linking Sensitive Data \u2013 Methods and Techniques for Practical Privacy-Preserving Information Sharing. Springer, Berlin."},{"issue":"11","key":"e_1_3_3_10_2","doi-asserted-by":"crossref","first-page":"2164","DOI":"10.1109\/TKDE.2018.2874004","article-title":"Precise and fast cryptanalysis for Bloom filter based privacy-preserving record linkage","volume":"31","author":"Christen Peter","year":"2018","unstructured":"Peter Christen, Thilina Ranbaduge, Dinusha Vatsalan, and Rainer Schnell. 2018. Precise and fast cryptanalysis for Bloom filter based privacy-preserving record linkage. Transactions on Knowledge and Data Engineering 31, 11 (2018), 2164\u20132177.","journal-title":"Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_3_11_2","doi-asserted-by":"crossref","first-page":"101930","DOI":"10.1016\/j.is.2021.101930","article-title":"A critique and attack on \u201cBlockchain- based privacy-preserving record linkage.\u201d","volume":"108","author":"Christen Peter","year":"2021","unstructured":"Peter Christen, Rainer Schnell, Thilina Ranbaduge, and Anushka Vidanage. 2021. A critique and attack on \u201cBlockchain- based privacy-preserving record linkage.\u201d Information Systems 108 (2021), 101930.","journal-title":"Information Systems"},{"key":"e_1_3_3_12_2","doi-asserted-by":"crossref","unstructured":"Peter Christen Rainer Schnell Dinusha Vatsalan and Thilina Ranbaduge. 2017. Efficient cryptanalysis of Bloom filters for privacy-preserving record linkage. Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD\u201917) . Springer 628\u2013640.","DOI":"10.1007\/978-3-319-57454-7_49"},{"key":"e_1_3_3_13_2","doi-asserted-by":"crossref","unstructured":"Peter Christen Anushka Vidanage Thilina Ranbaduge and R. Schnell. 2018. Pattern-mining based cryptanalysis of Bloom filters for privacy-preserving record linkage. Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD\u201918) . Springer 628\u2013640.","DOI":"10.1007\/978-3-319-57454-7_49"},{"key":"e_1_3_3_14_2","article-title":"Vulnerabilities in the use of similarity tables in combination with pseudonymisation to preserve data privacy in the UK office for national statistics\u2019 privacy-preserving record linkage","author":"Culnane Chris","year":"2017","unstructured":"Chris Culnane, Benjamin Rubinstein, and Vanessa Teague. 2017. Vulnerabilities in the use of similarity tables in combination with pseudonymisation to preserve data privacy in the UK office for national statistics\u2019 privacy-preserving record linkage. arXiv (2017).","journal-title":"arXiv"},{"key":"e_1_3_3_15_2","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/978-3-540-24732-6_5","volume-title":"International SPIN Workshop on Model Checking of Software","author":"Dillinger Peter C.","year":"2004","unstructured":"Peter C. Dillinger and Panagiotis Manolios. 2004. Fast and accurate bitstate verification for SPIN. In International SPIN Workshop on Model Checking of Software. Springer, Berlin, 57\u201375."},{"key":"e_1_3_3_16_2","doi-asserted-by":"crossref","unstructured":"Josep Domingo-Ferrer Sara Ricci and Jordi Soria-Comas. 2015. Disclosure risk assessment via record linkage by a maximum-knowledge attacker. Conference on Privacy Security and Trust (PST\u201915) . IEEE Los Alamitos CA 28\u201335.","DOI":"10.1109\/PST.2015.7232951"},{"key":"e_1_3_3_17_2","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/S0377-0427(03)00643-5","article-title":"Disclosure risk assessment in statistical data protection","volume":"164","author":"Domingo-Ferrer Josep","year":"2004","unstructured":"Josep Domingo-Ferrer and Vicen\u00e7 Torra. 2004. Disclosure risk assessment in statistical data protection. Journal of Computational and Applied Mathematics 164\u2013165 (2004), 285\u2013293.","journal-title":"Journal of Computational and Applied Mathematics"},{"issue":"2","key":"e_1_3_3_18_2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1080\/07350015.1989.10509729","article-title":"The risk of disclosure for microdata","volume":"7","author":"Duncan George","year":"1989","unstructured":"George Duncan and Diane Lambert. 1989. The risk of disclosure for microdata. Journal of Business & Economic Statistics 7, 2 (1989), 207\u2013217.","journal-title":"Journal of Business & Economic Statistics"},{"key":"e_1_3_3_19_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-7802-8","volume-title":"Statistical Confidentiality: Principles and Practice","author":"Duncan George T.","year":"2011","unstructured":"George T. Duncan, Mark Elliot, and Juan Jose Salazar Gonzalez. 2011. Statistical Confidentiality: Principles and Practice. Springer."},{"issue":"12","key":"e_1_3_3_20_2","doi-asserted-by":"crossref","first-page":"2956","DOI":"10.1109\/TKDE.2013.91","article-title":"Composite Bloom filters for secure record linkage","volume":"26","author":"Durham Elizabeth","year":"2014","unstructured":"Elizabeth Durham, Murat Kantarcioglu, Yuan Xue, Csaba Toth, Mehmet Kuzu, and Bradley Malin. 2014. Composite Bloom filters for secure record linkage. Transactions on Knowledge and Data Engineering 26, 12 (2014), 2956\u20132968.","journal-title":"Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_3_21_2","volume-title":"A Framework for Accurate, Efficient Private Record Linkage","author":"Durham Elizabeth A.","year":"2012","unstructured":"Elizabeth A. Durham. 2012. A Framework for Accurate, Efficient Private Record Linkage. Ph.D. Dissertation. Faculty of the Graduate School of Vanderbilt University, Nashville, TN."},{"key":"e_1_3_3_22_2","doi-asserted-by":"crossref","unstructured":"Cynthia Dwork. 2006. Differential privacy. International Colloquium on Automata Languages and Programming (ICALP\u201906) . 1\u201312.","DOI":"10.1007\/11787006_1"},{"key":"e_1_3_3_23_2","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Theory of Cryptography (TCC\u201906)","author":"Dwork Cynthia","year":"2006","unstructured":"Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith. 2006. Calibrating noise to sensitivity in private data analysis. Theory of Cryptography (TCC\u201906). Springer, Berlin, 265\u2013284."},{"key":"e_1_3_3_24_2","volume-title":"The Anonymisation Decision-making Framework 2nd Edition: European Practitioners\u2019 Guide","author":"Elliot Mark","year":"2020","unstructured":"Mark Elliot, Elaine Mackey, and Kieron O\u2019Hara. 2020. The Anonymisation Decision-making Framework 2nd Edition: European Practitioners\u2019 Guide. UK Anonymisation Network, Manchester."},{"issue":"4","key":"e_1_3_3_25_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1749603.1749605","article-title":"Privacy-preserving data publishing: A survey of recent developments","volume":"42","author":"Fung Benjamin","year":"2010","unstructured":"Benjamin Fung, Ke Wang, Rui Chen, and Philip S. Yu. 2010. Privacy-preserving data publishing: A survey of recent developments. ACM Computing Surveys 42, 4 (2010), 1\u201353.","journal-title":"ACM Computing Surveys"},{"key":"e_1_3_3_26_2","doi-asserted-by":"crossref","first-page":"4966","DOI":"10.1109\/TIFS.2021.3114026","article-title":"Modern privacy-preserving record linkage techniques: An overview","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 Transactions on Information Forensics and Security 16 (2021), 4966\u20134987.","journal-title":"IEEE Transactions on Information Forensics and Security"},{"issue":"3","key":"e_1_3_3_27_2","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1109\/TDSC.2012.17","article-title":"M-score: A misuseability weight measure","volume":"9","author":"Harel Amir","year":"2012","unstructured":"Amir Harel, Asaf Shabtai, Lior Rokach, and Yuval Elovici. 2012. M-score: A misuseability weight measure. IEEE Transactions on Dependable and Secure Computing 9, 3 (2012), 414\u2013428.","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"key":"e_1_3_3_28_2","doi-asserted-by":"crossref","unstructured":"Ali Inan Murat Kantarcioglu Gabriel Ghinita and Elisa Bertino. 2010. Private record matching using differential privacy. International Conference on Extending Database Technology (EDBT\u201910) . ACM 123\u2013134.","DOI":"10.1145\/1739041.1739059"},{"issue":"11","key":"e_1_3_3_29_2","doi-asserted-by":"crossref","first-page":"1206","DOI":"10.1016\/j.datak.2009.06.011","article-title":"Formal anonymity models for efficient privacy-preserving joins","volume":"68","author":"Kantarcioglu Murat","year":"2009","unstructured":"Murat Kantarcioglu, Ali Inan, Wei Jiang, and Bradley Malin. 2009. Formal anonymity models for efficient privacy-preserving joins. Data & Knowledge Engineering 68, 11 (2009), 1206\u20131223.","journal-title":"Data & Knowledge Engineering"},{"key":"e_1_3_3_30_2","doi-asserted-by":"crossref","unstructured":"Alexandros Karakasidis and Vassilios S. Verykios. 2012. Reference table based k-anonymous private blocking. PACM Symposium on Applied Computing (SAC\u201912) . ACM 859\u2013864.","DOI":"10.1145\/2245276.2245444"},{"key":"e_1_3_3_31_2","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/978-3-642-28879-1_2","volume-title":"Data Privacy Management and Autonomous Spontaneous Security","author":"Karakasidis Alexandros","year":"2012","unstructured":"Alexandros Karakasidis, Vassilios S. Verykios, and Peter Christen. 2012. Fake injection strategies for private phonetic matching. In Data Privacy Management and Autonomous Spontaneous Security. Springer, Berlin, 9\u201324."},{"key":"e_1_3_3_32_2","doi-asserted-by":"crossref","unstructured":"Dimitrios Karapiperis Aris Gkoulalas-Divanis and Vassilios S. Verykios. 2017. Distance-aware encoding of numerical values for privacy-preserving record linkage. International Conference on Data Engineering (ICDE\u201917) . IEEE 135\u2013138.","DOI":"10.1109\/ICDE.2017.58"},{"issue":"1","key":"e_1_3_3_33_2","article-title":"Data linkage protocols using a statistical linkage key","author":"Karmel Rosemary","year":"2005","unstructured":"Rosemary Karmel. 2005. Data linkage protocols using a statistical linkage key. Australian Institute of Health and WelfareCS1 (2005).","journal-title":"Australian Institute of Health and Welfare"},{"key":"e_1_3_3_34_2","doi-asserted-by":"crossref","DOI":"10.1201\/9781420010756","volume-title":"Introduction to Modern Cryptography","author":"Katz Jonathan","year":"2007","unstructured":"Jonathan Katz and Yehuda Lindell. 2007. Introduction to Modern Cryptography. CRC Press."},{"key":"e_1_3_3_35_2","doi-asserted-by":"crossref","unstructured":"Martin Kroll and Steinmetzer Steinmetzer. 2015. Automated cryptanalysis of Bloom filter encryptions of databases with several personal identifiers. Biomedical Engineering Systems and Technologies (BIOSTEC\u201915) . Springer 341\u2013356.","DOI":"10.1007\/978-3-319-27707-3_21"},{"key":"e_1_3_3_36_2","doi-asserted-by":"crossref","unstructured":"Mehmet Kuzu Murat Kantarcioglu Elizabeth Durham and Bradley Malin. 2011. A constraint satisfaction cryptanalysis of Bloom filters in private record linkage. Privacy Enhancing Technologies (PETS\u201911) . Springer 226\u2013245.","DOI":"10.1007\/978-3-642-22263-4_13"},{"issue":"1","key":"e_1_3_3_37_2","doi-asserted-by":"crossref","first-page":"401","DOI":"10.3233\/SJI-200704","article-title":"Random disclosure in confidential statistical databases","volume":"37","author":"Lenz Rainer","year":"2021","unstructured":"Rainer Lenz and Tim Hochg\u00fcrtel. 2021. Random disclosure in confidential statistical databases. Statistical Journal of the IAOS 37, 1 (2021), 401\u2013413.","journal-title":"Statistical Journal of the IAOS"},{"issue":"8","key":"e_1_3_3_38_2","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"Levenshtein Vladimir I.","year":"1966","unstructured":"Vladimir I. Levenshtein. 1966. Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady 10, 8 (1966), 707\u2013710.","journal-title":"Soviet Physics Doklady"},{"key":"e_1_3_3_39_2","unstructured":"Ninghui Li Tiancheng Li and Suresh Venkatasubramanian. 2007. T-closeness: Privacy beyond k-anonymity and l-diversity. International Conference on Data Engineering (ICDE\u201907) . IEEE 106\u2013115."},{"key":"e_1_3_3_40_2","volume-title":"Differential Privacy: From Theory to Practice","author":"Li Ninghui","year":"2017","unstructured":"Ninghui Li, Min Lyu, Dong Su, and Weining Yang. 2017. Differential Privacy: From Theory to Practice. Morgan and Claypool Publishers."},{"issue":"1","key":"e_1_3_3_41_2","article-title":"L-diversity: Privacy beyond k-anonymity","volume":"1","author":"Machanavajjhala Ashwin","year":"2007","unstructured":"Ashwin Machanavajjhala, Daniel Kifer, Johannes Gehrke, and Muthuramakrishnan Venkitasubramaniam. 2007. L-diversity: Privacy beyond k-anonymity. ACM Transactions on Knowledge Discovery from Data 1, 1 (2007), 3\u2013es.","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"issue":"4","key":"e_1_3_3_42_2","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1504\/IJBDI.2017.086956","article-title":"A graph traversal attack on Bloom filter-based medical data aggregation","volume":"4","author":"Mitchell William","year":"2017","unstructured":"William Mitchell, Rinku Dewri, Ramakrishna Thurimella, and Max Roschke. 2017. A graph traversal attack on Bloom filter-based medical data aggregation. International Journal of Big Data Intelligence 4, 4 (2017), 217\u2013226.","journal-title":"International Journal of Big Data Intelligence"},{"issue":"4","key":"e_1_3_3_43_2","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/s00778-010-0214-6","article-title":"Anonymity meets game theory: Secure data integration with malicious participants","volume":"20","author":"Mohammed Noman","year":"2011","unstructured":"Noman Mohammed, Benjamin C. M. Fung, and Mourad Debbabi. 2011. Anonymity meets game theory: Secure data integration with malicious participants. International Journal on Very Large Data Bases 20, 4 (2011), 567\u2013588.","journal-title":"International Journal on Very Large Data Bases"},{"issue":"2","key":"e_1_3_3_44_2","first-page":"59","article-title":"Cryptanalysis of basic Bloom filters used for privacy preserving record linkage","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. Journal of Privacy and Confidentiality 6, 2 (2014), 59\u201379.","journal-title":"Journal of Privacy and Confidentiality"},{"key":"e_1_3_3_45_2","doi-asserted-by":"crossref","unstructured":"Thilina Ranbaduge Peter Christen and Rainer Schnell. 2020. Secure and accurate two-step hash encoding for privacy-preserving record linkage. Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD\u201920) . Springer 139\u2013151.","DOI":"10.1007\/978-3-030-47436-2_11"},{"key":"e_1_3_3_46_2","doi-asserted-by":"crossref","unstructured":"Thilina Ranbaduge and Rainer Schnell. 2020. Securing Bloom filters for privacy-preserving record linkage. International Conference on Information and Knowledge Management (CIKM\u201920) . ACM 2185\u20132188.","DOI":"10.1145\/3340531.3412105"},{"issue":"328","key":"e_1_3_3_47_2","article-title":"A Theory for Record Linkage","volume":"64","author":"Fellegi Ivan P.","year":"1969","unstructured":"Ivan P. Fellegi and Alan B. Sunter. 1969. A Theory for Record Linkage. Journal of the American Statistical Association 64, 328 (1969), 1183\u20131210.","journal-title":"Journal of the American Statistical Association"},{"issue":"1","key":"e_1_3_3_48_2","first-page":"1","article-title":"A blinded evaluation of privacy preserving record linkage with Bloom filters","volume":"22","author":"Randall Sean","year":"2022","unstructured":"Sean Randall, Helen Wichmann, Adrian Brown, James Boyd, Tom Eitelhuber, Alexandra Merchant, and Anna Ferrante. 2022. A blinded evaluation of privacy preserving record linkage with Bloom filters. BMC Medical Research Methodology 22, 1 (2022), 1\u20137.","journal-title":"BMC Medical Research Methodology"},{"key":"e_1_3_3_49_2","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.jbi.2013.12.003","article-title":"Privacy-preserving record linkage on large real world datasets","volume":"50","author":"Randall Sean M.","year":"2014","unstructured":"Sean M. Randall, Anna M. Ferrante, James H. Boyd, Jacqueline K. Bauer, and James B. Semmens. 2014. Privacy-preserving record linkage on large real world datasets. Journal of Biomedical Informatics 50 (2014), 205\u2013212.","journal-title":"Journal of Biomedical Informatics"},{"key":"e_1_3_3_50_2","volume-title":"Applied Cryptography: Protocols, Algorithms, and Source Code in C (2nd ed.)","author":"Schneier Bruce","year":"1996","unstructured":"Bruce Schneier. 1996. Applied Cryptography: Protocols, Algorithms, and Source Code in C (2nd ed.). John Wiley & Sons, New York, NY."},{"key":"e_1_3_3_51_2","article-title":"Privacy-preserving record linkage using Bloom filters","author":"Schnell Rainer","year":"2009","unstructured":"Rainer Schnell, Tobias Bachteler, and J\u00f6rg Reiher. 2009. Privacy-preserving record linkage using Bloom filters. Medical Informatics and Decision Making 9, 41 (2009), 1\u201311.","journal-title":"Medical Informatics and Decision Making"},{"key":"e_1_3_3_52_2","article-title":"A novel error-tolerant anonymous linking code","author":"Schnell Rainer","year":"2011","unstructured":"Rainer Schnell, Tobias Bachteler, and J\u00f6rg Reiher. 2011. A novel error-tolerant anonymous linking code. SSRN Electronic Journal (2011).","journal-title":"SSRN Electronic Journal"},{"key":"e_1_3_3_53_2","first-page":"218","volume-title":"International Conference on Data Mining Workshops (ICDMW\u201916)","author":"Schnell Rainer","year":"2016","unstructured":"Rainer Schnell and Christian Borgs. 2016. Randomized response and balanced Bloom filters for privacy preserving record linkage. In International Conference on Data Mining Workshops (ICDMW\u201916). 218\u2013224."},{"key":"e_1_3_3_54_2","article-title":"XOR-folding for Bloom filter-based encryptions for privacy-preserving record linkage","author":"Schnell Rainer","year":"2016","unstructured":"Rainer Schnell and Christian Borgs. 2016. XOR-folding for Bloom filter-based encryptions for privacy-preserving record linkage. SSRN Electronic Journal (January2016).","journal-title":"SSRN Electronic Journal"},{"key":"e_1_3_3_55_2","doi-asserted-by":"crossref","unstructured":"Rainer Schnell and Christian Borgs. 2020. Encoding hierarchical classification codes for privacy-preserving record linkage using Bloom filters. Machine Learning and Knowledge Discovery in Databases (ECML PKDD\u201920) Peggy Cellier and Kurt Driessens (Eds.). Springer International Publishing 142\u2013156.","DOI":"10.1007\/978-3-030-43887-6_12"},{"key":"e_1_3_3_56_2","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/j.jisa.2017.01.002","article-title":"Secure pseudonymisation for privacy-preserving probabilistic record linkage","volume":"34","author":"Smith Duncan","year":"2017","unstructured":"Duncan Smith. 2017. Secure pseudonymisation for privacy-preserving probabilistic record linkage. Journal of Information Security and Applications 34 (2017), 271\u2013279.","journal-title":"Journal of Information Security and Applications"},{"issue":"5","key":"e_1_3_3_57_2","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1142\/S0218488502001648","article-title":"K-anonymity: A model for protecting privacy","volume":"10","author":"Sweeney Latanya","year":"2002","unstructured":"Latanya Sweeney. 2002. K-anonymity: A model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems 10, 5 (2002), 557\u2013570.","journal-title":"International Journal on Uncertainty, Fuzziness and Knowledge-based Systems"},{"issue":"25","key":"e_1_3_3_58_2","doi-asserted-by":"crossref","first-page":"3693","DOI":"10.1002\/sim.7667","article-title":"A tutorial in assessing disclosure risk in microdata","volume":"37","author":"Taylor Leslie","year":"2018","unstructured":"Leslie Taylor, Xiao-Hua Zhou, and Peter Rise. 2018. A tutorial in assessing disclosure risk in microdata. Stat. Med. 37, 25 (2018), 3693\u20133706.","journal-title":"Stat. Med."},{"key":"e_1_3_3_59_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-50272-4","volume-title":"Statistical Disclosure Control for Microdata: Methods and Applications in R","author":"Templ Matthias","year":"2017","unstructured":"Matthias Templ. 2017. Statistical Disclosure Control for Microdata: Methods and Applications in R. Springer."},{"key":"e_1_3_3_60_2","doi-asserted-by":"crossref","unstructured":"Traian Truta Farshad Fotouhi and Daniel Barth-Jones. 2003. Disclosure risk measures for microdata. International Conference on Scientific and Statistical Database Management (SSDBM\u201903) . IEEE 15\u201322.","DOI":"10.1109\/SSDM.2003.1214948"},{"key":"e_1_3_3_61_2","unstructured":"Traian Marius Truta and Bindu Vinay. 2006. Privacy protection: P-Sensitive k-anonymity property. International Conference on Data Engineering Workshops (ICDEW\u201906) . IEEE 94\u201394."},{"key":"e_1_3_3_62_2","unstructured":"UK Office for National Statistics. 2013. Beyond 2011 Matching Anonymous Data. Methods and Policies Report M9."},{"key":"e_1_3_3_63_2","first-page":"189","volume-title":"Australasian Data Mining Conference (AusDM\u201919), CRPIT","author":"Vaiwsri Sirintra","year":"2019","unstructured":"Sirintra Vaiwsri, Thilina Ranbaduge, and Peter Christen. 2019. Reference values based hardening for Bloom filters based privacy-preserving record linkage. In Australasian Data Mining Conference (AusDM\u201919), CRPIT. Springer, 189\u2013202."},{"issue":"1","key":"e_1_3_3_64_2","first-page":"35","article-title":"An evaluation framework for privacy-preserving record linkage","volume":"6","author":"Vatsalan Dinusha","year":"2014","unstructured":"Dinusha Vatsalan, Peter Christen, Christine M. O\u2019Keefe, and Vassilios S. Verykios. 2014. An evaluation framework for privacy-preserving record linkage. Journal of Privacy and Confidentiality 6, 1 (2014), 35\u201375.","journal-title":"Journal of Privacy and Confidentiality"},{"key":"e_1_3_3_65_2","doi-asserted-by":"crossref","unstructured":"Dinusha Vatsalan Peter Christen and Erhard Rahm. 2016. Scalable privacy-preserving linking of multiple databases using counting Bloom filters. International Conference on Data Mining Workshops (ICDMW\u201916) . IEEE 882\u2013889.","DOI":"10.1109\/ICDMW.2016.0130"},{"issue":"6","key":"e_1_3_3_66_2","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1016\/j.is.2012.11.005","article-title":"A taxonomy of privacy-preserving record linkage techniques","volume":"38","author":"Vatsalan Dinusha","year":"2013","unstructured":"Dinusha Vatsalan, Peter Christen, and Vassilios S. Verykios. 2013. A taxonomy of privacy-preserving record linkage techniques. Information Systems 38, 6 (2013), 946\u2013969.","journal-title":"Information Systems"},{"key":"e_1_3_3_67_2","doi-asserted-by":"crossref","unstructured":"Anushka Vidanage Peter Christen Thilina Ranbaduge and Rainer Schnell. 2020. A graph matching attack on privacy-preserving record linkage. International Conference on Information and Knowledge Management (CIKM\u201920) . ACM 1485\u20131494.","DOI":"10.1145\/3340531.3411931"},{"issue":"1","key":"e_1_3_3_68_2","first-page":"13","article-title":"A privacy attack on multiple dynamic match-key based privacy-preserving record linkage","volume":"5","author":"Vidanage Anushka","year":"2020","unstructured":"Anushka Vidanage, Thilina Ranbaduge, Peter Christen, and Sean Randall. 2020. A privacy attack on multiple dynamic match-key based privacy-preserving record linkage. International Journal of Population Data Science 5, 1 (2020), 13 pages.","journal-title":"International Journal of Population Data Science"},{"key":"e_1_3_3_69_2","doi-asserted-by":"crossref","unstructured":"Anushka Vidanage Thilina Ranbaduge Peter Christen and Rainer Schnell. 2019. Efficient pattern mining based cryptanalysis for privacy-preserving record linkage. International Conference on Data Engineering (ICDE\u201919) . IEEE 1698\u20131701.","DOI":"10.1109\/ICDE.2019.00176"},{"issue":"1","key":"e_1_3_3_70_2","first-page":"35","article-title":"A taxonomy of attacks on privacy-preserving record linkage","volume":"12","author":"Vidanage Anushka","year":"2022","unstructured":"Anushka Vidanage, Thilina Ranbaduge, Peter Christen, and Rainer Schnell. 2022. A taxonomy of attacks on privacy-preserving record linkage. Journal of Privacy and Confidentiality 12, 1 (2022), 35 pages.","journal-title":"Journal of Privacy and Confidentiality"},{"key":"e_1_3_3_71_2","first-page":"1945","article-title":"An enhanced k-anonymity model against homogeneity attack","volume":"6","author":"Wang Qian","year":"2011","unstructured":"Qian Wang, Zhiwei Xu, and Shengzhi Qu. 2011. An enhanced k-anonymity model against homogeneity attack. Journal of Software 6 (2011), 1945\u20131952.","journal-title":"Journal of Software"},{"issue":"309","key":"e_1_3_3_72_2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/01621459.1965.10480775","article-title":"Randomized response: A survey technique for eliminating evasive answer bias","volume":"60","author":"Warner Stanley L.","year":"1965","unstructured":"Stanley L. Warner. 1965. Randomized response: A survey technique for eliminating evasive answer bias. Journal of the American Statistical Association 60, 309 (1965), 63\u201366.","journal-title":"Journal of the American Statistical Association"}],"container-title":["ACM Transactions on Privacy and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589641","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3589641","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:45Z","timestamp":1750291425000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589641"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,27]]},"references-count":71,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,8,30]]}},"alternative-id":["10.1145\/3589641"],"URL":"https:\/\/doi.org\/10.1145\/3589641","relation":{},"ISSN":["2471-2566","2471-2574"],"issn-type":[{"value":"2471-2566","type":"print"},{"value":"2471-2574","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,27]]},"assertion":[{"value":"2022-02-27","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-03-13","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-06-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}