{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T04:36:51Z","timestamp":1777869411640,"version":"3.51.4"},"reference-count":83,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T00:00:00Z","timestamp":1774656000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100022943","name":"Universities Australia","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100022943","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001655","name":"German Academic Exchange Service","doi-asserted-by":"publisher","award":["57559735"],"award-info":[{"award-number":["57559735"]}],"id":[{"id":"10.13039\/501100001655","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001655","name":"German Academic Exchange Service","doi-asserted-by":"publisher","award":["57701258"],"award-info":[{"award-number":["57701258"]}],"id":[{"id":"10.13039\/501100001655","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Systems"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.is.2026.102726","type":"journal-article","created":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T07:28:17Z","timestamp":1774682897000},"page":"102726","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The use of differential privacy for privacy-preserving record linkage: Protecting the bits but not the people"],"prefix":"10.1016","volume":"140","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-5844-0111","authenticated-orcid":false,"given":"Sumayya","family":"Ziyad","sequence":"first","affiliation":[]},{"given":"Peter","family":"Christen","sequence":"additional","affiliation":[]},{"given":"Rainer","family":"Schnell","sequence":"additional","affiliation":[]},{"given":"Lucas","family":"Lange","sequence":"additional","affiliation":[]},{"given":"Anushka","family":"Vidanage","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.is.2026.102726_b1","series-title":"Data Matching \u2013 Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection","author":"Christen","year":"2012"},{"key":"10.1016\/j.is.2026.102726_b2","series-title":"Linking Sensitive Data","author":"Christen","year":"2020"},{"key":"10.1016\/j.is.2026.102726_b3","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","year":"2021","journal-title":"Trans. Inf. Forensics Secur."},{"key":"10.1016\/j.is.2026.102726_b4","series-title":"Medical Data Privacy Handbook","first-page":"267","article-title":"Application of privacy-preserving techniques in operational record linkage centres","author":"Boyd","year":"2015"},{"issue":"1","key":"10.1016\/j.is.2026.102726_b5","first-page":"5","article-title":"Secure multiparty computation for privacy-preserving data mining","volume":"1","author":"Lindell","year":"2009","journal-title":"J. Priv. Confidentiality"},{"key":"10.1016\/j.is.2026.102726_b6","series-title":"Handbook of Big Data Technologies","first-page":"851","article-title":"Privacy-preserving record linkage for Big Data: Current approaches and research challenges","author":"Vatsalan","year":"2017"},{"key":"10.1016\/j.is.2026.102726_b7","series-title":"Privacy, Security and Trust","first-page":"1","article-title":"Privacy preserving probabilistic record linkage without trusted third party","author":"Lazrig","year":"2018"},{"key":"10.1016\/j.is.2026.102726_b8","series-title":"Conference on Extending Database Technology","first-page":"123","article-title":"Private record matching using differential privacy","author":"Inan","year":"2010"},{"key":"10.1016\/j.is.2026.102726_b9","series-title":"International Conference on Data Engineering","first-page":"1011","article-title":"A hybrid private record linkage scheme: Separating differentially private synopses from matching records","author":"Cao","year":"2015"},{"issue":"1","key":"10.1016\/j.is.2026.102726_b10","article-title":"Privacy-preserving record linkage using Bloom filters","volume":"9","author":"Schnell","year":"2009","journal-title":"Med. Informatics Decis. Mak."},{"issue":"3","key":"10.1016\/j.is.2026.102726_b11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3589641","article-title":"A vulnerability assessment framework for privacy-preserving record linkage","volume":"26","author":"Vidanage","year":"2023","journal-title":"Trans. Priv. Secur."},{"issue":"1","key":"10.1016\/j.is.2026.102726_b12","article-title":"Taxonomy of attacks on privacy-preserving record linkage","volume":"12","author":"Vidanage","year":"2022","journal-title":"J. Priv. Confidentiality"},{"key":"10.1016\/j.is.2026.102726_b13","series-title":"Workshop on Data Integration and Applications","first-page":"218","article-title":"Randomized response and balanced Bloom filters for privacy preserving record linkage","author":"Schnell","year":"2016"},{"key":"10.1016\/j.is.2026.102726_b14","series-title":"Theory of Cryptography","first-page":"265","article-title":"Calibrating noise to sensitivity in private data analysis","author":"Dwork","year":"2006"},{"key":"10.1016\/j.is.2026.102726_b15","series-title":"Advanced Research in Data Privacy","first-page":"41","article-title":"A review of attribute disclosure control","author":"Matwin","year":"2015"},{"key":"10.1016\/j.is.2026.102726_b16","series-title":"Conference on Computer and Communications Security","first-page":"1389","article-title":"Composing differential privacy and secure computation: A case study on scaling private record linkage","author":"He","year":"2017"},{"issue":"1","key":"10.1016\/j.is.2026.102726_b17","article-title":"Differential Privacy and Social Science: An Urgent Puzzle","volume":"2","author":"Oberski","year":"2020","journal-title":"Harv. Data Sci. Rev."},{"key":"10.1016\/j.is.2026.102726_b18","series-title":"The Structure of Scientific Revolutions","author":"Kuhn","year":"1996"},{"key":"10.1016\/j.is.2026.102726_b19","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1093\/jrssig\/qmag008","article-title":"Mismatches and missed matches: Why mislinked data can mislead public health studies","volume":"23","author":"Kamat","year":"2026","journal-title":"Significance"},{"issue":"3","key":"10.1016\/j.is.2026.102726_b20","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1007\/s10940-020-09461-x","article-title":"Dude, where\u2019s my treatment effect? Errors in administrative data linking and the destruction of statistical power in randomized experiments","volume":"37","author":"Tahamont","year":"2021","journal-title":"J. Quant. Criminol."},{"key":"10.1016\/j.is.2026.102726_b21","series-title":"Towards an approach for evaluating the impact of AI standards the use case of entity resolution (2506.13839)","author":"Lane","year":"2025"},{"key":"10.1016\/j.is.2026.102726_b22","unstructured":"M.D. Larsen, Record Linkage, Nondisclosure, Counterterrorism, and Statistics, in: Survey Methods Section, Canadian Statistical Society, London, 2006."},{"key":"10.1016\/j.is.2026.102726_b23","series-title":"Security, Audit and Control","first-page":"1054","article-title":"RAPPOR: Randomized aggregatable privacy-preserving ordinal response","author":"Erlingsson","year":"2014"},{"key":"10.1016\/j.is.2026.102726_b24","doi-asserted-by":"crossref","DOI":"10.1016\/j.is.2026.102720","article-title":"Information leakage in the practical linking of sensitive data: Parties, protocols, and adversaries","author":"Christen","year":"2026","journal-title":"Inf. Syst."},{"key":"10.1016\/j.is.2026.102726_b25","unstructured":"K. Nissim, T. Steinke, A. Wood, M. Altman, A. Bembenek, M. Bun, M. Gaboardi, D.R. O\u2019Brien, S. Vadhan, Differential privacy: A primer for a non-technical audience, in: Privacy Law Scholars Conference, Berkeley, 2017."},{"issue":"3\u20134","key":"10.1016\/j.is.2026.102726_b26","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1561\/0400000042","article-title":"The algorithmic foundations of differential privacy","volume":"9","author":"Dwork","year":"2014","journal-title":"Found. Trends Theor. Comput. Sci."},{"issue":"5","key":"10.1016\/j.is.2026.102726_b27","doi-asserted-by":"crossref","DOI":"10.3390\/s25051358","article-title":"Analysis, design, and implementation of a user-friendly differential privacy application","volume":"25","author":"Tjhin","year":"2025","journal-title":"Sensors","ISSN":"https:\/\/id.crossref.org\/issn\/1424-8220","issn-type":"print"},{"key":"10.1016\/j.is.2026.102726_b28","doi-asserted-by":"crossref","unstructured":"\u00da. Erlingsson, V. Feldman, I. Mironov, A. Raghunathan, K. Talwar, A. Thakurta, Amplification by shuffling: from local to central differential privacy via anonymity, in: ACM-SIAM Symposium on Discrete Algorithms, San Diego, 2019, pp. 2468\u20132479.","DOI":"10.1137\/1.9781611975482.151"},{"key":"10.1016\/j.is.2026.102726_b29","series-title":"Stabilization, Safety, and Security of Distributed Systems","first-page":"202","article-title":"BLIP: Non-interactive differentially-private similarity computation on bloom filters","author":"Alaggan","year":"2012"},{"key":"10.1016\/j.is.2026.102726_b30","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-01835-0","article-title":"An introduction to duplicate detection","author":"Naumann","year":"2010"},{"key":"10.1016\/j.is.2026.102726_b31","series-title":"Data Quality and Record Linkage Techniques","author":"Herzog","year":"2007"},{"issue":"12","key":"10.1016\/j.is.2026.102726_b32","doi-asserted-by":"crossref","first-page":"1412","DOI":"10.2105\/AJPH.36.12.1412","article-title":"Record linkage","volume":"36","author":"Dunn","year":"1946","journal-title":"Am. J. Public Health"},{"issue":"328","key":"10.1016\/j.is.2026.102726_b33","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1080\/01621459.1969.10501049","article-title":"A theory for record linkage","volume":"64","author":"Fellegi","year":"1969","journal-title":"J. Amer. Statist. Assoc."},{"issue":"12","key":"10.1016\/j.is.2026.102726_b34","doi-asserted-by":"crossref","first-page":"eabi8021","DOI":"10.1126\/sciadv.abi8021","article-title":"(Almost) all of entity resolution","volume":"8","author":"Binette","year":"2022","journal-title":"Sci. Adv."},{"issue":"9","key":"10.1016\/j.is.2026.102726_b35","doi-asserted-by":"crossref","first-page":"1537","DOI":"10.1109\/TKDE.2011.127","article-title":"A survey of indexing techniques for scalable record linkage and deduplication","volume":"24","author":"Christen","year":"2012","journal-title":"Trans. Knowl. Data Eng."},{"issue":"9","key":"10.1016\/j.is.2026.102726_b36","doi-asserted-by":"crossref","first-page":"684","DOI":"10.14778\/2947618.2947624","article-title":"Comparative analysis of approximate blocking techniques for entity resolution","volume":"9","author":"Papadakis","year":"2016","journal-title":"VLDB Endow."},{"key":"10.1016\/j.is.2026.102726_b37","series-title":"Symposium on Theory of Computing","first-page":"604","article-title":"Approximate nearest neighbors: towards removing the curse of dimensionality","author":"Indyk","year":"1998"},{"key":"10.1016\/j.is.2026.102726_b38","series-title":"Conference on Information & Knowledge Management","first-page":"4354","article-title":"Locality sensitive hashing with temporal and spatial constraints for efficient population record linkage","author":"Nanayakkara","year":"2022"},{"key":"10.1016\/j.is.2026.102726_b39","doi-asserted-by":"crossref","first-page":"2644","DOI":"10.1109\/TIFS.2022.3191492","article-title":"Fairness and Cost Constrained Privacy-Aware Record Linkage","volume":"17","author":"Wu","year":"2022","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10.1016\/j.is.2026.102726_b40","series-title":"Conference on Extending Database Technology","first-page":"167","article-title":"Efficient privacy-aware record integration","author":"Kuzu","year":"2013"},{"issue":"1","key":"10.1016\/j.is.2026.102726_b41","article-title":"Privacy preserving linkage using multiple dynamic match keys","volume":"4","author":"Randall","year":"2019","journal-title":"Int. J. Popul. Data Sci."},{"key":"10.1016\/j.is.2026.102726_b42","first-page":"ocaf172","article-title":"A novel analysis methodology for assessment of re-identification risks for the national cancer institute cancer registry privacy preserving record linkage technique","author":"Kantarcioglu","year":"2025","journal-title":"J. Am. Med. Informat. Assoc."},{"key":"10.1016\/j.is.2026.102726_b43","first-page":"271","article-title":"Secure pseudonymisation for privacy-preserving probabilistic record linkage","volume":"34","author":"Smith","year":"2017","journal-title":"J. Inf. Secur. Appl."},{"key":"10.1016\/j.is.2026.102726_b44","series-title":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","first-page":"139","article-title":"Secure and accurate two-step hash encoding for privacy-preserving record linkage","author":"Ranbaduge","year":"2020"},{"key":"10.1016\/j.is.2026.102726_b45","article-title":"Privacy-preserving record linkage using reference set based encoding: A single parameter method","volume":"113","author":"Ziyad","year":"2025","journal-title":"Inf. Syst."},{"issue":"3","key":"10.1016\/j.is.2026.102726_b46","article-title":"Neural networks for entity matching: A survey","volume":"15","author":"Barlaug","year":"2021","journal-title":"Trans. Knowl. Discov. from Data"},{"issue":"12","key":"10.1016\/j.is.2026.102726_b47","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.14778\/2994509.2994535","article-title":"Magellan: Toward building entity matching management systems","volume":"9","author":"Konda","year":"2016","journal-title":"VLDB Endow."},{"issue":"11","key":"10.1016\/j.is.2026.102726_b48","doi-asserted-by":"crossref","first-page":"6839","DOI":"10.1109\/TKDE.2023.3342757","article-title":"Privacy-preserving deep learning based record linkage","volume":"36","author":"Ranbaduge","year":"2023","journal-title":"Trans. Knowl. Data Eng."},{"issue":"6","key":"10.1016\/j.is.2026.102726_b49","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","year":"2013","journal-title":"Inf. Syst."},{"issue":"1","key":"10.1016\/j.is.2026.102726_b50","article-title":"A privacy attack on multiple dynamic match-key based privacy-preserving record linkage","volume":"5","author":"Vidanage","year":"2020","journal-title":"Int. J. Popul. Data Sci."},{"key":"10.1016\/j.is.2026.102726_b51","series-title":"Conference on Information and Knowledge Management","first-page":"2185","article-title":"Securing bloom filters for privacy-preserving record linkage","author":"Ranbaduge","year":"2020"},{"key":"10.1016\/j.is.2026.102726_b52","series-title":"EDBT","first-page":"289","article-title":"Evaluation of hardening techniques for privacy-preserving record linkage.","author":"Franke","year":"2021"},{"key":"10.1016\/j.is.2026.102726_b53","series-title":"Conference on Information and Knowledge Management","first-page":"4582","article-title":"Vulnerability-aware hardening for secure privacy-preserving record linkage","author":"Ziyad","year":"2025"},{"key":"10.1016\/j.is.2026.102726_b54","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/j.jbi.2015.12.004","article-title":"Privacy-preserving matching of similar patients","volume":"59","author":"Vatsalan","year":"2016","journal-title":"J. Biomed. Informat."},{"issue":"2","key":"10.1016\/j.is.2026.102726_b55","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1109\/TKDE.2017.2761759","article-title":"FEDERAL: A framework for distance-aware privacy-preserving record linkage","volume":"30","author":"Karapiperis","year":"2017","journal-title":"Trans. Knowl. Data Eng."},{"key":"10.1016\/j.is.2026.102726_b56","series-title":"Conference on Information and Knowledge Management","first-page":"1263","article-title":"Randomized bit vector: Privacy-preserving encoding mechanism","author":"Sun","year":"2018"},{"key":"10.1016\/j.is.2026.102726_b57","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1186\/s12942-021-00268-y","article-title":"Locational privacy-preserving distance computations with intersecting sets of randomly labeled grid points","volume":"20","author":"Schnell","year":"2021","journal-title":"Int. J. Health Geogr."},{"key":"10.1016\/j.is.2026.102726_b58","series-title":"Workshop on Data Integration and Applications, Held At ECML\/PKDD","first-page":"142","article-title":"Encoding hierarchical classification codes for privacy-preserving record linkage using bloom filters","author":"Schnell","year":"2019"},{"issue":"2","key":"10.1016\/j.is.2026.102726_b59","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3377455","article-title":"Blocking and filtering techniques for entity resolution: A survey","volume":"53","author":"Papadakis","year":"2020","journal-title":"Comput. Surv."},{"key":"10.1016\/j.is.2026.102726_b60","series-title":"International Conference on Data Mining","first-page":"1161","article-title":"Scalable block scheduling for efficient multi-database record linkage","author":"Ranbaduge","year":"2016"},{"key":"10.1016\/j.is.2026.102726_b61","series-title":"Theory and Application of Cryptographic Techniques","first-page":"223","article-title":"Public-key cryptosystems based on composite degree residuosity classes","author":"Paillier","year":"1999"},{"issue":"3","key":"10.1016\/j.is.2026.102726_b62","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3318462","article-title":"Hybrid private record linkage: Separating differentially private synopses from matching records","volume":"22","author":"Rao","year":"2019","journal-title":"Trans. Priv. Secur."},{"key":"10.1016\/j.is.2026.102726_b63","series-title":"Conference on Information and Knowledge Management","first-page":"1597","article-title":"Frequent grams based embedding for privacy preserving record linkage","author":"Bonomi","year":"2012"},{"key":"10.1016\/j.is.2026.102726_b64","series-title":"Australasian Data Mining Conference","first-page":"189","article-title":"Reference values based hardening for Bloom filters based privacy-preserving record linkage","author":"Vaiwsri","year":"2018"},{"key":"10.1016\/j.is.2026.102726_b65","article-title":"Hybrid framework of differential privacy and secure multi-party computation for privacy-preserving entity resolution","volume":"157","author":"Dorgbefu","year":"2025","journal-title":"Comput. Secur."},{"key":"10.1016\/j.is.2026.102726_b66","doi-asserted-by":"crossref","DOI":"10.1016\/j.ijmedinf.2024.105582","article-title":"Implementing privacy preserving record linkage: Insights from Australian use cases","volume":"191","author":"Randall","year":"2024","journal-title":"Int. J. Med. Informatics"},{"key":"10.1016\/j.is.2026.102726_b67","doi-asserted-by":"crossref","unstructured":"M. Kuzu, M. Kantarcioglu, E. Durham, B. Malin, A Constraint Satisfaction Cryptanalysis of Bloom Filters in Private Record Linkage, in: Privacy Enhancing Technologies Symposium, Waterloo, Canada, 2011, pp. 226\u2013245.","DOI":"10.1007\/978-3-642-22263-4_13"},{"issue":"2","key":"10.1016\/j.is.2026.102726_b68","first-page":"59","article-title":"Cryptanalysis of basic Bloom filters used for privacy preserving record linkage","volume":"6","author":"Niedermeyer","year":"2014","journal-title":"J. Priv. Confidentiality"},{"issue":"309","key":"10.1016\/j.is.2026.102726_b69","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","year":"1965","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/j.is.2026.102726_b70","series-title":"Asia Conference on Computer and Communications Security","first-page":"53","article-title":"Privacy-preserving record linkage for cardinality counting","author":"Wu","year":"2023"},{"key":"10.1016\/j.is.2026.102726_b71","doi-asserted-by":"crossref","DOI":"10.1016\/j.cosrev.2023.100567","article-title":"Private set intersection: A systematic literature review","volume":"49","author":"Morales","year":"2023","journal-title":"Comput. Sci. Rev.","ISSN":"https:\/\/id.crossref.org\/issn\/1574-0137","issn-type":"print"},{"key":"10.1016\/j.is.2026.102726_b72","series-title":"International Conference on Data Engineering","first-page":"496","article-title":"A hybrid approach to private record linkage","author":"Inan","year":"2008"},{"key":"10.1016\/j.is.2026.102726_b73","series-title":"Conference on Knowledge Discovery and Data Mining","first-page":"527","article-title":"Scalable blocking for privacy preserving record linkage","author":"Karakasidis","year":"2015"},{"key":"10.1016\/j.is.2026.102726_b74","series-title":"PPRL: Privacy preserving record linkage","author":"Schnell","year":"2022"},{"issue":"6","key":"10.1016\/j.is.2026.102726_b75","article-title":"Private record linkage with linkage maps","volume":"5","author":"Patel","year":"2022","journal-title":"Secur. Priv."},{"key":"10.1016\/j.is.2026.102726_b76","series-title":"Preparation of a real temporal voter data set for record linkage and duplicate detection research","author":"Christen","year":"2014"},{"key":"10.1016\/j.is.2026.102726_b77","doi-asserted-by":"crossref","unstructured":"A. Vidanage, T. Ranbaduge, P. Christen, R. Schnell, Efficient Pattern Mining based Cryptanalysis for Privacy-Preserving Record Linkage, in: IEEE International Conference on Data Engineering, Macau, 2019, pp. 1698\u20131701.","DOI":"10.1109\/ICDE.2019.00176"},{"key":"10.1016\/j.is.2026.102726_b78","series-title":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","first-page":"628","article-title":"Efficient cryptanalysis of Bloom filters for privacy-preserving record linkage","author":"Christen","year":"2017"},{"key":"10.1016\/j.is.2026.102726_b79","doi-asserted-by":"crossref","unstructured":"A. Vidanage, P. Christen, T. Ranbaduge, R. Schnell, A Graph Matching Attack on Privacy-Preserving Record Linkage, in: ACM Conference on Information and Knowledge Management, Galway, 2020, pp. 1485\u20131494.","DOI":"10.1145\/3340531.3411931"},{"issue":"1","key":"10.1016\/j.is.2026.102726_b80","article-title":"Thirty-three myths and misconceptions about population data: from data capture and processing to linkage","volume":"8","author":"Christen","year":"2023","journal-title":"Int. J. Popul. Data Sci."},{"key":"10.1016\/j.is.2026.102726_b81","doi-asserted-by":"crossref","unstructured":"J. Fisher, P. Christen, Q. Wang, E. Rahm, A clustering-based framework to control block sizes for entity resolution, in: ACM Conference on Knowledge Discovery and Data Mining, Sydney, 2015, pp. 279\u2013288.","DOI":"10.1145\/2783258.2783396"},{"key":"10.1016\/j.is.2026.102726_b82","doi-asserted-by":"crossref","unstructured":"T. Ranbaduge, D. Vatsalan, P. Christen, V.S. Verykios, Hashing-Based Distributed Multi-party Blocking for Privacy-Preserving Record Linkage, in: Pacific-Asia Conference on Knowledge Discovery and Data Mining, Auckland, 2016, pp. 415\u2013427.","DOI":"10.1007\/978-3-319-31750-2_33"},{"issue":"12","key":"10.1016\/j.is.2026.102726_b83","doi-asserted-by":"crossref","first-page":"1800","DOI":"10.3390\/math12121800","article-title":"A multi-party privacy-preserving record linkage method based on secondary encoding","volume":"12","author":"Han","year":"2024","journal-title":"Mathematics"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437926000402?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437926000402?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T13:42:17Z","timestamp":1777556537000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0306437926000402"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":83,"alternative-id":["S0306437926000402"],"URL":"https:\/\/doi.org\/10.1016\/j.is.2026.102726","relation":{"is-supplemented-by":[{"id-type":"uri","id":"https:\/\/github.com\/sumayyaziyad\/dp-for-pprl","asserted-by":"subject"}]},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The use of differential privacy for privacy-preserving record linkage: Protecting the bits but not the people","name":"articletitle","label":"Article Title"},{"value":"Information Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.is.2026.102726","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"102726"}}