{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:14:39Z","timestamp":1783008879592,"version":"3.54.5"},"reference-count":56,"publisher":"Oxford University Press (OUP)","issue":"6","license":[{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"German Federal Ministry of Education and Research (BMBF) through the HiGHmed Consortium","award":["01ZZ1802G"],"award-info":[{"award-number":["01ZZ1802G"]}]},{"name":"German Research Foundation (DFG) through the MAGIC project","award":["LA 3859\/1-1"],"award-info":[{"award-number":["LA 3859\/1-1"]}]},{"name":"Research Training Group GRK","award":["1651"],"award-info":[{"award-number":["1651"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,3,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:sec>\n                  <jats:title>Motivation<\/jats:title>\n                  <jats:p>Record Linkage has versatile applications in real-world data analysis contexts, where several datasets need to be linked on the record level in the absence of any exact identifier connecting related records. An example are medical databases of patients, spread across institutions, that have to be linked on personally identifiable entries like name, date of birth or ZIP code. At the same time, privacy laws may prohibit the exchange of this personally identifiable information (PII) across institutional boundaries, ruling out the outsourcing of the record linkage task to a trusted third party. We propose to employ privacy-preserving record linkage (PPRL) techniques that prevent, to various degrees, the leakage of PII while still allowing for the linkage of related records.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Results<\/jats:title>\n                  <jats:p>We develop a framework for fault-tolerant PPRL using secure multi-party computation with the medical record keeping software Mainzelliste as the data source. Our solution does not rely on any trusted third party and all PII is guaranteed to not leak under common cryptographic security assumptions. Benchmarks show the feasibility of our approach in realistic networking settings: linkage of a patient record against a database of 10\u00a0000 records can be done in 48\u2009s over a heavily delayed (100\u2009ms) network connection, or 3.9\u2009s with a low-latency connection.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Availability and implementation<\/jats:title>\n                  <jats:p>The source code of the sMPC node is freely available on Github at https:\/\/github.com\/medicalinformatics\/SecureEpilinker subject to the AGPLv3 license. The source code of the modified Mainzelliste is available at https:\/\/github.com\/medicalinformatics\/MainzellisteSEL.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Supplementary information<\/jats:title>\n                  <jats:p>Supplementary data are available at Bioinformatics online.<\/jats:p>\n               <\/jats:sec>","DOI":"10.1093\/bioinformatics\/btaa764","type":"journal-article","created":{"date-parts":[[2020,8,25]],"date-time":"2020-08-25T19:13:23Z","timestamp":1598382803000},"page":"1657-1668","source":"Crossref","is-referenced-by-count":36,"title":["Mainzelliste SecureEpiLinker (MainSEL): privacy-preserving record linkage using secure multi-party computation"],"prefix":"10.1093","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6458-5840","authenticated-orcid":false,"given":"Sebastian","family":"Stammler","sequence":"first","affiliation":[{"name":"Department of Computer Science, Technische Universit\u00e4t Darmstadt , 64289 Darmstadt, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9731-7666","authenticated-orcid":false,"given":"Tobias","family":"Kussel","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Technische Universit\u00e4t Darmstadt , 64289 Darmstadt, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Phillipp","family":"Schoppmann","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Humboldt-Universit\u00e4t zu Berlin , 10099 Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Florian","family":"Stampe","sequence":"additional","affiliation":[{"name":"Federated Information Systems, German Cancer Research Center , 69120 Heidelberg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Galina","family":"Tremper","sequence":"additional","affiliation":[{"name":"Federated Information Systems, German Cancer Research Center , 69120 Heidelberg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Katzenbeisser","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science and Mathematics, Universit\u00e4t Passau , 94030 Passau, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kay","family":"Hamacher","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Technische Universit\u00e4t Darmstadt , 64289 Darmstadt, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1880-5555","authenticated-orcid":false,"given":"Martin","family":"Lablans","sequence":"additional","affiliation":[{"name":"Federated Information Systems, German Cancer Research Center , 69120 Heidelberg, Germany"},{"name":"Zentrum f\u00fcr Pr\u00e4ventivmedizin und Digitale Gesundheit Baden-W\u00fcrttemberg, University Medical Centre Mannheim , 68135 Mannheim, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2020,9,1]]},"reference":[{"key":"2023020108574859100_btaa764-B1","first-page":"535","author":"Asharov","year":"2013"},{"key":"2023020108574859100_btaa764-B2","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1007\/s00145-016-9236-6","article-title":"More efficient oblivious transfer extensions","volume":"30","author":"Asharov","year":"2017","journal-title":"J. Cryptol"},{"key":"2023020108574859100_btaa764-B3","doi-asserted-by":"crossref","first-page":"1342","DOI":"10.1109\/TCBB.2018.2855125","article-title":"Privacy-preserving linkage of genomic and clinical data sets","volume":"16","author":"Baker","year":"2019","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf"},{"key":"2023020108574859100_btaa764-B4","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1007\/s00103-015-2295-2","article-title":"Zentralisierte biobanken als grundlage f\u00fcr die medizinische forschung","volume":"59","author":"Bernemann","year":"2016","journal-title":"Bundesgesundheitsblatt, Gesundheitsforschung, Gesundheitsschutz"},{"key":"2023020108574859100_btaa764-B5","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","year":"1970","journal-title":"Commun. ACM"},{"key":"2023020108574859100_btaa764-B6","first-page":"192","author":"Bogdanov","year":"2008"},{"key":"2023020108574859100_btaa764-B7","first-page":"83:1","article-title":"Evaluating privacy-preserving record linkage using cryptographic long-term keys and multibit trees on large medical datasets","volume":"17","author":"Brown","year":"2017","journal-title":"BMC Med. Inf. Decis. Mak"},{"key":"2023020108574859100_btaa764-B8","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/978-3-319-45741-3_5","volume-title":"Computer Security \u2013 ESORICS 2016, Lecture Notes in Computer Science","author":"Buescher","year":"2016"},{"key":"2023020108574859100_btaa764-B9","author":"Burkhart","year":"2019"},{"key":"2023020108574859100_btaa764-B10","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1007\/978-3-319-57454-7_49","volume-title":"Advances in Knowledge Discovery and Data Mining, Lecture Notes in Computer Science","author":"Christen","year":"2017"},{"key":"2023020108574859100_btaa764-B11","year":"2019"},{"key":"2023020108574859100_btaa764-B12","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1145\/352595.352598","article-title":"Data integration using similarity joins and a word-based information representation language","volume":"18","author":"Cohen","year":"2000","journal-title":"ACM Trans. Inf. Syst"},{"key":"2023020108574859100_btaa764-B13","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1055\/s-0038-1633924","article-title":"The EpiLink record linkage software","volume":"44","author":"Contiero","year":"2005","journal-title":"Methods Inf. Med"},{"key":"2023020108574859100_btaa764-B14","first-page":"643","author":"Damg\u00e5rd","year":"2012"},{"key":"2023020108574859100_btaa764-B15","volume-title":"NDSS","author":"Demmler","year":"2015"},{"key":"2023020108574859100_btaa764-B16","first-page":"1504","author":"Demmler","year":"2015"},{"key":"2023020108574859100_btaa764-B17","doi-asserted-by":"crossref","first-page":"297","DOI":"10.2307\/1932409","article-title":"Measures of the amount of ecologic association between species","volume":"26","author":"Dice","year":"1945","journal-title":"Ecology"},{"key":"2023020108574859100_btaa764-B18","year":"2016"},{"key":"2023020108574859100_btaa764-B19","year":"2017"},{"key":"2023020108574859100_btaa764-B20","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. Am. Stat. Assoc"},{"key":"2023020108574859100_btaa764-B21","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1007\/978-3-642-54807-9_15","volume-title":"Compiler Construction, Lecture Notes in Computer Science","author":"Franz","year":"2014"},{"key":"2023020108574859100_btaa764-B22","first-page":"116","volume-title":"CRYPTO, volume 1666 of Lecture Notes in Computer Science","author":"Gilboa","year":"1999"},{"key":"2023020108574859100_btaa764-B23","volume-title":"The Foundations of Cryptography - Volume 2, Basic Applications","author":"Goldreich","year":"2004"},{"key":"2023020108574859100_btaa764-B24","first-page":"218","author":"Goldreich","year":"1987"},{"key":"2023020108574859100_btaa764-B25","author":"Guo","year":"2019"},{"key":"2023020108574859100_btaa764-B26","first-page":"1389","author":"He","year":"2017"},{"key":"2023020108574859100_btaa764-B27","year":"2019"},{"key":"2023020108574859100_btaa764-B28","first-page":"123","author":"Inan","year":"2010"},{"key":"2023020108574859100_btaa764-B29","first-page":"145","volume-title":"CRYPTO, volume 2729 of Lecture Notes in Computer Science","author":"Ishai","year":"2003"},{"key":"2023020108574859100_btaa764-B30","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1007\/11841036_42","volume-title":"Algorithms \u2013 ESA 2006, Lecture Notes in Computer Science","author":"Kirsch","year":"2006"},{"key":"2023020108574859100_btaa764-B31","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/978-3-642-22263-4_13","volume-title":"Privacy Enhancing Technologies, Lecture Notes in Computer Science","author":"Kuzu","year":"2011"},{"key":"2023020108574859100_btaa764-B32","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1186\/s12911-014-0123-5","article-title":"A RESTful interface to pseudonymization services in modern web applications","volume":"15","author":"Lablans","year":"2015","journal-title":"BMC Med. Inf. Decis. Mak"},{"key":"2023020108574859100_btaa764-B33","first-page":"1","article-title":"An architecture for translational cancer research as exemplified by the German cancer consortium","volume":"2","author":"Lablans","year":"2018","journal-title":"JCO Clin. Cancer Inf"},{"key":"2023020108574859100_btaa764-B34","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1186\/s12920-018-0400-8","article-title":"Privacy-preserving record linkage in large databases using secure multiparty computation","volume":"11","author":"Laud","year":"2018","journal-title":"BMC Med. Genomics"},{"key":"2023020108574859100_btaa764-B35","first-page":"1","author":"Lazrig","year":"2018"},{"key":"2023020108574859100_btaa764-B36","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","article-title":"A proof of security of Yao\u2019s protocol for two-party computation","volume":"22","author":"Lindell","year":"2009","journal-title":"J. Cryptol"},{"key":"2023020108574859100_btaa764-B37","author":"Link","year":"2019"},{"key":"2023020108574859100_btaa764-B38","first-page":"287","author":"Malkhi","year":"2004"},{"key":"2023020108574859100_btaa764-B39","year":"2019"},{"key":"2023020108574859100_btaa764-B40","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"Mitzenmacher","year":"2005"},{"key":"2023020108574859100_btaa764-B41","doi-asserted-by":"crossref","first-page":"O9","DOI":"10.1186\/1750-1172-9-S1-O9","article-title":"Osse \u2013 open source registry software solution","volume":"9","author":"Muscholl","year":"2014","journal-title":"Orphanet J. Rare Dis"},{"key":"2023020108574859100_btaa764-B42","first-page":"448","author":"Naor","year":"2001"},{"key":"2023020108574859100_btaa764-B43","first-page":"187","article-title":"How to exchange secrets with oblivious transfer","volume":"2005","author":"Rabin","year":"2005","journal-title":"IACR Cryptol. ePrint Arch"},{"key":"2023020108574859100_btaa764-B44","author":"Rescorla","year":"2008"},{"key":"2023020108574859100_btaa764-B45","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1016\/j.jbi.2011.02.008","article-title":"Controlling false match rates in record linkage using extreme value theory","volume":"44","author":"Sariyar","year":"2011","journal-title":"J. Biomed. Inf"},{"key":"2023020108574859100_btaa764-B46","first-page":"91","article-title":"Protecting record linkage identifiers using a language model for patient names","volume":"253","author":"Schnell","year":"2018","journal-title":"Studies Health Technol. Inf"},{"key":"2023020108574859100_btaa764-B47","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1186\/1472-6947-9-41","article-title":"Privacy-preserving record linkage using Bloom filters","volume":"9","author":"Schnell","year":"2009","journal-title":"BMC Med. Inf. Decis. Mak"},{"key":"2023020108574859100_btaa764-B48","doi-asserted-by":"crossref","first-page":"1397","DOI":"10.1109\/JBHI.2015.2450833","article-title":"Toward distributed conduction of large-scale studies in radiation therapy and oncology: open-source system integration approach","volume":"20","author":"Skripcak","year":"2016","journal-title":"IEEE J. Biomed. Health Inf"},{"key":"2023020108574859100_btaa764-B49","year":"2016"},{"key":"2023020108574859100_btaa764-B50","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"},{"key":"2023020108574859100_btaa764-B51","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1007\/978-3-319-49340-4_25","volume-title":"Handbook of Big Data Technologies","author":"Vatsalan","year":"2017"},{"key":"2023020108574859100_btaa764-B52","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/1008908.1008920","article-title":"Conjugate coding","volume":"15","author":"Wiesner","year":"1983","journal-title":"ACM SIGACT News"},{"key":"2023020108574859100_btaa764-B53","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/wics.1317","article-title":"Matching and record linkage","volume":"6","author":"Winkler","year":"2014","journal-title":"Wiley Interdiscipl. Rev. Comput. Stat"},{"key":"2023020108574859100_btaa764-B54","first-page":"162","volume-title":"FOCS","author":"Yao","year":"1986"},{"key":"2023020108574859100_btaa764-B55","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.1016\/B978-0-12-803843-7.00075-2","volume-title":"Computer and Information Security Handbook, Chapter 75","author":"Zabicki","year":"2017"},{"key":"2023020108574859100_btaa764-B56","first-page":"1153","article-title":"Obliv-C: a language for extensible data-oblivious computation","volume":"2015","author":"Zahur","year":"2015","journal-title":"IACR Cryptol. ePrint Arch"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/advance-article-pdf\/doi\/10.1093\/bioinformatics\/btaa764\/42215270\/btaa764.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/38\/6\/1657\/49009597\/btaa764.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/38\/6\/1657\/49009597\/btaa764.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T20:29:41Z","timestamp":1675283381000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/38\/6\/1657\/5900257"}},"subtitle":[],"editor":[{"given":"Zhiyong","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"editor"}]}],"short-title":[],"issued":{"date-parts":[[2020,9,1]]},"references-count":56,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,3,4]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btaa764","relation":{},"ISSN":["1367-4803","1367-4811"],"issn-type":[{"value":"1367-4803","type":"print"},{"value":"1367-4811","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2022,3,15]]},"published":{"date-parts":[[2020,9,1]]}}}