{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,3]],"date-time":"2026-11-03T13:12:25Z","timestamp":1793711545711,"version":"4.6.1"},"reference-count":217,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tifs.2021.3114026","type":"journal-article","created":{"date-parts":[[2021,9,20]],"date-time":"2021-09-20T16:11:43Z","timestamp":1632154303000},"page":"4966-4987","source":"Crossref","is-referenced-by-count":69,"title":["Modern Privacy-Preserving Record Linkage Techniques: An Overview"],"prefix":"10.1109","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0011-6591","authenticated-orcid":false,"given":"Aris","family":"Gkoulalas-Divanis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6713-7667","authenticated-orcid":false,"given":"Dinusha","family":"Vatsalan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3878-5988","authenticated-orcid":false,"given":"Dimitrios","family":"Karapiperis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9795-9063","authenticated-orcid":false,"given":"Murat","family":"Kantarcioglu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref170","doi-asserted-by":"publisher","DOI":"10.1007\/s13222-016-0222-9"},{"key":"ref172","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2018.00053"},{"key":"ref171","article-title":"Scalable multi-database privacy-preserving record linkage using counting Bloom filters","author":"vatsalan","year":"2017","journal-title":"arXiv 1701 01232"},{"key":"ref174","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2761759"},{"key":"ref173","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-019-01370-1"},{"key":"ref176","first-page":"1","article-title":"Grouping methods for ongoing record linkage","author":"randall","year":"2015","journal-title":"Proc KDD Workshop Population Informat"},{"key":"ref175","doi-asserted-by":"publisher","DOI":"10.1055\/s-0038-1634494"},{"key":"ref178","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-27707-3_21"},{"key":"ref177","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-00305-0_19"},{"key":"ref168","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733098"},{"key":"ref169","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3530899"},{"key":"ref39","first-page":"94","article-title":"Privacy-preserving data linkage protocols","author":"\u00f3keefe","year":"2004","journal-title":"Proc ACM Workshop Privacy Electron Soc"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/S1386-5056(98)00019-7"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"ref32","article-title":"Privacy-preserving record linkage in the context of a national statistics institute","author":"schnell","year":"2020","journal-title":"Joined up Data Government Future Data Linking Methods"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49340-4_25"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2012.11.005"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1136\/amiajnl-2011-000329"},{"key":"ref35","first-page":"281","article-title":"Evaluation of the encryption procedure and record linkage in the Belgian national cancer registry","volume":"58","author":"van eycken","year":"2000","journal-title":"Arch Public Health"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"ref181","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412105"},{"key":"ref180","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93040-4_42"},{"key":"ref185","doi-asserted-by":"publisher","DOI":"10.23889\/ijpds.v4i1.1127"},{"key":"ref184","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2016.7867099"},{"key":"ref183","year":"2017","journal-title":"Anonlink Private Record Linkage System"},{"key":"ref182","first-page":"1105","article-title":"Soempi: A secure open enterprise master patient index software toolkit for private record linkage","author":"toth","year":"2014","journal-title":"Proc AMIA Annu Symp"},{"key":"ref189","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37456-2_29"},{"key":"ref188","doi-asserted-by":"publisher","DOI":"10.1145\/2245276.2245444"},{"key":"ref187","doi-asserted-by":"publisher","DOI":"10.3390\/s19051181"},{"key":"ref186","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v074.i11"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1186\/1472-6947-9-41"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.262"},{"key":"ref179","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2874004"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3549247"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/69.971193"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.5694\/j.1326-5377.2004.tb06052.x"},{"key":"ref21","first-page":"1","article-title":"Simple demographics often identify people uniquely","volume":"671","author":"sweeney","year":"2000","journal-title":"Health"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2018.2855125"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1093\/ije\/dyr142"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2017.10.008"},{"key":"ref25","year":"2013","journal-title":"Beyond 2011 Matching Anonymous Data Methods & Policies Report (M9)"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398480"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/BCI.2009.29"},{"key":"ref154","doi-asserted-by":"publisher","DOI":"10.1093\/jamiaopen\/ooz050"},{"key":"ref153","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23633-9_11"},{"key":"ref156","doi-asserted-by":"publisher","DOI":"10.14778\/3352063.3352076"},{"key":"ref155","doi-asserted-by":"publisher","DOI":"10.2196\/16757"},{"key":"ref150","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-57454-7_49"},{"key":"ref152","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00176"},{"key":"ref151","first-page":"1485","article-title":"A graph matching attack on privacy-preserving record linkage","author":"vidanage","year":"2020","journal-title":"Proc ACM Int Conf Inf Knowl Manag"},{"key":"ref146","first-page":"25","article-title":"Secure multi-party summation protocols: Are they secure enough under collusion?","volume":"13","author":"ranbaduge","year":"2020","journal-title":"Trans Data Privacy"},{"key":"ref147","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-47436-2_11"},{"key":"ref148","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.41"},{"key":"ref149","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19074-2_1"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1186\/1472-6947-4-9"},{"key":"ref58","first-page":"137","article-title":"Efficient record linakge in large data sets","author":"jin","year":"2003","journal-title":"Proc DASFAA"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/1005140.1005147"},{"key":"ref56","article-title":"Chffing and winnowing: Confidentiality without encryption","author":"rivest","year":"1998","journal-title":"CryptoBytes a technical newsletter of RSA Laboratories"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497458"},{"key":"ref54","first-page":"40","article-title":"A secure protocol for computing string distance metrics","author":"ravikumar","year":"2004","journal-title":"Proc PSDM"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/1077501.1077513"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00179-6_5"},{"key":"ref40","first-page":"286","article-title":"An efficient Bloom filter based solution for multiparty private matching","author":"lai","year":"2006","journal-title":"Proc Secur Manage"},{"key":"ref167","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93040-4_2"},{"key":"ref166","doi-asserted-by":"publisher","DOI":"10.1145\/3332165.3347866"},{"key":"ref165","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2508207"},{"key":"ref164","article-title":"Synthetic data generation using benerator tool","author":"ayala-rivera","year":"2013","journal-title":"arXiv 1311 3312"},{"key":"ref163","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.6121"},{"key":"ref162","doi-asserted-by":"publisher","DOI":"10.2196\/medinform.7744"},{"key":"ref161","doi-asserted-by":"publisher","DOI":"10.1186\/s12874-015-0038-6"},{"key":"ref160","author":"danziger","year":"2010","journal-title":"Big O–notation"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.2196\/15917"},{"key":"ref3","article-title":"End-to-end entity resolution for big data: A survey","author":"christophides","year":"2019","journal-title":"arXiv 1905 06397"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920898"},{"key":"ref5","article-title":"Record linkage innovations for the human services","author":"wiegand","year":"2019"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150463"},{"key":"ref159","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-66172-4_1"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556567"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.221"},{"key":"ref157","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2015.101"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.134"},{"key":"ref158","doi-asserted-by":"publisher","DOI":"10.1093\/jamia\/ocv038"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22263-4_13"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.91"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247553"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.29012\/jpc.v6i2.640"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87471-3_25"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/775107.775116"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1145\/1314333.1314346"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783290"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1145\/2452376.2452398"},{"key":"ref70","author":"kaufman","year":"1987","journal-title":"Reports of the Faculty of Mathematics and Informatics"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.2298\/CSIS140215040K"},{"key":"ref77","first-page":"518","article-title":"Similarity search in high dimensions via hashing","author":"gionis","year":"1999","journal-title":"Proc VLDB"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2349916"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1145\/2490257.2490258"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739104"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.127"},{"key":"ref60","article-title":"Finding Similar Items","author":"rajaraman","year":"2010","journal-title":"Mining of Massive Datasets[M]"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2012.70"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009761603038"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505757"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739059"},{"key":"ref65","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/11787006_1","volume":"4052","author":"dwork","year":"2006","journal-title":"Automata Languages and Programming"},{"key":"ref66","first-page":"194","article-title":"A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces","author":"weber","year":"1998","journal-title":"Proc VLDB"},{"key":"ref67","author":"goodman","year":"2004","journal-title":"Handbook of Discrete and Computational Geometry"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347116"},{"key":"ref69","first-page":"1","article-title":"An efficient two-party protocol for approximate matching in private record linkage","volume":"121","author":"vatsalan","year":"2011","journal-title":"Proc AUSDM"},{"key":"ref197","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-29151-2"},{"key":"ref198","doi-asserted-by":"publisher","DOI":"10.1117\/12.234778"},{"key":"ref199","doi-asserted-by":"publisher","DOI":"10.1109\/CAIVD.1998.646029"},{"key":"ref193","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.150"},{"key":"ref194","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783290"},{"key":"ref195","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453957"},{"key":"ref196","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2016.0130"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661875"},{"key":"ref190","doi-asserted-by":"publisher","DOI":"10.1186\/1748-7188-5-9"},{"key":"ref93","first-page":"1","article-title":"Privacy-preserving record linkage with PPJoin","author":"sehili","year":"2015","journal-title":"Proc BTW"},{"key":"ref191","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559870"},{"key":"ref92","first-page":"1","article-title":"Data partitioning for parallel entity matching","volume":"3","author":"kirsten","year":"2010","journal-title":"Proc VLDB Endowment"},{"key":"ref192","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739104"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1145\/1982185.1982411"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0153"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2020.2994157"},{"key":"ref99","article-title":"Federated queries of clinical data repositories: Balancing accuracy and privacy","volume":"2019","author":"yu","year":"2019","journal-title":"BioRxiv"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660348"},{"key":"ref97","author":"apple","year":"2017","journal-title":"Learning With Privacy at Scale"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.29012\/jpc.v6i1.636"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1002\/9781119072454.ch9"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0919-y"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-017-0041-5"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1080\/19393550802492503"},{"key":"ref89","first-page":"197","article-title":"PRIVATEER: A private record linkage toolkit","author":"karakasidis","year":"2015","journal-title":"Proc CAiSE Forum"},{"key":"ref85","first-page":"1","article-title":"Tree based scalable indexing for multi-party privacy-preserving record linkage","author":"ranbaduge","year":"2014","journal-title":"Proc Austral Data Mining Conf"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18032-8_43"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31750-2_33"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-66172-4_3"},{"key":"ref200","first-page":"165","article-title":"Duplicate detection on GPUs","author":"forchhammer","year":"2013","journal-title":"Database Systems for Business Technology and Web"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2015.12.004"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813725"},{"key":"ref209","doi-asserted-by":"publisher","DOI":"10.1016\/j.jisa.2017.01.002"},{"key":"ref203","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646173"},{"key":"ref204","doi-asserted-by":"publisher","DOI":"10.23889\/ijpds.v5i5.1445"},{"key":"ref201","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367527"},{"key":"ref202","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807222"},{"key":"ref207","doi-asserted-by":"publisher","DOI":"10.1145\/772862.772867"},{"key":"ref208","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"ref205","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052620"},{"key":"ref206","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516735"},{"key":"ref211","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3527984"},{"key":"ref210","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113352"},{"key":"ref212","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41016-1_18"},{"key":"ref213","year":"1996","journal-title":"The Health Insurance Portability and Accountability Act of 1996 (HIPAA)"},{"key":"ref214","doi-asserted-by":"publisher","DOI":"10.1186\/s12911-014-0123-5"},{"key":"ref215","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2013.12.003"},{"key":"ref216","doi-asserted-by":"publisher","DOI":"10.23889\/ijpds.v1i1.106"},{"key":"ref217","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2507815"},{"key":"ref127","doi-asserted-by":"publisher","DOI":"10.1145\/1159892.1159900"},{"key":"ref126","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_10"},{"key":"ref125","doi-asserted-by":"publisher","DOI":"10.29012\/jpc.v1i1.566"},{"key":"ref124","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2015-0007"},{"key":"ref129","first-page":"1","article-title":"Private set intersection: Are garbled circuits better than custom protocols?","author":"huang","year":"2012","journal-title":"Proc NDSS"},{"key":"ref128","doi-asserted-by":"publisher","DOI":"10.1186\/s12920-018-0400-8"},{"key":"ref130","doi-asserted-by":"publisher","DOI":"10.1109\/PST.2018.8514192"},{"key":"ref133","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79228-4_1"},{"key":"ref134","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33536-5_20"},{"key":"ref131","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btaa764"},{"key":"ref132","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_1"},{"key":"ref136","article-title":"Scaling private record linkage using output constrained differential privacy","author":"he","year":"2017","journal-title":"arXiv 1702 00535"},{"key":"ref135","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2016.0038"},{"key":"ref138","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3272016"},{"key":"ref137","doi-asserted-by":"publisher","DOI":"10.1177\/1833358316647587"},{"key":"ref139","article-title":"A framework for accurate, efficient private record linkage","author":"durham","year":"2012"},{"key":"ref140","first-page":"127","article-title":"An iterative two-party protocol for scalable privacy-preserving record linkage","volume":"134","author":"vatsalan","year":"2012","journal-title":"Proc AUSDM"},{"key":"ref141","doi-asserted-by":"publisher","DOI":"10.1109\/MS.2011.127"},{"key":"ref142","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18123-3_20"},{"key":"ref143","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2016.23175"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31164-2"},{"key":"ref144","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.2105\/AJPH.36.12.1412"},{"key":"ref145","first-page":"125","article-title":"Efficient circuit-based PSI via cuckoo hashing","author":"pinkas","year":"2018","journal-title":"Advances in Cryptology"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1145\/3407023.3409212"},{"key":"ref108","first-page":"23","article-title":"Encoding of numerical data for privacy-preserving record linkage","volume":"271","author":"demelius","year":"2020","journal-title":"dHealth 2020—Biomedical Informatics for Health and Care Proceedings of the 14th Health Informatics Meets Digital Health Conference"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2980835"},{"key":"ref106","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.58"},{"key":"ref105","article-title":"Optimal parameter choice for Bloom filter-based privacy-preserving record linkage","author":"borgs","year":"2019"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.1007\/s007780100057"},{"key":"ref103","article-title":"Hyper-parameter optimization for privacy-preserving record linkage","author":"yu","year":"2020","journal-title":"Data Integration and Applications Workshop European Conference on Machine Learning"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2019-0004"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.1136\/amiajnl-2013-002165"},{"key":"ref112","doi-asserted-by":"publisher","DOI":"10.23889\/ijpds.v1i1.241"},{"key":"ref110","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2017.07.001"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-018-0563-0"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.3233\/SW-150210"},{"key":"ref12","first-page":"73","article-title":"Summarization algorithms for record linkage","author":"karapiperis","year":"2018","journal-title":"Proc EDBT"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2816821"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.43"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2359666"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.14778\/2876473.2876474"},{"key":"ref118","doi-asserted-by":"publisher","DOI":"10.1093\/ije\/dyz203"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00015"},{"key":"ref117","doi-asserted-by":"publisher","DOI":"10.1111\/1753-6405.12597"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732982"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.14778\/2732967.2732975"},{"key":"ref119","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2020.101809"},{"key":"ref114","first-page":"638","article-title":"Repairing of record linkage: Turning errors into insight","author":"bui-nguyen","year":"2019","journal-title":"Proc EDBT"},{"key":"ref113","article-title":"Privacy-preserving active learning on sensitive data for user intent classification","author":"feyisetan","year":"2019","journal-title":"arXiv 1903 11112"},{"key":"ref116","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2288-14-36"},{"key":"ref115","first-page":"779","article-title":"Record linkage: Making the most out of errors in linking variables","author":"tromp","year":"2006","journal-title":"Proc AMIA Annu Symp"},{"key":"ref120","doi-asserted-by":"publisher","DOI":"10.5220\/0006682701950203"},{"key":"ref121","first-page":"962","article-title":"Fairness constraints: Mechanisms for fair classification","author":"zafar","year":"2017","journal-title":"Proc Int Conf Artif Intell Statist (AISTATS)"},{"key":"ref122","first-page":"38","article-title":"False positives, false negatives, and false analyses: A rejoinder to machine bias: There’s software used across the country to predict future criminals. and it’s biased against blacks","volume":"80","author":"flores","year":"2016","journal-title":"Fed Probation"},{"key":"ref123","first-page":"1","article-title":"How we analyzed the compas recidivism algorithm","volume":"9","author":"larson","year":"2016","journal-title":"ProPublica"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206\/9151439\/09541149.pdf?arnumber=9541149","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T10:52:35Z","timestamp":1652179955000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9541149\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":217,"URL":"https:\/\/doi.org\/10.1109\/tifs.2021.3114026","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}