<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3-mathml3.dtd">
<article article-type="research-article" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" dtd-version="1.3" xml:lang="EN">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Digit. Health</journal-id><journal-title-group>
<journal-title>Frontiers in Digital Health</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Digit. Health</abbrev-journal-title></journal-title-group>
<issn pub-type="epub">2673-253X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fdgth.2026.1751234</article-id>
<article-version article-version-type="Version of Record" vocab="NISO-RP-8-2008"/>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Original Research</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>EUPID&#x2014;configurable privacy-preserving record linkage in federated health data spaces</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes"><name><surname>Hayn</surname><given-names>Dieter</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="corresp" rid="cor1">&#x002A;</xref><uri xlink:href="https://loop.frontiersin.org/people/1419853/overview"/><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Project administration" vocab-term-identifier="https://credit.niso.org/contributor-roles/project-administration/">Project administration</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Data curation" vocab-term-identifier="https://credit.niso.org/contributor-roles/data-curation/">Data curation</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; original draft" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-original-draft/">Writing &#x2013; original draft</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="conceptualization" vocab-term-identifier="https://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Funding acquisition" vocab-term-identifier="https://credit.niso.org/contributor-roles/funding-acquisition/">Funding acquisition</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role></contrib>
<contrib contrib-type="author"><name><surname>Sandner</surname><given-names>Emanuel</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="conceptualization" vocab-term-identifier="https://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Formal analysis" vocab-term-identifier="https://credit.niso.org/contributor-roles/formal-analysis/">Formal analysis</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &#x0026; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-review-editing/">Writing &#x2013; review &#x0026; editing</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="software" vocab-term-identifier="https://credit.niso.org/contributor-roles/software/">Software</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="methodology" vocab-term-identifier="https://credit.niso.org/contributor-roles/methodology/">Methodology</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Data curation" vocab-term-identifier="https://credit.niso.org/contributor-roles/data-curation/">Data curation</role></contrib>
<contrib contrib-type="author"><name><surname>Baumgartner</surname><given-names>Martin</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref><uri xlink:href="https://loop.frontiersin.org/people/2512038/overview" /><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="software" vocab-term-identifier="https://credit.niso.org/contributor-roles/software/">Software</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="conceptualization" vocab-term-identifier="https://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &#x0026; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-review-editing/">Writing &#x2013; review &#x0026; editing</role></contrib>
<contrib contrib-type="author"><name><surname>Jammerbund</surname><given-names>Bernhard</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref><uri xlink:href="https://loop.frontiersin.org/people/2631700/overview" /><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="software" vocab-term-identifier="https://credit.niso.org/contributor-roles/software/">Software</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="conceptualization" vocab-term-identifier="https://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &#x0026; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-review-editing/">Writing &#x2013; review &#x0026; editing</role></contrib>
<contrib contrib-type="author"><name><surname>Wiesm&#x00FC;ller</surname><given-names>Fabian</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref><uri xlink:href="https://loop.frontiersin.org/people/3209453/overview" /><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="software" vocab-term-identifier="https://credit.niso.org/contributor-roles/software/">Software</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="conceptualization" vocab-term-identifier="https://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &#x0026; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-review-editing/">Writing &#x2013; review &#x0026; editing</role></contrib>
<contrib contrib-type="author"><name><surname>Beyer</surname><given-names>Stefan</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref><uri xlink:href="https://loop.frontiersin.org/people/3118976/overview" /><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &#x0026; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-review-editing/">Writing &#x2013; review &#x0026; editing</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="software" vocab-term-identifier="https://credit.niso.org/contributor-roles/software/">Software</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="conceptualization" vocab-term-identifier="https://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role></contrib>
<contrib contrib-type="author"><name><surname>Vinatzer</surname><given-names>Hannah</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="conceptualization" vocab-term-identifier="https://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="software" vocab-term-identifier="https://credit.niso.org/contributor-roles/software/">Software</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &#x0026; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-review-editing/">Writing &#x2013; review &#x0026; editing</role></contrib>
<contrib contrib-type="author"><name><surname>Rzepka</surname><given-names>Angelika</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="conceptualization" vocab-term-identifier="https://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &#x0026; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-review-editing/">Writing &#x2013; review &#x0026; editing</role></contrib>
<contrib contrib-type="author"><name><surname>Donsa</surname><given-names>Klaus</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref><uri xlink:href="https://loop.frontiersin.org/people/1853712/overview" /><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="conceptualization" vocab-term-identifier="https://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &#x0026; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-review-editing/">Writing &#x2013; review &#x0026; editing</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role></contrib>
<contrib contrib-type="author"><name><surname>Kreiner</surname><given-names>Karl</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref><uri xlink:href="https://loop.frontiersin.org/people/2686862/overview" /><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="supervision" vocab-term-identifier="https://credit.niso.org/contributor-roles/supervision/">Supervision</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="methodology" vocab-term-identifier="https://credit.niso.org/contributor-roles/methodology/">Methodology</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &#x0026; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-review-editing/">Writing &#x2013; review &#x0026; editing</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="software" vocab-term-identifier="https://credit.niso.org/contributor-roles/software/">Software</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="conceptualization" vocab-term-identifier="https://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role></contrib>
<contrib contrib-type="author"><name><surname>Schreier</surname><given-names>Guenter</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref><uri xlink:href="https://loop.frontiersin.org/people/2275624/overview" /><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="supervision" vocab-term-identifier="https://credit.niso.org/contributor-roles/supervision/">Supervision</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="conceptualization" vocab-term-identifier="https://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &#x0026; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-review-editing/">Writing &#x2013; review &#x0026; editing</role><role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Funding acquisition" vocab-term-identifier="https://credit.niso.org/contributor-roles/funding-acquisition/">Funding acquisition</role></contrib>
</contrib-group>
<aff id="aff1"><label>1</label><institution>Digital Health Information Systems, Center for Health and Bioresources, AIT Austrian Institute of Technology</institution>, <city>Graz</city>, <country country="at">Austria</country></aff>
<aff id="aff2"><label>2</label><institution>Department for Computer Science and Biomedical Engineering, Institute of Neural Engineering, Technical University Graz</institution>, <city>Graz</city>, <country country="at">Austria</country></aff>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label><bold>Correspondence:</bold> Dieter Hayn <email xlink:href="mailto:dieter.hayn@ait.ac.at">dieter.hayn@ait.ac.at</email></corresp>
</author-notes>
<pub-date publication-format="electronic" date-type="pub" iso-8601-date="2026-02-09"><day>09</day><month>02</month><year>2026</year></pub-date>
<pub-date publication-format="electronic" date-type="collection"><year>2026</year></pub-date>
<volume>8</volume><elocation-id>1751234</elocation-id>
<history>
<date date-type="received"><day>21</day><month>11</month><year>2025</year></date>
<date date-type="rev-recd"><day>12</day><month>01</month><year>2026</year></date>
<date date-type="accepted"><day>13</day><month>01</month><year>2026</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2026 Hayn, Sandner, Baumgartner, Jammerbund, Wiesm&#x00FC;ller, Beyer, Vinatzer, Rzepka, Donsa, Kreiner and Schreier.</copyright-statement>
<copyright-year>2026</copyright-year><copyright-holder>Hayn, Sandner, Baumgartner, Jammerbund, Wiesm&#x00FC;ller, Beyer, Vinatzer, Rzepka, Donsa, Kreiner and Schreier</copyright-holder><license><ali:license_ref start_date="2026-02-09">https://creativecommons.org/licenses/by/4.0/</ali:license_ref><license-p>This is an open-access article distributed under the terms of the <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution License (CC BY)</ext-link>. The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</license-p></license>
</permissions>
<abstract><sec><title>Introduction</title>
<p>Rare disease research relies heavily on secondary use of health data due to the scarcity of clinical guidelines and data sharing between research institutions and hospitals. Linking rare disease patients is challenging due to increased re-identification risk in small cohorts, thus limiting the data&#x0027;s potential for research. Privacy-Preserving Record Linkage (PPRL) enables the linkage of disparate datasets while safeguarding the identities of involved participants.</p>
</sec><sec><title>Methods</title>
<p>The aim of the present paper is to provide an up-to-date description of the concept and the technical details of the European Patient Identity (EUPID) Services, a configurable PPRL solution which is currently used for rare disease research in Europe to bridge healthcare and research. They support different algorithms for record linkage (configurable selection of quasi-identifiers, various hashing algorithms, phonetic hashing, Bloom filters), re-identification and flexible specification of the pseudonym format. Furthermore, their setup is also flexible whether to install standalone instances or integrate with a central EUPID Services deployment.</p>
</sec><sec><title>Results</title>
<p>The EUPID Services have been used in various research applications since 2014. As of July 2025, 6,356 unique patients have been registered to the central EUPID Services within the domain Paediatric Oncology in Europe, and 10,340 pseudonyms for 12 EUPID Contexts have been generated. Within the Austrian Health Data Donation Space, which represents a federated PPRL infrastructure supporting asynchronous record linkage, more than 16 million patients were pseudonymised in six different contexts. Overall, four cases of false negative matches have been identified, which were caused by typing errors. So far, no false positive match has ever been detected.</p>
</sec><sec><title>Discussion</title>
<p>In view of the upcoming European legislatives like the European Health Data Space (EHDS), connecting patient data securely and safely will become increasingly important and useful. The EUPID Services support such linkage in a Findable, Accessible, Interoperable and Reusable (FAIR) manner and thus could represent a vital and proven part of future national and European research networks.</p>
</sec>
</abstract>
<kwd-group>
<kwd>European Health Data Space (EHDS)</kwd>
<kwd>findability accessibility interoperability re-usability (FAIR)</kwd>
<kwd>privacy-preservation</kwd>
<kwd>record linkage</kwd>
<kwd>secondary use</kwd>
</kwd-group><funding-group><funding-statement>The author(s) declared that financial support was not received for this work and/or its publication.</funding-statement></funding-group><counts>
<fig-count count="6"/>
<table-count count="1"/><equation-count count="0"/><ref-count count="73"/><page-count count="12"/><word-count count="5486"/></counts><custom-meta-group><custom-meta><meta-name>section-at-acceptance</meta-name><meta-value>Health Informatics</meta-value></custom-meta></custom-meta-group>
</article-meta>
</front>
<body><sec id="s1" sec-type="intro"><label>1</label><title>Introduction</title>
<p>Healthcare data that were collected for a specific purpose (primary use) represent a valuable resource for further research. Such &#x201C;secondary use&#x201D; of healthcare data often faces barriers due to data protection concerns, intellectual property rights, and technical challenges due to heterogenous and distributed data. This applies especially for rare diseases, where the limited data available are spread world-wide and, in the absence of clinical guidelines, patients are typically enrolled to clinical trials and treated according to the most recent trial protocols (<xref ref-type="bibr" rid="B1">1</xref>). Additionally, rare disease data are often distributed over different types of resources, such as clinical trial databases, biobanks, and registries. While routine care diagnosis and treatment data are collected in a personalised format, research data are typically pseudonymised to comply with the General Data Protection Regulation (GDPR) (<xref ref-type="bibr" rid="B2">2</xref>).</p>
<p>Secondary use of distributed healthcare data is currently addressed by various ongoing initiatives. In alignment with the current regulations for sharing research data (<xref ref-type="bibr" rid="B3">3</xref>), the European Commission has established the European Health Data Space (EHDS), with the aim to improve health data usage in the European Union (EU). Many of these activities aim at data provision in a Findable, Accessible, Interoperable and Reusable [FAIR (<xref ref-type="bibr" rid="B4">4</xref>)], manner, such as the European Rare Diseases Research Alliance (ERDERA) (<xref ref-type="bibr" rid="B3">3</xref>).</p>
<p>Privacy-Preserving Record Linkage (PPRL) concerns the linkage of different datasets without disclosing the participant&#x0027;s Personally Identifiable Information (PII), by applying different algorithms on so-called quasi-identifiers (QIDs), i.e., parameter sets than can be used to identify a patient in a unique way.</p>
<p>PPRL addresses a wide range of application scenarios. For paediatric oncology, related use cases have been summarised in a prior study (<xref ref-type="bibr" rid="B5">5</xref>), based on six dimensions: distributed personalised records, pseudonymisation, distributed pseudonymised records, record linkage, storage, and analysis. The importance of PPRL in rare disease research has recently been further highlighted in a Lancet Oncology comment, where the European Society for Paediatric Oncology (SIOP) formulated six recommendations for improving the current legislative framework, one of them, recommendation four, focusing on the &#x201C;support for privacy-preserving data linkage&#x201D; (<xref ref-type="bibr" rid="B6">6</xref>). Already in 2013, to better understand the differences between PPRL solutions, Vatsalan et al. published a PPRL taxonomy, listing fifteen dimensions that can be used to characterise privacy-preserving record linkage techniques (<xref ref-type="bibr" rid="B7">7</xref>). More recently in 2021, Gkoulalas-Divanis et al. published a review article comparing modern PPRL techniques and systems using a taxonomy consisting of the four aspect &#x201C;families&#x201D;: computation, utility, privacy, and practical aspects (<xref ref-type="bibr" rid="B8">8</xref>). A comprehensive overview of various aspects of PPRL was published by Christen et al. (<xref ref-type="bibr" rid="B9">9</xref>).</p>
<p>State-of-the-art PPRL algorithms can be based on phonetic coding (<xref ref-type="bibr" rid="B10">10</xref>, <xref ref-type="bibr" rid="B11">11</xref>), hashing (<xref ref-type="bibr" rid="B12">12</xref>, <xref ref-type="bibr" rid="B13">13</xref>), reference-values (<xref ref-type="bibr" rid="B14">14</xref>, <xref ref-type="bibr" rid="B15">15</xref>), embedding (<xref ref-type="bibr" rid="B16">16</xref>&#x2013;<xref ref-type="bibr" rid="B18">18</xref>), differential privacy (<xref ref-type="bibr" rid="B19">19</xref>), or secure multiparty computation (applied on QIDs or on the clinical data themselves) (<xref ref-type="bibr" rid="B20">20</xref>&#x2013;<xref ref-type="bibr" rid="B23">23</xref>). Some solutions only support linkage in case of perfectly matching records. More comprehensive solutions can also link slightly differing records, e.g., in case of typing errors or missing data. Since both&#x2014;false positive as well as false negative linkage&#x2014;may have severe consequences, the optimal threshold of accordance must be chosen depending on the use case. This problem is related to the basic law of Information Security, the Confidentiality-Integrity-Availability (CIA) Triad (<xref ref-type="bibr" rid="B24">24</xref>), as illustrated in <xref ref-type="fig" rid="F1">Figure&#x00A0;1</xref>.</p>
<fig id="F1" position="float"><label>Figure&#x00A0;1</label>
<caption><p>Confidentiality-Integrity-Availability (CIA) triad&#x2014;basic law of information security, adapted to the privacy-preserving record linkage context.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="fdgth-08-1751234-g001.tif"><alt-text content-type="machine-generated">Venn diagram illustrating three areas of focus: Confidentiality, Integrity, and Availability. \"Confidentiality\" is linked to Data Protection Officers and asks if patient identities are protected. \"Integrity\" involves Researchers and questions if the same patient can be consistently identified across contexts. \"Availability\" relates to Health Professionals and Researchers, questioning if the service is easy to use and always responsive.</alt-text>
</graphic>
</fig>
<p>There are various PPRL services on the market, such as (in alphabetic order) AnonLink (<xref ref-type="bibr" rid="B25">25</xref>), CRID (<xref ref-type="bibr" rid="B26">26</xref>), E-PIX (<xref ref-type="bibr" rid="B27">27</xref>), FEMRL (<xref ref-type="bibr" rid="B28">28</xref>), FRIL (<xref ref-type="bibr" rid="B29">29</xref>), GRHANITE (<xref ref-type="bibr" rid="B30">30</xref>), LinkWise (<xref ref-type="bibr" rid="B31">31</xref>), LinXmart (<xref ref-type="bibr" rid="B32">32</xref>), LSHDB (<xref ref-type="bibr" rid="B33">33</xref>), MainSEL (<xref ref-type="bibr" rid="B22">22</xref>), Mainzelliste (<xref ref-type="bibr" rid="B34">34</xref>), MERLIN (<xref ref-type="bibr" rid="B35">35</xref>), MTB (<xref ref-type="bibr" rid="B36">36</xref>), NGLMS (<xref ref-type="bibr" rid="B37">37</xref>), NIH GUID (<xref ref-type="bibr" rid="B38">38</xref>), OneFL Deduper (<xref ref-type="bibr" rid="B39">39</xref>), P4Join (<xref ref-type="bibr" rid="B40">40</xref>), PRIVATEER (<xref ref-type="bibr" rid="B41">41</xref>), SOEMPI (<xref ref-type="bibr" rid="B42">42</xref>), SPIDER1, TAILOR (<xref ref-type="bibr" rid="B43">43</xref>). Many of these solutions have successfully been applied in selected application scenarios, proving feasibility of PPRL in various settings. However, there is a need for PPRL services which support multiple scenarios as described below, with configurable working points based on the CIA Triad, and which is also mature and sustainable enough to be applied even in long-term secondary use scenarios.</p>
<p>The European Patient Identity (EUPID) Services represent a hash-based PPRL solution, which has initially been described in 2014 (<xref ref-type="bibr" rid="B44">44</xref>). They are widely used in rare disease research in Europe. The EUPID Services are operated by the AIT Austrian Institute of Technology, which acts as a data processor on behalf of data controllers holding a EUPID license. The services are financed either through funded research, such as national or international research projects, or through contract research. Although initially developed for European pediatric oncology projects, the EUPID Services have, over the time, proven to be a valuable tool for a broader range of application areas, including national research infrastructures and temporary research projects. Since the EUPID Services have last been described in 2014, the underlying algorithms and principles have changed significantly.</p>
<p>The aim of the present paper is to provide an up-to-date description of the concept and the technical details of the EUPID Services, a configurable PPRL solution which is currently used for rare disease research in Europe, and in various research projects with distributed data sources. In addition, accuracy, efficacy and implementation status should be analysed. Based on the EUPID Services&#x0027; implementation and specifications, PPRL providers and stakeholders in need of PPRL solutions will be informed on how to successfully apply PPRL in various scenarios.</p>
</sec>
<sec id="s2" sec-type="methods"><label>2</label><title>Methods</title>
<sec id="s2a"><label>2.1</label><title>EUPID services concept</title>
<p>The EUPID Services concept (<xref ref-type="fig" rid="F2">Figure&#x00A0;2</xref>) is based on the separation of a) clients (e.g., in hospitals) who hold personalised clinical data of their own patients, b) context providers (e.g., for registries or clinical trials), who hold pseudonymised clinical data from multiple centres, and c) encrypted and/or hashed data derived from QIDs which refer to context-specific pseudonyms and which are used for the actual record linkage.</p>
<fig id="F2" position="float"><label>Figure&#x00A0;2</label>
<caption><p>The EUPID concept separates local clients (left), holding personally identifiable information (PII), from the EUPID services (middle), which ensure linkability, and the contexts (right), who hold pseudonymised, aggregated data. The patient registration process consists of: 1) Local clients hash and/or encrypt PIIs of their patients and send the encrypted and/or hashed PII to the EUPID Services. 2) The EUPID Services link the PII from different local clients and different context to the unique EUPID and return context-specific pseudonyms to the local clients. 3) The local clients send the context-specific clinical data together with the context-specific pseudonyms to the respective contexts. Maps created using MapChart (<ext-link ext-link-type="uri" xlink:href="https://www.mapchart.net/">https://www.mapchart.net/</ext-link>), licensed under <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by-sa/4.0/">CC BY-SA 4.0</ext-link>. &#x201C;EUPID&#x201D; logo reproduced with permission from European Patient Identity Services (<ext-link ext-link-type="uri" xlink:href="https://services.eupid.eu/">https://services.eupid.eu/</ext-link>).</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="fdgth-08-1751234-g002.tif"><alt-text content-type="machine-generated">Diagram illustrating EUPID Services for privacy-preserving record linkage. It shows the flow from local clients with personalized data to contexts with pseudonymized data. Local clients hold clinical data and PII. PII are hashed/encrypted and sent to EUPID who performs the record linkage and returns a context-specific pseudonym. This data is processed by EUPID Services, which assigns pseudonyms correlated with various contexts. The data is then shared with different contexts, maintaining anonymity and privacy through pseudonymization.</alt-text>
</graphic>
</fig>
<p>The EUPID Services do not require any installation of software at the computers of local clients. Only a standard internet browser is required. Specific software for communication with the EUPID Application Programming Interface (API) only needs to be included at the data collection service of each context (e.g., JavaScript within electronic data capture systems).</p>
</sec>
<sec id="s2b"><label>2.2</label><title>EUPID services IT architecture</title>
<p>The EUPID Services consist of specific software and a dedicated database for data and metadata. The infrastructure is accessible via a Web API to an arbitrary number of consumer applications within client infrastructures. All data are symmetrically encrypted prior storage in the database. <xref ref-type="fig" rid="F3">Figure&#x00A0;3</xref> provides an overview of the overall architecture.</p>
<fig id="F3" position="float"><label>Figure&#x00A0;3</label>
<caption><p>EUPID services IT architecture, consisting of software modules, an API, the actual PPRL data, and metadata. Dashed sections are foreseen but not implemented yet.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="fdgth-08-1751234-g003.tif"><alt-text content-type="machine-generated">Diagram of a data management system divided into four sections: Software, API, Data, and Metadata. Software includes modules like Record Linkage and Context Management. API features functionalities such as Single Patient Registration and Metadata Access. Data outlines patient information with hashed identity data, pseudonyms, and contexts. Metadata organizes Domains, Users, Contexts, Crypto-Secrets, and Consents.</alt-text>
</graphic>
</fig>
<sec id="s2b1"><label>2.2.1</label><title>EUPID services data</title>
<p>The EUPID patient database represents the core for all PPRL applications within the EUPID Services. Within the patient database, each patient is assigned a EUPID, which represents a Universally Unique Identifier (UUID). This EUPID refers to a) hashed PIIs which are used for PPRL, b) context specific pseudonyms, which are provided to the EUPID users, and optionally c) encrypted PIIs.</p>
<p>All EUPID data are stored using symmetric encryption at REST within the EUPID Database, with the encryption key stored outside of the database. Only pseudonyms are communicated to external services, while the EUPIDs themselves as well as hashed and/or encrypted data never leave the EUPID Services infrastructure.</p>
</sec>
<sec id="s2b2"><label>2.2.2</label><title>EUPID services metadata</title>
<p>The EUPID Services support PPRL within a specific EUPID Domain, such as &#x201C;Paediatric Oncology in Europe&#x201D; or &#x201C;Austrian Health Research Infrastructure&#x201D;. Data can however not be linked between different domains. For each EUPID Domain, the used QIDs, cryptographic algorithms, respective parameters and secrets are specified.</p>
<p>Each EUPID Domain contains several EUPID Contexts, such as registries, clinical trials, biobanks, etc. Each of these contexts hold different pseudonyms for individual patients, which can be linked via the EUPID Services. For each context, additional parameters, such as URLs, contacts and principal investigator information, etc., can be provided.</p>
<p>Two types of EUPID Users are supported. So called Managed Users are managed by the EUPID Services Provider and stored within the EUPID Services IT infrastructure. Managed Users can have different roles in different contexts. Delegated Users are stored by EUPID Context Providers, such as the provider of a registry. If specific security requirements are met, the EUPID Services will trust that users accessing the EUPID API from a trusted EUPID Context Provider are authenticated to access the EUPID API as delegated users.</p>
<p>It is foreseen that consents and use conditions will be stored within the EUPID Services metadata. However, so far these data are handled document-based, outside the EUPID Services infrastructure.</p>
</sec>
<sec id="s2b3"><label>2.2.3</label><title>EUPID services software</title>
<p>The actual record linkage is done by the EUPID Services software, as described in section 2.3 and for managing communication between the EUPID database and other components. In addition, the software ensures authorization and authentication of users accessing the service, audit trailing, user and group management, and domain and context management. Authorization, authentication and user management can either be implemented locally on the EUPID Server, or external services such as Azure Entra ID or any other OAuth 2.0 compliant identity provider can be used.</p>
</sec>
<sec id="s2b4"><label>2.2.4</label><title>EUPID services API</title>
<p>External services can access the EUPID Services via an API. Every request requires an OAuth 2.0 Bearer Token2 to be sent in the authorization header.</p>
<p>The API supports the following management requests:
<list list-type="bullet">
<list-item>
<p>Get contexts&#x2014;Retrieve a list of available contexts within a domain</p></list-item>
<list-item>
<p>Add context&#x2014;Add a new context to a domain</p></list-item>
<list-item>
<p>Assign context to user&#x2014;Assign a context to a user to enable them to register patients in that context.</p></list-item>
<list-item>
<p>List context assignments&#x2014;Retrieve a list of all contexts assigned to a specific user.</p></list-item>
<list-item>
<p>Remove context from user&#x2014;Remove the assignment of a context from a specific user. The user can no longer register patients in that context.</p></list-item>
</list>The following API endpoints to register a single patient are available:
<list list-type="bullet">
<list-item>
<p>Initialisation&#x2014;Provides a list of contexts where the user has permission to register patients, including information on supported QIDs and cryptographic algorithms and parameters as described below.</p></list-item>
<list-item>
<p>Register patient&#x2014;Register a new patient based on the ContextID of the target context and the patient&#x0027;s hashed QIDs. If specified for the target context, additional encrypted QIDs can be provided. An optional clarification parameter can be included in the request to specify whether patients should be linked after a partial match is detected in a preceding API-call (see section 2.3.2). The endpoint returns a patient registration response code which describes the result of the registration process (such as &#x201C;No match found&#x2014;a new pseudonym was generated&#x201D; or &#x201C;Full match in another context found&#x201D;). If the patient was successfully registered, the response also includes the patient pseudonym for the context. If a partial match requires user interaction, the endpoint additionally returns a clarification code from which the user must select the appropriate option to conclude the registration process.</p></list-item>
<list-item>
<p>Replicate patient&#x2014;Register a patient in a target context, based on their pre-existing pseudonym in a source context.</p></list-item>
</list>Additionally, sets of patients can be registered via the bulk registration API endpoints:
<list list-type="bullet">
<list-item>
<p>Bulk registration of multiple patients&#x2014;Initiate registration of multiple patients at once. As payload, a list of patient registration records (each following the format for single patient registration described above) is provided. Additionally, each patient record must include a unique PatientReference. The registration process is handled asynchronously. The endpoint returns a unique bulk registration ID. The number of patients which can be registered at once can be limited to avoid overloading the EUPID Services instance.</p></list-item>
<list-item>
<p>Show all previous bulk registration requests&#x2014;Returns the bulk registration set IDs of all previous bulk registration sets for the user of the provided Bearer Token.</p></list-item>
<list-item>
<p>Show bulk registration results&#x2014;Returns the registration results of all patient registration records for a given bulk registration set ID. The response contains the creation date, creating user, a status indicator on whether the bulk registration request is being processed, a progress value indicating to which extend the bulk registration task is already finished, and a finished date. Additionally, an array of RegistrationResponses is provided, which includes information for each patient, corresponding to the single patient registration results.</p></list-item>
</list></p>
</sec>
</sec>
<sec id="s2c"><label>2.3</label><title>Real-time privacy-preserving record linkage</title>
<sec id="s2c1"><label>2.3.1</label><title>Domain-specific (quasi-) identifiers</title>
<p>To support PPRL within a EUPID Domain, specific parameters&#x2014;either unique identifiers (IDs) or sets of QIDs&#x2014;are specified. Unique IDs can be social insurance numbers, patient IDs, etc. Sets of QIDs can be first name &#x0026; last name &#x0026; date of birth, etc. For each domain, one or more supported IDs and sets of QIDs are specified, depending on the availability of data and on the linkage requirements (e.g., in rare disease research, first name, last name and date of birth may be sufficient to identify patients with acceptable accuracy, while additional QIDs such as place of birth might be required for national research infrastructures). Each patient-registering EUPID Context within the EUPID Domain must provide at least one of these IDs or sets of QIDs. In addition, the EUPID Services support non-patient registering EUPID Contexts, whose patients and pseudonyms can only be derived by replicating patients from other EUPID Contexts, i.e., deriving a new pseudonym for a pre-existing patient in another EUPID Context.</p>
</sec>
<sec id="s2c2"><label>2.3.2</label><title>Domain-specific cryptographic algorithms</title>
<p>The EUPID Services support different kinds of algorithms which can be applied for PPRL in a specific EUPID Domain. Before these algorithms are applied on the EUPID Domain&#x0027;s QIDs, textual QIDs such as first name or last name are normalised with the following steps:
<list list-type="order">
<list-item>
<p>Conversion to lower case</p></list-item>
<list-item>
<p>Conversion of characters NOT part of the Unicode categories L&#x002A; (Letters), N&#x002A; (Numbers), and Co (Private use) to spaces.</p></list-item>
<list-item>
<p>Application of Unicode normalization to decompose accented characters into their base and diacritic parts (NFKD form), and subsequent removal of the diacritic marks</p></list-item>
<list-item>
<p>Removal of trailing and leading spaces</p></list-item>
</list>Date-based QIDs (such as the date of birth) are trimmed to remove trailing and leading spaces from the input string. Dates must be provided in ISO-8601-compliat format yyyy-mm-dd.</p>
<p>For security reasons, PPRL is done on a record-level, where each record is composed of certain QIDs. Therefore, all QIDs of a record are concatenated to a single string, a EUPID Domain-specific cryptographic salt can optionally be added, and the respective cryptographic algorithm is applied on the result.</p>
<p>Real-time PPRL is based on hashing, phonetic hashing or Bloom filtering of QIDs. Phonetic hashing or Bloom filters ensure that PPRL is possible even in case of different spellings of names (&#x201C;M&#x00FC;ller&#x201D; vs. &#x201C;Mueller&#x201D;).</p>
<p>The following cryptographic algorithms are currently supported:
<list list-type="bullet">
<list-item>
<p>Hashing
<list list-type="bullet">
<list-item>
<p>MD5 (<xref ref-type="bibr" rid="B45">45</xref>) (has been supported in earlier versions of EUPID and has meanwhile been removed for security reasons)</p></list-item>
<list-item>
<p>Keying Hash Functions for Message Authentication (HMAC) (<xref ref-type="bibr" rid="B46">46</xref>)</p></list-item>
<list-item>
<p>Argon2 (<xref ref-type="bibr" rid="B47">47</xref>)</p></list-item>
</list></p></list-item>
<list-item>
<p>Phonetic hashing
<list list-type="bullet">
<list-item>
<p>Cologne (<xref ref-type="bibr" rid="B48">48</xref>)</p></list-item>
<list-item>
<p>Soundex (<xref ref-type="bibr" rid="B49">49</xref>)</p></list-item>
</list></p></list-item>
<list-item>
<p>Bloom-filters (<xref ref-type="bibr" rid="B50">50</xref>)</p></list-item>
</list>For each cryptographic algorithm, specific parameters need to be defined per EUPID Domain. Examples of parameters include the number of MD5 hashing cycles for MD5. For Argon2, memory cost (defines the memory usage), time cost (defines the amount of computation realised and therefore the execution time), parallelism (defines the number of parallel threads), hash length (defines the length of the resulting hash), type (defines the Argon2 variant to use) can be specified. Bloom-filters support different bit array sizes and numbers of hash functions. Additionally, Bloom-filters can be configured to apply Cryptographic Longterm Keys (<xref ref-type="bibr" rid="B51">51</xref>), geo-coded representation of places (<xref ref-type="bibr" rid="B52">52</xref>), and locality-sensitive hashing (<xref ref-type="bibr" rid="B53">53</xref>).</p>
<p>Each EUPID Domain can be based on one or more combinations of QIDs and cryptographic algorithms, which can each be specified as fully or partially matching. Linkage algorithms specified as full matching lead to immediate linkage of data, whereas in case of partial matches, manual decisions are required. Therefore, the API returns a case-specific response and clarification code which indicate the partially matching QID. The user can check whether potential typing errors occurred and re-send the request, including the respective clarification code (see section 2.2.4).</p>
</sec>
<sec id="s2c3"><label>2.3.3</label><title>Re-identification</title>
<p>In addition to record linkage, as an independent service, the EUPID Services optionally support re-identification of patients based on asymmetric encryption, whereas a public key is used by the local sites to encrypt identity data while the respective private key is kept secretly by a trusted third party (TTP). Re-identification is supported on different levels:
<list list-type="bullet">
<list-item>
<p>Domain-specific re-identification</p></list-item>
<list-item>
<p>Context-specific re-identification</p></list-item>
<list-item>
<p>Site-specific re-identification (e.g., to de-crypt all patients of a specific site, so that the site&#x0027;s own patients can be shown in a personalised rather than pseudonymised way. The private key might be stored within the local site&#x0027;s IT infrastructure)</p></list-item>
<list-item>
<p>Patient-specific re-identification (e.g., to provide an overview, which contexts are currently holding pseudonymised data of the respective patient. The private key might be stored in a patient app)</p></list-item>
</list>In any case, a specific TTP is nominated by the owner of the respective level. The TTP generates a cryptographic key pair, publishes the public key and stores the private key in a secure manner, such as in an Azure KeyVault3 or a physical Hardware Security Module (HSM). For any patient registered in the respective level, the client not only calculates the cryptographic elements required for PPRL (e.g., hashes) but also encrypts the QIDs with all relevant public keys. The EUPID Services store all encrypted QIDs.</p>
</sec>
<sec id="s2c4"><label>2.3.4</label><title>Pseudonym generation</title>
<p>Context-specific pseudonyms are alphanumeric (2&#x2013;9, A&#x2013;Z), randomly generated, 8 characters strings which must be unique within each context. Purely numeric pseudonyms and pseudonyms which are numeric except for the letter &#x201C;E&#x201D; are prevented to avoid misinterpretation as numerical instead of textual data by data analysis tools (e.g., Microsoft Excel). To avoid errors due to similarly looking characters, the characters &#x201C;0&#x201D; and &#x201C;O&#x201D;, as well as &#x201C;1&#x201D;, &#x201C;l&#x201D; and &#x201C;I&#x201D; are not used.</p>
<p>Context-specific prefixes can be defined for each context. A prefix consists of at least three alphanumeric characters (0&#x2013;9, A&#x2013;Z), starting with a letter (not a number). Even if a prefix is defined, the pseudonym is stored without prefix in the EUPID patient database. However, the EUPID Services API adds the prefix followed by the character &#x201C;-&#x201D; to the EUPID pseudonym when preparing the response.</p>
<p>To support validation of EUPID pseudonyms, the last of the eight characters of the pseudonym is an alphanumeric check character, which is calculated from prefix and the remaining seven characters, using a standardised check character system based on ISO/IEC 7064:20034. The EUPID pseudonym format is illustrated in <xref ref-type="fig" rid="F4">Figure&#x00A0;4</xref>. &#x201C;ONC-A7ST542G&#x201D; serves as an illustrative example of a pseudonym generated by the system for a EUPID Context with prefix &#x201C;ONC&#x201D;.</p>
<fig id="F4" position="float"><label>Figure&#x00A0;4</label>
<caption><p>EUPID services pseudonym format including optional prefix and check character.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="fdgth-08-1751234-g004.tif"><alt-text content-type="machine-generated">Diagram showing a structure with four sections: \"Prefix\" of at least three characters, a hyphen of one character, \"Random alphanumeric characters\" of seven characters, and a \"check character\" of one character.</alt-text>
</graphic>
</fig>
</sec>
</sec>
<sec id="s2d"><label>2.4</label><title>Deployment options</title>
<p>For a researcher who requires a PPRL service for a specific research question, a research project, a research infrastructure, etc., the EUPID Services can be used in two different deployment settings (see <xref ref-type="fig" rid="F5">Figure&#x00A0;5</xref>):
<list list-type="bullet">
<list-item>
<p>Option A&#x2014;Take use of a pre-existing EUPID deployment and add a new EUPID Context and/or EUPID Domain to this deployment</p></list-item>
<list-item>
<p>Option B&#x2014;Deploy a separate instance of the EUPID Services and set up a new EUPID Domain. The separate instance can be deployed in the cloud, on the servers of a EUPID Provider, or on a server of the researcher.</p></list-item>
</list></p>
<fig id="F5" position="float"><label>Figure&#x00A0;5</label>
<caption><p>Deployment options&#x2014;<bold>(A)</bold> A new context can either be added to the EUPID services within the pre-existing EUPID deployment, or <bold>(B)</bold> A separate deployment of the EUPID services can be set up. &#x201C;EUPID&#x201D; logo reproduced with permission from European Patient Identity Services (<ext-link ext-link-type="uri" xlink:href="https://services.eupid.eu/">https://services.eupid.eu/</ext-link>).</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="fdgth-08-1751234-g005.tif"><alt-text content-type="machine-generated">Diagram showing two panels: Panel A illustrates EUPID Server 1 surrounded by eight pre-existing contexts and one new context. Panel B shows EUPID Server 2 with four new contexts and four pre-existing contexts. Both servers contain a QR code and EUPID logo.</alt-text>
</graphic>
</fig>
<p>In addition, as illustrated in <xref ref-type="fig" rid="F6">Figure&#x00A0;6</xref>, the EUPID Services can be operated either based on a central infrastructure (A), or in a distributed setting (B), with different EUPID deployments operated e.g., for different geographic regions or for different context groups.</p>
<fig id="F6" position="float"><label>Figure&#x00A0;6</label>
<caption><p>Deployment options for the EUPID services. <bold>(A)</bold> One single central EUPID Service is deployed. All record linkage is done in real-time whenever a patient is registered. <bold>(B)</bold> More than one EUPID Services are deployed e.g., in different geographical regions. Each EUPID Service supports real-time record linkage for sub-sets of contexts. Record linkage between different EUPID Services is done in a non-real-time manner by applying different privacy-preserving analysis methods across regions. Maps created using MapChart (<ext-link ext-link-type="uri" xlink:href="https://www.mapchart.net/">https://www.mapchart.net/</ext-link>), licensed under <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by-sa/4.0/">CC BY-SA 4.0</ext-link>. &#x201C;EUPID&#x201D; logo reproduced with permission from European Patient Identity Services (<ext-link ext-link-type="uri" xlink:href="https://services.eupid.eu/">https://services.eupid.eu/</ext-link>).</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="fdgth-08-1751234-g006.tif"><alt-text content-type="machine-generated">Diagram illustrating privacy-preserving analysis. Panel A shows a central EUPID QR code surrounded by eight contexts. Panel B displays regions with the EUPID QR code linked to contexts and geographic areas. The analysis includes federated learning, secure multiparty computation, homomorphic encryption, and synthetic data exchange.</alt-text>
</graphic>
</fig>
</sec>
<sec id="s2e"><label>2.5</label><title>Asynchronous privacy-preserving record linkage</title>
<p>In setting B described in <xref ref-type="fig" rid="F6">Figure&#x00A0;6</xref>, PPRL between the distributed EUPID Services deployments can be done in various ways, which can be specified depending on the respective application&#x0027;s requirements:
<list list-type="bullet">
<list-item>
<p>Provision of all services&#x0027; hashed/encrypted PIIs to one of the distributed EUPID Services</p></list-item>
<list-item>
<p>Setup of another central EUPID Service which performs the PPRL in between the distributed EUPID Services</p></list-item>
<list-item>
<p>Application of homomorphic encryption and/or secure multiparty computation on the distributed hashed/encrypted PIIs to identify duplicate records in both instances (see e.g., the secure multiparty computation approach by Laud and Pankova <xref ref-type="bibr" rid="B49">49</xref>).</p></list-item>
</list>While the first two of these three options have already been implemented, secure multiparty computation/homomorphic encryption has been conceptualised but not implemented yet.</p>
</sec>
</sec>
<sec id="s3" sec-type="results"><label>3</label><title>Results</title>
<sec id="s3a"><label>3.1</label><title>Use cases</title>
<sec id="s3a1"><label>3.1.1</label><title>Use case 1&#x2014;paediatric oncology Europe</title>
<p>In paediatric oncology, the EUPID Services are deployed based on setting A (one central EUPID Service) as shown in <xref ref-type="fig" rid="F5">Figure&#x00A0;5</xref>. All services are deployed in a European Azure cloud. Full matches are either achieved by Argon2 matched sets of first name, last name and date of birth, or by Argon2 matched unique patient IDs. Partial matches are achieved by matched phonetic hashes of first or last names or by flipped day and month of birth. Re-identification is supported for some contexts in the domain, with the European Society for Paediatric Oncology (SIOPE) acting as a TTP. This EUPID Domain is currently being integrated into the ERDERA Virtual Platform by providing metadata concerning the established contexts and counts of patients per context via a Fair Data Point and a Beacon-2-API (<xref ref-type="bibr" rid="B54">54</xref>).</p>
<p>The EUPID Services are used in various paediatric oncology applications since 2014. As of July 2025, 6,356 unique patients and 10,340 pseudonyms have been generated within 12 EUPID Contexts within this domain. Record linkage was applied between up to four EUPID Contexts per patient. <xref ref-type="table" rid="T1">Table&#x00A0;1</xref> summarises the number of patients depending on the number of contexts the respective patients are registered to.</p>
<table-wrap id="T1" position="float"><label>Table&#x00A0;1</label>
<caption><p>Number of patients in the EUPID domain &#x201C;paediatric oncology&#x201D; depending on the number of contexts they are registered to.</p></caption>
<table>
<colgroup>
<col align="left"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th valign="top" align="left">Number of contexts per patient</th>
<th valign="top" align="center">Number of patients</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">1</td>
<td valign="top" align="center">3,466</td>
</tr>
<tr>
<td valign="top" align="left">2</td>
<td valign="top" align="center">2,162</td>
</tr>
<tr>
<td valign="top" align="left">3</td>
<td valign="top" align="center">362</td>
</tr>
<tr>
<td valign="top" align="left">4</td>
<td valign="top" align="center">366</td>
</tr>
<tr>
<td valign="top" align="left">Total</td>
<td valign="top" align="center">6,356</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>EUPID-based PPRL was applied in several use cases in the past years:
<list list-type="bullet">
<list-item>
<p>Linking biobanking and clinical data (<xref ref-type="bibr" rid="B55">55</xref>, <xref ref-type="bibr" rid="B56">56</xref>)</p></list-item>
<list-item>
<p>Linking clinical data with genomic/phenotypic analysis data (<xref ref-type="bibr" rid="B57">57</xref>)</p></list-item>
<list-item>
<p>Linking neurological and oncological trial data (<xref ref-type="bibr" rid="B58">58</xref>)</p></list-item>
<list-item>
<p>Artificial intelligence based on linked imaging, clinical and biological data (<xref ref-type="bibr" rid="B59">59</xref>, <xref ref-type="bibr" rid="B60">60</xref>)</p></list-item>
<list-item>
<p>A systematic overview of use cases for PPRL in paediatric oncology, from patient counts over tumour board to AI applications, is summarised in (<xref ref-type="bibr" rid="B61">61</xref>).</p></list-item>
</list></p>
</sec>
<sec id="s3a2"><label>3.1.2</label><title>Use case 2&#x2014;Austrian health research infrastructure</title>
<p>Within the Smart FOX project, an Austrian Health Data Donation Space (AHDDS) is currently being explored (<xref ref-type="bibr" rid="B62">62</xref>). Within the AHDDS domain, a decentralised EUPID infrastructure as illustrated in Figure&#x202F;<xref ref-type="fig" rid="F6">6B</xref> has been set up, with three different stakeholders [regional hospital provider Tirol Kliniken, based on the infrastructure described in (<xref ref-type="bibr" rid="B63">63</xref>), Medical University of Graz, IT services of the Austrian social insurances], each operating their own EUPID instance on their local servers. All three instances share the same cryptographic algorithms and parameters. Asynchronous linkage is applied semi-automatically on demand, only for specific research questions, which each require a separate ethics approval.</p>
<p>Within the AHDDS, full matches are applied on Argon2 matched patient IDs. Partial matches are achieved based on sets of first names, last names, and dates of birth.</p>
<p>As of July 2025, more than 16 million unique patients have been generated within 6 EUPID Contexts in this domain.</p>
</sec>
</sec>
<sec id="s3b"><label>3.2</label><title>Confidentiality, integrity, and availability</title>
<p>Based on the CIA Triad (<xref ref-type="bibr" rid="B24">24</xref>), any IT application needs to find the right balance between confidentiality, integrity and availability. In the following, these three aspects are described in more detail based on selected working points of the implementation areas described above.</p>
<sec id="s3b1"><label>3.2.1</label><title>Confidentiality/privacy &#x0026; security</title>
<p>The security concept of the EUPID Services has been audited and confirmed to be secure by two independent IT security consulting companies in Europe. No security breach has been identified so far. As of January 2026, GDPR conformity certification by an accredited GDPR certification body is in the final stages.</p>
</sec>
<sec id="s3b2"><label>3.2.2</label><title>Integrity/linkage accuracy</title>
<p>In their current application areas, the EUPID Services have been set up for use cases that require low false positive rates, while accepting the risk of isolated false negative cases. By combining the strict linkage properties of hashed PIIs (full matches) with phonetic hashing in the partial match workflow, the current setup proved suitable for the scenarios addressed so far. In the PRIMAGE project (<xref ref-type="bibr" rid="B59">59</xref>, <xref ref-type="bibr" rid="B60">60</xref>), we have identified four false negative matches, which were all due to typing errors when entering unique patient IDs. So far, no false positive match has been identified.</p>
</sec>
<sec id="s3b3"><label>3.2.3</label><title>Availability/usability &#x0026; performance</title>
<p>Based on a variety of cryptographic algorithms, the EUPID Services support different working points, ensuring the right balance between confidentiality, integrity and availability of data for each application scenario. In paediatric oncology in Europe, we use first name, last name and date of birth as QIDs, Argon2 hashes of those QIDs for full matches, Soundex and Cologne phonetic hashes applied on first name and last name as well as flipped day and month of birth for partial matches. In this setting, preparation of a patient registration call to the EUPID API, which includes calculating five Argon2 hashes, takes approximately 40&#x2005;ms per hash, i.e., 200&#x2005;ms in total on a workstation with an Intel Xeon W-2145 CPU @ 3.7&#x2005;Ghz and 32&#x2005;GB RAM. The hash was calculated in JavaScript and run in the Brave browser. However, the actual hashing performance highly depends on the available hardware specification and used software and execution environment.</p>
<p>For onboarding new contexts to the EUPID Services, the following dedicated onboarding process has been established:
<list list-type="bullet">
<list-item>
<p>Provide detailed specification to the context provider</p></list-item>
<list-item>
<p>Context provider implements the API interface and connects to the EUPID test services</p></list-item>
<list-item>
<p>Test implementation based on a pre-defined test protocol, ensuring that all cryptographic measures have been implemented correctly by the context provider</p></list-item>
<list-item>
<p>Deploy on productive EUPID Services</p></list-item>
</list>For EUPID Client providers, onboarding typically takes approximately two to four person weeks.</p>
</sec>
</sec>
<sec id="s3c"><label>3.3</label><title>Legal and policy aspects</title>
<p>Legal pre-requisites for linking patient data are confirmed by the context owners, typically based on data processing agreements and/or licensing agreements between the EUPID Provider and the EUPID Context Owner. Typically, usage of the EUPID Services for pseudonymisation and PPRL is described in the study protocol and included in the informed consent which are approved by the research project&#x0027;s ethics committee. Data controllers using the EUPID Services are responsible for securely storing the signed informed consent forms. Any linkage with new EUPID Contexts must be explicitly approved by the data controller. The EUPID Terms of Use specify how the EUPID Services and the related information (e.g., context specific pseudonyms) may be used. When registering new patients, users confirm that they read and accept the EUPID Terms of Use and that they have the right to register patients to the EUPID Services. Policy documents for EUPID Domain Owners and TTPs have been set up.</p>
</sec>
</sec>
<sec id="s4" sec-type="discussion"><label>4</label><title>Discussion</title>
<p>This paper presents the technical and procedural implementation of the EUPID Services, a PPRL infrastructure that has been successfully deployed in domains such as rare diseases, paediatric oncology, and national health research initiatives in Austria. The described setup demonstrates a flexible, standards-compliant approach that can serve as a blueprint for future PPRL solutions, especially in regulated health data environments.</p>
<p>Our findings highlight that there is no &#x201C;one-size-fits-all&#x201D; solution for PPRL. Even within a narrowly defined domain such as pediatric oncology, a wide range of use cases exists, each with different requirements concerning linkage precision, data availability, security, and consent.</p>
<p>The EUPID Services respond to this diversity by allowing a tailored setup for each EUPID Domain, balancing confidentiality, integrity, and availability in line with the CIA triad. This modular and configurable architecture is of particular value for both long-term research infrastructures and temporary, project-based data collaborations. The success of EUPID in these contexts demonstrates its utility in supporting scalable, GDPR-compliant PPRL across diverse scenarios.</p>
<p>While many technical solutions for PPRL already exist in the broader ecosystem, EUPID contributes additional capabilities to this landscape. In particular, it complements existing solutions by offering interoperability with established infrastructures and standards. This has enabled its integration into prominent European research platforms such as the European Joint Programme on Rare Diseases (EJP RD) Virtual Platform (<xref ref-type="bibr" rid="B54">54</xref>), GPAP (<xref ref-type="bibr" rid="B57">57</xref>), and the ESCP registry of the European Reference Network for Paediatric Cancer (<xref ref-type="bibr" rid="B64">64</xref>), among others.</p>
<p>Despite the demonstrated flexibility and reliability of the EUPID Services, several limitations remain. As with all linkage technologies, certain risks to confidentiality persist, including the theoretical possibility of re-identification, particularly in scenarios with small k-anonymity sets.</p>
<p>Linkage accuracy depends heavily on the configuration of matching algorithms and the quality of input data. Although only a few false negative matches were identified in past projects (e.g., due to typographical errors in patient IDs), this highlights the importance of scenario-specific tuning of the linkage strategy. Since the EUPID Services support various PPRL algorithms, linkage accuracy has not been described here in a quantitative way. In a recent review, Tyagi &#x0026; Willis (<xref ref-type="bibr" rid="B65">65</xref>) provided an overview of the accuracy of different algorithms, which can act as a reference for selecting the most suitable algorithm for specific applications.</p>
<p>Some components of the infrastructure, such as the Fair Data Point (FDP) interface and full Beacon 2.0 API support, are being implemented. Moreover, certain operational steps, such as pseudonym merging and re-identification, currently involve manual processing. While functional, this introduces inefficiencies and potential sources of human error that future automation efforts could mitigate.</p>
<p>Several areas of development are underway to further enhance the EUPID Services. Current research is exploring phonetic hashing techniques which are better suited for further languages, such as Metaphone 2 (<xref ref-type="bibr" rid="B66">66</xref>), which would support broader internationalization. Improvements in consent management&#x2014;particularly in alignment with the Smart FOX project (<xref ref-type="bibr" rid="B62">62</xref>) and related works on dynamic consent, Common Conditions of Use elements and Digital Use Conditions (<xref ref-type="bibr" rid="B67">67</xref>, <xref ref-type="bibr" rid="B68">68</xref>)&#x2014;are expected to strengthen governance and user autonomy. In addition, we will continue to improve the usability of the EUPID Services for different user groups, including patients, e.g., based on mobile EUPID applications (<xref ref-type="bibr" rid="B69">69</xref>).</p>
<p>Within the European Joint Programme for Rare Diseases, a concept for integrating the EUPID Services into the EJP-RD/ERDERA Virtual Platform has been developed (<xref ref-type="bibr" rid="B54">54</xref>). Finalization of the respective FDP for metadata discovery and the Beacon-2-API for querying EUPID data are currently ongoing.</p>
<p>While the EUPID Services support linkage of patient identities, subsequent linkage of clinical data requires semantic interoperability of the clinical data. Therefore, clinical data standards such as ICD-11, SNOMED-CT or LOINC are recommended. Our data node technology (<xref ref-type="bibr" rid="B63">63</xref>) takes use of the OMOP Common Data Model (<xref ref-type="bibr" rid="B70">70</xref>), an open community data standard designed to standardise the structure and content of diverse observational healthcare data sources, enabling reliable cross-site analyses and collaborative research across observational clinical and administrative datasets.</p>
<p>Recently, multiple papers of the group of Han et al. have been published which focus on the application of multi-party computation and/or homomorphic encryption on PPRL (<xref ref-type="bibr" rid="B71">71</xref>&#x2013;<xref ref-type="bibr" rid="B73">73</xref>). Ongoing research includes the extension of the EUPID framework with capabilities for homomorphic encryption and secure multi-party computation, either to avoid the exchange of hashed/encrypted/Bloom-filtered QIDs completely or to provide even more secure protocols for record linkage based on these techniques. Enhanced interoperability with other PPRL systems, improved statistical linkage services, and automated linkage quality assessments are key areas of focus. These enhancements will not only improve accuracy and usability but also better support secondary data use under the forthcoming EHDS framework.</p>
</sec>
<sec id="s5" sec-type="conclusions"><label>5</label><title>Conclusion</title>
<p>PPRL is essential for enabling secure federated research infrastructures that support the primary and secondary use of health data. To maximise impact on initiatives like the EHDS, PPRL solutions must meet diverse, use case-specific requirements. The EUPID Services offer a configurable PPRL framework for healthcare and serve as a potential model for future implementations. Broad adoption of such services could enhance data-driven research and AI applications, ultimately advancing clinical innovation and reducing healthcare costs.</p>
</sec>
</body>
<back>
<sec id="s6" sec-type="data-availability"><title>Data availability statement</title>
<p>The datasets presented in this article are not readily available due to privacy concerns&#x2014;based on the core principle of the EUPID Services. Requests to access the datasets should be directed to Dieter Hayn, <email>dieter.hayn@ait.ac.at</email>.</p>
</sec>
<sec id="s7" sec-type="author-contributions"><title>Author contributions</title>
<p>DH: Project administration, Data curation, Writing &#x2013; original draft, Conceptualization, Funding acquisition, Investigation. ES: Investigation, Conceptualization, Formal analysis, Writing &#x2013; review &#x0026; editing, Software, Methodology, Data curation. MB: Software, Investigation, Conceptualization, Writing &#x2013; review &#x0026; editing. BJ: Investigation, Software, Conceptualization, Writing &#x2013; review &#x0026; editing. FW: Software, Investigation, Conceptualization, Writing &#x2013; review &#x0026; editing. SB: Investigation, Writing &#x2013; review &#x0026; editing, Software, Conceptualization. HV: Conceptualization, Software, Investigation, Writing &#x2013; review &#x0026; editing. AR: Conceptualization, Investigation, Writing &#x2013; review &#x0026; editing. KD: Conceptualization, Writing &#x2013; review &#x0026; editing, Investigation. KK: Supervision, Methodology, Writing &#x2013; review &#x0026; editing, Software, Conceptualization, Investigation. GS: Supervision, Conceptualization, Writing &#x2013; review &#x0026; editing, Funding acquisition.</p>
</sec>
<ack><title>Acknowledgments</title>
<p>The authors acknowledge the valuable contributions of SIOPE and SIOPEN in specifying EUPID requirements while setting up the Paediatric Oncology Europe use case, and of the Smart Fox consortium, while setting up the Austrian Health Data Donation Space use case.</p>
</ack>
<sec id="s9" sec-type="COI-statement"><title>Conflict of interest</title>
<p>The author(s) declared that this work was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec id="s10" sec-type="ai-statement"><title>Generative AI statement</title>
<p>The author(s) declared that generative AI was used in the creation of this manuscript. Generative AI was used solely for linguistic editing and translation. The authors are responsible for the final content.</p>
<p>Any alternative text (alt text) provided alongside figures in this article has been generated by Frontiers with the support of artificial intelligence and reasonable efforts have been made to ensure accuracy, including review by the authors wherever possible. If you identify any issues, please contact us.</p>
</sec>
<sec id="s11" sec-type="disclaimer"><title>Publisher&#x0027;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list><title>References</title>
<ref id="B1"><label>1.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>De Wilde</surname> <given-names>B</given-names></name> <name><surname>Barry</surname> <given-names>E</given-names></name> <name><surname>Fox</surname> <given-names>E</given-names></name> <name><surname>Karres</surname> <given-names>D</given-names></name> <name><surname>Kieran</surname> <given-names>M</given-names></name> <name><surname>Manlay</surname> <given-names>J</given-names></name><etal/></person-group> <article-title>The critical role of academic clinical trials in pediatric cancer drug approvals: design, conduct, and fit for purpose data for positive regulatory decisions</article-title>. <source>J Clin Oncol</source>. (<year>2022</year>) <volume>40</volume>(<issue>29</issue>):<fpage>3456</fpage>. <pub-id pub-id-type="doi">10.1200/JCO.22.00033</pub-id><pub-id pub-id-type="pmid">35947814</pub-id></mixed-citation></ref>
<ref id="B2"><label>2.</label><mixed-citation publication-type="other"><collab>THE EUROPEAN PARLIAMENT AND OF THE COUNCIL</collab>, <comment>REGULATION (EU) 2016/679 OF THE EUROPEAN PARLIAMENT AND OF THE COUNCIL of 27 April 2016 on the protection of natural persons with regard to the processing of personal data and on the free movement of such data, and repealing Directive 95/46/EC (General Data Protection Regulation)</comment> (<year>2016</year>).</mixed-citation></ref>
<ref id="B3"><label>3.</label><mixed-citation publication-type="other"><collab>European Commission</collab>. <comment>Proposal for a&#x202F; REGULATION OF THE EUROPEAN PARLIAMENT AND OF THE COUNCIL on the European Health Data Space</comment> (<year>2022</year>).</mixed-citation></ref>
<ref id="B4"><label>4.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Wilkinson</surname> <given-names>MD</given-names></name> <name><surname>Dumontier</surname> <given-names>M</given-names></name> <name><surname>Aalbersberg</surname> <given-names>IJ</given-names></name> <name><surname>Appleton</surname> <given-names>G</given-names></name> <name><surname>Axton</surname> <given-names>M</given-names></name> <name><surname>Baak</surname> <given-names>A</given-names></name><etal/></person-group> <article-title>The FAIR guiding principles for scientific data management and stewardship</article-title>. <source>Sci Data</source>. (<year>2016</year>) <volume>3</volume>:<fpage>160018</fpage>. <pub-id pub-id-type="doi">10.1038/sdata.2016.18</pub-id><pub-id pub-id-type="pmid">26978244</pub-id></mixed-citation></ref>
<ref id="B5"><label>5.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Hayn</surname> <given-names>D</given-names></name> <name><surname>Kreiner</surname> <given-names>K</given-names></name> <name><surname>Sandner</surname> <given-names>E</given-names></name> <name><surname>Baumgartner</surname> <given-names>M</given-names></name> <name><surname>Jammerbund</surname> <given-names>B</given-names></name> <name><surname>Falgenhauer</surname> <given-names>M</given-names></name><etal/></person-group> <article-title>Use cases requiring privacy-preserving record linkage in paediatric oncology</article-title>. <source>Cancers (Basel)</source>. (<year>2024</year>) <volume>16</volume>(<issue>15</issue>):<fpage>2696</fpage>. <pub-id pub-id-type="doi">10.3390/cancers16152696</pub-id><pub-id pub-id-type="pmid">39123424</pub-id></mixed-citation></ref>
<ref id="B6"><label>6.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Vassal</surname> <given-names>G</given-names></name> <name><surname>Lazarov</surname> <given-names>D</given-names></name> <name><surname>Rizzari</surname> <given-names>C</given-names></name> <name><surname>Szczepa&#x0144;ski</surname> <given-names>T</given-names></name> <name><surname>Ladenstein</surname> <given-names>R</given-names></name> <name><surname>Kearns</surname> <given-names>PR</given-names></name></person-group>. <article-title>The impact of the EU general data protection regulation on childhood cancer research in Europe</article-title>. <source>Lancet Oncol</source>. (<year>2022</year>) <volume>23</volume>(<issue>8</issue>):<fpage>974</fpage>&#x2013;<lpage>5</lpage>. <pub-id pub-id-type="doi">10.1016/S1470-2045(22)00287-X</pub-id><pub-id pub-id-type="pmid">35901818</pub-id></mixed-citation></ref>
<ref id="B7"><label>7.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Vatsalan</surname> <given-names>D</given-names></name> <name><surname>Christen</surname> <given-names>P</given-names></name> <name><surname>Verykios</surname> <given-names>V</given-names></name></person-group>. <article-title>A taxonomy of privacy-preserving record linkage techniques</article-title>. <source>Inf Syst</source>. (<year>2013</year>) <volume>38</volume>(<issue>6</issue>):<fpage>946</fpage>&#x2013;<lpage>69</lpage>. <pub-id pub-id-type="doi">10.1016/j.is.2012.11.005</pub-id></mixed-citation></ref>
<ref id="B8"><label>8.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Gkoulalas-Divanis</surname> <given-names>A</given-names></name> <name><surname>Vatsalan</surname> <given-names>D</given-names></name> <name><surname>Karapiperis</surname> <given-names>D</given-names></name> <name><surname>Kantarcioglu</surname> <given-names>M</given-names></name></person-group>. <article-title>Modern privacy-preserving record linkage techniques: an overview</article-title>. <source>IEEE Trans Inf Forensics Secur</source>. (<year>2021</year>) <volume>16</volume>:<fpage>4966</fpage>&#x2013;<lpage>87</lpage>. <pub-id pub-id-type="doi">10.1109/TIFS.2021.3114026</pub-id></mixed-citation></ref>
<ref id="B9"><label>9.</label><mixed-citation publication-type="book"><person-group person-group-type="author"><name><surname>Christen</surname> <given-names>P</given-names></name> <name><surname>Ranbaduge</surname> <given-names>T</given-names></name> <name><surname>Schnell</surname> <given-names>R</given-names></name></person-group>. <source>Linking Sensitive Data</source>. <publisher-loc>Cham</publisher-loc>: <publisher-name>Springer</publisher-name> (<year>2020</year>).</mixed-citation></ref>
<ref id="B10"><label>10.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Karakasidis</surname> <given-names>A</given-names></name> <name><surname>Verykios</surname> <given-names>V</given-names></name></person-group>. <article-title>Secure blocking&#x002B;secure matching&#x003D;secure record linkage</article-title>. <source>J Comput Sci Eng</source>. (<year>2011</year>) <volume>5</volume>:<fpage>223</fpage>&#x2013;<lpage>35</lpage>. <pub-id pub-id-type="doi">10.5626/JCSE.2011.5.3.223</pub-id></mixed-citation></ref>
<ref id="B11"><label>11.</label><mixed-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Etienne</surname> <given-names>B</given-names></name> <name><surname>Cheatham</surname> <given-names>M</given-names></name> <name><surname>Grzebala</surname> <given-names>P</given-names></name></person-group>. <article-title>An analysis of blocking methods for private record linkage</article-title>. <conf-name>AAAI Fall Symposia</conf-name> (<year>2016</year>). p. <fpage>244</fpage>&#x2013;<lpage>8</lpage></mixed-citation></ref>
<ref id="B12"><label>12.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Dusserre</surname> <given-names>L</given-names></name> <name><surname>Quantin</surname> <given-names>C</given-names></name> <name><surname>Bouzelat</surname> <given-names>H</given-names></name></person-group>. <article-title>A one way public key cryptosystem for the linkage of nominal files in epidemiological studies</article-title>. <source>Medinfo</source>. (<year>1995</year>) <volume>8</volume>(<issue>Pt 1</issue>):<fpage>644</fpage>&#x2013;<lpage>7</lpage>.<pub-id pub-id-type="pmid">8591288</pub-id></mixed-citation></ref>
<ref id="B13"><label>13.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Quantin</surname> <given-names>C</given-names></name> <name><surname>Bouzelat</surname> <given-names>H</given-names></name> <name><surname>Allaert</surname> <given-names>FA</given-names></name> <name><surname>Benhamiche</surname> <given-names>AM</given-names></name> <name><surname>Faivre</surname> <given-names>J</given-names></name> <name><surname>Dusserre</surname> <given-names>L</given-names></name></person-group>. <article-title>How to ensure data security of an epidemiological follow-up: quality assessment of an anonymous record linkage procedure</article-title>. <source>Int J Med Inform</source>. (<year>1998</year>) <volume>49</volume>(<issue>1</issue>):<fpage>117</fpage>&#x2013;<lpage>22</lpage>. <pub-id pub-id-type="doi">10.1016/S1386-5056(98)00019-7</pub-id><pub-id pub-id-type="pmid">9723810</pub-id></mixed-citation></ref>
<ref id="B14"><label>14.</label><mixed-citation publication-type="book"><person-group person-group-type="author"><name><surname>Pang</surname> <given-names>C</given-names></name> <name><surname>Gu</surname> <given-names>L</given-names></name> <name><surname>Hansen</surname> <given-names>D</given-names></name> <name><surname>Maeder</surname> <given-names>A</given-names></name></person-group>. <article-title>Privacy-Preserving fuzzy matching using a public reference table</article-title>. In: <person-group person-group-type="editor"><name><surname>McClean</surname> <given-names>S</given-names></name> <name><surname>Millard</surname> <given-names>P</given-names></name> <name><surname>El-Darzi</surname> <given-names>E</given-names></name> <name><surname>Nugent</surname> <given-names>C</given-names></name></person-group>, editors. <source>Intelligent Patient Management</source>. <publisher-loc>Berlin, Heidelberg</publisher-loc>: <publisher-name>Springer Berlin Heidelberg</publisher-name> (<year>2009</year>). p. <fpage>71</fpage>&#x2013;<lpage>89</lpage>.</mixed-citation></ref>
<ref id="B15"><label>15.</label><mixed-citation publication-type="book"><person-group person-group-type="author"><name><surname>Vatsalan</surname> <given-names>D</given-names></name></person-group>. <source>Scalable and Approximate Privacy-preserving record Linkage</source>. <publisher-loc>Canberra</publisher-loc>: <publisher-name>Australian National University</publisher-name> (<year>2014</year>).</mixed-citation></ref>
<ref id="B16"><label>16.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Scannapieco</surname> <given-names>M</given-names></name> <name><surname>Figotin</surname> <given-names>I</given-names></name> <name><surname>Bertino</surname> <given-names>E</given-names></name> <name><surname>Elmagarmid</surname> <given-names>AK</given-names></name></person-group>. <comment>Privacy preserving schema and data matching</comment>.</mixed-citation></ref>
<ref id="B17"><label>17.</label><mixed-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Yakout</surname> <given-names>M</given-names></name> <name><surname>Atallah</surname> <given-names>MJ</given-names></name> <name><surname>Elmagarmid</surname> <given-names>A</given-names></name></person-group>. <article-title>Efficient private record linkage</article-title>. <conf-name>2009 IEEE 25th International Conference on Data Engineering</conf-name> (<year>2009</year>). p. <fpage>1283</fpage>&#x2013;<lpage>6</lpage></mixed-citation></ref>
<ref id="B18"><label>18.</label><mixed-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Bonomi</surname> <given-names>L</given-names></name> <name><surname>Xiong</surname> <given-names>L</given-names></name> <name><surname>Chen</surname> <given-names>R</given-names></name> <name><surname>Fung</surname> <given-names>BCM</given-names></name></person-group>. <article-title>Frequent grams based embedding for privacy preserving record linkage</article-title>. <conf-name>21st ACM International Conference on Information and Knowledge Management</conf-name> (<year>2012</year>). p. <fpage>1597</fpage>&#x2013;<lpage>601</lpage></mixed-citation></ref>
<ref id="B19"><label>19.</label><mixed-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>He</surname> <given-names>X</given-names></name> <name><surname>Machanavajjhala</surname> <given-names>A</given-names></name> <name><surname>Flynn</surname> <given-names>C</given-names></name> <name><surname>Srivastava</surname> <given-names>D</given-names></name></person-group>. <article-title>Composing differential privacy and secure computation: a case study on scaling private record linkage</article-title>. <conf-name>2017 ACM SIGSAC Conference on Computer and Communications Security</conf-name>; <conf-loc>Dallas, Texas, USA</conf-loc> (<year>2017</year>). p. <fpage>1389</fpage>&#x2013;<lpage>406</lpage></mixed-citation></ref>
<ref id="B20"><label>20.</label><mixed-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Inan</surname> <given-names>A</given-names></name> <name><surname>Kantarcioglu</surname> <given-names>M</given-names></name> <name><surname>Bertino</surname> <given-names>E</given-names></name> <name><surname>Scannapieco</surname> <given-names>M</given-names></name></person-group>. <article-title>A hybrid approach to private record linkage</article-title>. <conf-name>2008 IEEE 24th International Conference on Data Engineering</conf-name> (<year>2008</year>). p. <fpage>496</fpage>&#x2013;<lpage>505</lpage></mixed-citation></ref>
<ref id="B21"><label>21.</label><mixed-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Kuzu</surname> <given-names>M</given-names></name> <name><surname>Kantarcioglu</surname> <given-names>M</given-names></name> <name><surname>Inan</surname> <given-names>A</given-names></name> <name><surname>Bertino</surname> <given-names>E</given-names></name> <name><surname>Durham</surname> <given-names>E</given-names></name> <name><surname>Malin</surname> <given-names>B</given-names></name></person-group>. <article-title>Efficient privacy-aware record integration</article-title>. <conf-name>Adv Database Technol</conf-name> (<year>2013</year>). p. <fpage>167</fpage>&#x2013;<lpage>78</lpage></mixed-citation></ref>
<ref id="B22"><label>22.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Stammler</surname> <given-names>S</given-names></name> <name><surname>Kussel</surname> <given-names>T</given-names></name> <name><surname>Schoppmann</surname> <given-names>P</given-names></name> <name><surname>Stampe</surname> <given-names>F</given-names></name> <name><surname>Tremper</surname> <given-names>G</given-names></name> <name><surname>Katzenbeisser</surname> <given-names>S</given-names></name><etal/></person-group> <article-title>Mainzelliste SecureEpiLinker (MainSEL): privacy-preserving record linkage using secure multi-party computation</article-title>. <source>Bioinformatics</source>. (<year>2022</year>) <volume>38</volume>(<issue>6</issue>):<fpage>1657</fpage>&#x2013;<lpage>68</lpage>. <pub-id pub-id-type="doi">10.1093/bioinformatics/btaa764</pub-id><pub-id pub-id-type="pmid">32871006</pub-id></mixed-citation></ref>
<ref id="B23"><label>23.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Kussel</surname> <given-names>T</given-names></name> <name><surname>Brenner</surname> <given-names>T</given-names></name> <name><surname>Tremper</surname> <given-names>G</given-names></name> <name><surname>Schepers</surname> <given-names>J</given-names></name> <name><surname>Lablans</surname> <given-names>M</given-names></name> <name><surname>Hamacher</surname> <given-names>K</given-names></name></person-group>. <article-title>Record linkage based patient intersection cardinality for rare disease studies using mainzelliste and secure multi-party computation</article-title>. <source>J Transl Med</source>. (<year>2022</year>) <volume>20</volume>(<issue>1</issue>):<fpage>458</fpage>. <pub-id pub-id-type="doi">10.1186/s12967-022-03671-6</pub-id><pub-id pub-id-type="pmid">36209221</pub-id></mixed-citation></ref>
<ref id="B24"><label>24.</label><mixed-citation publication-type="book"><person-group person-group-type="author"><name><surname>Pfleeger</surname> <given-names>CP</given-names></name> <name><surname>Pfleeger</surname> <given-names>SL</given-names></name></person-group>. <source>Security in Computing</source>. <edition>5 edn</edition>. Upper <publisher-loc>Saddle River, NJ</publisher-loc>: <publisher-name>Prentice Hall</publisher-name> (<year>2015</year>).</mixed-citation></ref>
<ref id="B25"><label>25.</label><mixed-citation publication-type="book"><collab>CSIRO&#x2019;s Data61</collab>. <source>Anonlink Private Record Linkage System</source>. <publisher-name>GitHub</publisher-name> (<year>2017</year>).</mixed-citation></ref>
<ref id="B26"><label>26.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Nesbitt</surname> <given-names>GC</given-names></name> <name><surname>Murphy</surname> <given-names>PA</given-names></name></person-group>. <article-title>CRID&#x2014;a unique, universal, patient-generated identifier to facilitate collaborative rare disease clinical research</article-title>. <source>Inform Med Unlocked</source>. (<year>2022</year>) <volume>31</volume>:<fpage>100973</fpage>. <pub-id pub-id-type="doi">10.1016/j.imu.2022.100973</pub-id></mixed-citation></ref>
<ref id="B27"><label>27.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Hampf</surname> <given-names>C</given-names></name> <name><surname>Bialke</surname> <given-names>M</given-names></name> <name><surname>Hund</surname> <given-names>H</given-names></name> <name><surname>Fegeler</surname> <given-names>C</given-names></name> <name><surname>Lang</surname> <given-names>S</given-names></name> <name><surname>Penndorf</surname> <given-names>P</given-names></name><etal/></person-group> <article-title>Federated trusted third party as an approach for privacy preserving record linkage in a large network of university medicines in pandemic research</article-title>. <source>Res Sq.</source> (<year>2021</year>). <pub-id pub-id-type="doi">10.21203/rs.3.rs-1053445/v1</pub-id></mixed-citation></ref>
<ref id="B28"><label>28.</label><mixed-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Karapiperis</surname> <given-names>D</given-names></name> <name><surname>Gkoulalas-Divanis</surname> <given-names>A</given-names></name> <name><surname>Verykios</surname> <given-names>VS</given-names></name></person-group>. <article-title>FEMRL: a framework for large-scale privacy-preserving linkage of Patients&#x2019; electronic health records</article-title></mixed-citation></ref>
<ref id="B29"><label>29.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Jurczyk</surname> <given-names>P</given-names></name> <name><surname>Lu</surname> <given-names>JJ</given-names></name> <name><surname>Xiong</surname> <given-names>L</given-names></name> <name><surname>Cragan</surname> <given-names>JD</given-names></name> <name><surname>Correa</surname> <given-names>A</given-names></name></person-group>. <article-title>FRIL: a tool for comparative record linkage</article-title>. <source>AMIA Annu Symp Proc</source>. (<year>2008</year>) <volume>2008</volume>:<fpage>440</fpage>&#x2013;<lpage>4</lpage>.<pub-id pub-id-type="pmid">18998844</pub-id></mixed-citation></ref>
<ref id="B30"><label>30.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Boyle</surname> <given-names>DI</given-names></name> <name><surname>Rafael</surname> <given-names>N</given-names></name></person-group>. <article-title>Biogrid Australia and GRHANITE&#x2122;: privacy-protecting subject matching</article-title>. <source>Stud Health Technol Inform</source>. (<year>2011</year>) <volume>168</volume>:<fpage>24</fpage>&#x2013;<lpage>34</lpage>.<pub-id pub-id-type="pmid">21893908</pub-id></mixed-citation></ref>
<ref id="B31"><label>31.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Izakian</surname> <given-names>H</given-names></name></person-group>. <article-title>Linkwise: a modern record linkage software application</article-title>. <source>Int J Popul Data Sci</source>. (<year>2018</year>) <volume>3</volume>(<issue>4</issue>). <pub-id pub-id-type="doi">10.23889/ijpds.v3i4.650</pub-id></mixed-citation></ref>
<ref id="B32"><label>32.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Boyd</surname> <given-names>JH</given-names></name> <name><surname>Randall</surname> <given-names>S</given-names></name> <name><surname>Brown</surname> <given-names>AP</given-names></name> <name><surname>Maller</surname> <given-names>M</given-names></name> <name><surname>Botes</surname> <given-names>D</given-names></name> <name><surname>Gillies</surname> <given-names>M</given-names></name><etal/></person-group> <article-title>Population data centre profiles: centre for data linkage</article-title>. <source>Int J Popul Data Sci</source>. (<year>2020</year>) <volume>4</volume>(<issue>2</issue>):<fpage>1139</fpage>. <pub-id pub-id-type="doi">10.23889/ijpds.v4i2.1139</pub-id><pub-id pub-id-type="pmid">32935041</pub-id></mixed-citation></ref>
<ref id="B33"><label>33.</label><mixed-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Karapiperis</surname> <given-names>D</given-names></name> <name><surname>Gkoulalas-Divanis</surname> <given-names>A</given-names></name> <name><surname>Verykios</surname> <given-names>VS</given-names></name></person-group>. <article-title>LSHDB: a parallel and distributed engine for record linkage and similarity search</article-title>. <conf-name>2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW)</conf-name>; <conf-loc>Barcelona, Spain</conf-loc> (<year>2016</year>). p. <fpage>1</fpage>&#x2013;<lpage>4</lpage></mixed-citation></ref>
<ref id="B34"><label>34.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Lablans</surname> <given-names>M</given-names></name> <name><surname>Borg</surname> <given-names>A</given-names></name> <name><surname>&#x00DC;ckert</surname> <given-names>F</given-names></name></person-group>. <article-title>A RESTful interface to pseudonymization services in modern web applications</article-title>. <source>BMC Med Inform Decis Mak</source>. (<year>2015</year>) <volume>15</volume>:<fpage>2</fpage>. <pub-id pub-id-type="doi">10.1186/s12911-014-0123-5</pub-id><pub-id pub-id-type="pmid">25656224</pub-id></mixed-citation></ref>
<ref id="B35"><label>35.</label><mixed-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Vatsalan</surname> <given-names>D</given-names></name> <name><surname>Christen</surname> <given-names>P</given-names></name></person-group>. <article-title>Scalable privacy-preserving record linkage for multiple databases</article-title>. <conf-name>CIKM</conf-name>; <conf-loc>Shanghai, China</conf-loc> (<year>2014</year>). p. <fpage>1795</fpage>&#x2013;<lpage>8</lpage></mixed-citation></ref>
<ref id="B36"><label>36.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Schnell</surname> <given-names>R</given-names></name> <name><surname>Bachteler</surname> <given-names>T</given-names></name> <name><surname>Bender</surname> <given-names>S</given-names></name></person-group>. <article-title>A toolbox for record linkage</article-title>. <source>Austrian J Stat</source>. (<year>2004</year>) <volume>33</volume>(<issue>1&#x2013;2</issue>):<fpage>125</fpage>&#x2013;<lpage>33</lpage>. 10.17713/ajs.v33i1&#x0026;2.434</mixed-citation></ref>
<ref id="B37"><label>37.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Radbone</surname> <given-names>C</given-names></name> <name><surname>Farrow</surname> <given-names>J</given-names></name></person-group>. <article-title>Preserving privacy in the face of clients with different data needs using the NGLMS</article-title>. <source>Int J Popul Data Sci</source>. (<year>2017</year>) <volume>1</volume>(<issue>1</issue>):<fpage>257</fpage>. <pub-id pub-id-type="doi">10.23889/ijpds.v1i1.277</pub-id></mixed-citation></ref>
<ref id="B38"><label>38.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Rubinstein</surname> <given-names>YR</given-names></name> <name><surname>McInnes</surname> <given-names>P</given-names></name></person-group>. <article-title>NIH/NCATS/GRDR&#x00AE; common data elements: a leading force for standardized data collection</article-title>. <source>Contemp Clin Trials</source>. (<year>2015</year>) <volume>42</volume>:<fpage>78</fpage>&#x2013;<lpage>80</lpage>. <pub-id pub-id-type="doi">10.1016/j.cct.2015.03.003</pub-id><pub-id pub-id-type="pmid">25797358</pub-id></mixed-citation></ref>
<ref id="B39"><label>39.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Bian</surname> <given-names>J</given-names></name> <name><surname>Loiacono</surname> <given-names>A</given-names></name> <name><surname>Sura</surname> <given-names>A</given-names></name> <name><surname>Mendoza Viramontes</surname> <given-names>T</given-names></name> <name><surname>Lipori</surname> <given-names>G</given-names></name> <name><surname>Guo</surname> <given-names>Y</given-names></name><etal/></person-group> <article-title>Implementing a hash-based privacy-preserving record linkage tool in the OneFlorida clinical research network</article-title>. <source>JAMIA Open</source>. (<year>2019</year>) <volume>2</volume>(<issue>4</issue>):<fpage>562</fpage>&#x2013;<lpage>9</lpage>. <pub-id pub-id-type="doi">10.1093/jamiaopen/ooz050</pub-id><pub-id pub-id-type="pmid">32025654</pub-id></mixed-citation></ref>
<ref id="B40"><label>40.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Ghai</surname> <given-names>T</given-names></name> <name><surname>Yao</surname> <given-names>Y</given-names></name> <name><surname>Ravi</surname> <given-names>S</given-names></name> <name><surname>Szekely</surname> <given-names>P</given-names></name></person-group>. <comment>Evaluating the Feasibility of a Provably Secure Privacy-Preserving Entity Resolution Adaptation of PPJoin using Homomorphic Encryption. <italic>arxiv.org</italic></comment>. (<year>2022</year>).</mixed-citation></ref>
<ref id="B41"><label>41.</label><mixed-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Karakasidis</surname> <given-names>A</given-names></name> <name><surname>Koloniari</surname> <given-names>G</given-names></name> <name><surname>Verykios</surname> <given-names>VS</given-names></name></person-group>. <article-title>PRIVATEER: a private record linkage toolkit</article-title>. <conf-name>CAiSE Forum</conf-name> (<year>2015</year>).</mixed-citation></ref>
<ref id="B42"><label>42.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Toth</surname> <given-names>C</given-names></name> <name><surname>Durham</surname> <given-names>E</given-names></name> <name><surname>Kantarcioglu</surname> <given-names>M</given-names></name> <name><surname>Xue</surname> <given-names>Y</given-names></name> <name><surname>Malin</surname> <given-names>B</given-names></name></person-group>. <article-title>SOEMPI: a secure open enterprise master patient Index software toolkit for private record linkage</article-title>. <source>AMIA Annu Symp Proc</source>. (<year>2014</year>) <volume>2014</volume>:<fpage>1105</fpage>&#x2013;<lpage>14</lpage>.<pub-id pub-id-type="pmid">25954421</pub-id></mixed-citation></ref>
<ref id="B43"><label>43.</label><mixed-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Elfeky</surname> <given-names>MG</given-names></name> <name><surname>Verykios</surname> <given-names>VS</given-names></name> <name><surname>Elmagarmid</surname> <given-names>AK</given-names></name></person-group>. <article-title>TAILOR: a record linkage toolbox</article-title>. <conf-name>Proceedings 18th International Conference on Data Engineering</conf-name>). p. <fpage>17</fpage>&#x2013;<lpage>28</lpage></mixed-citation></ref>
<ref id="B44"><label>44.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Nitzlnader</surname> <given-names>M</given-names></name> <name><surname>Schreier</surname> <given-names>G</given-names></name></person-group>. <article-title>Patient identity management for secondary use of biomedical research data in a distributed computing environment</article-title>. <source>Stud Health Technol Inform</source>. (<year>2014</year>) <volume>198</volume>:<fpage>211</fpage>&#x2013;<lpage>8</lpage>. <pub-id pub-id-type="doi">10.3233/978-1-61499-397-1-211</pub-id><pub-id pub-id-type="pmid">24825705</pub-id></mixed-citation></ref>
<ref id="B45"><label>45.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Rivest</surname> <given-names>RL</given-names></name></person-group>. <comment>The MD5 Message-Digest Algorithm</comment> (<year>1992</year>). <comment>Available online at:</comment> <ext-link ext-link-type="uri" xlink:href="https://www.rfc-editor.org/rfc/rfc1321">https://www.rfc-editor.org/rfc/rfc1321</ext-link> <comment>(Accessed January 26, 2026)</comment>.</mixed-citation></ref>
<ref id="B46"><label>46.</label><mixed-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Bellare</surname> <given-names>M</given-names></name> <name><surname>Canetti</surname> <given-names>R</given-names></name> <name><surname>Krawczyk</surname> <given-names>H</given-names></name></person-group>. <article-title>Keying hash functions for message authentication</article-title>. <conf-name>16th Annual International Cryptology Conference on Advances in Cryptology (CRYPTO &#x2018;96)</conf-name> (<year>1996</year>). p. <fpage>1</fpage>&#x2013;<lpage>15</lpage></mixed-citation></ref>
<ref id="B47"><label>47.</label><mixed-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Biryukov</surname> <given-names>A</given-names></name> <name><surname>Dinu</surname> <given-names>D</given-names></name> <name><surname>Khovratovich</surname> <given-names>D</given-names></name></person-group>. <article-title>Argon2: new generation of memory-hard functions for password hashing and other applications</article-title>. <conf-name>2016 IEEE European Symposium on Security and Privacy (EuroS&#x0026;P)</conf-name> (<year>2016</year>).</mixed-citation></ref>
<ref id="B48"><label>48.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Postel</surname> <given-names>HJ</given-names></name></person-group>. <article-title>Die K&#x00F6;lner Phonetik. Ein Verfahren zur Identifizierung von Personennamen auf der Grundlage der Gestaltanalyse</article-title>. <source>IBM-Nachrichten</source>. (<year>1969</year>) <volume>19</volume>:<fpage>925</fpage>&#x2013;<lpage>31</lpage>.</mixed-citation></ref>
<ref id="B49"><label>49.</label><mixed-citation publication-type="book"><person-group person-group-type="author"><name><surname>Knuth</surname> <given-names>DE</given-names></name></person-group>. <source>The Art of Computer Programming</source>. <publisher-loc>Redwood City, CA</publisher-loc>: <publisher-name>Addison-Wesley</publisher-name> (<year>1973</year>).</mixed-citation></ref>
<ref id="B50"><label>50.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Schnell</surname> <given-names>R</given-names></name> <name><surname>Bachteler</surname> <given-names>T</given-names></name> <name><surname>Reiher</surname> <given-names>J</given-names></name></person-group>. <article-title>Privacy-preserving record linkage using Bloom filters</article-title>. <source>BMC Med Inform Decis Mak</source>. (<year>2009</year>) <volume>9</volume>:<fpage>41</fpage>. <pub-id pub-id-type="doi">10.1186/1472-6947-9-41</pub-id><pub-id pub-id-type="pmid">19706187</pub-id></mixed-citation></ref>
<ref id="B51"><label>51.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Schnell</surname> <given-names>R</given-names></name> <name><surname>Bachteler</surname> <given-names>T</given-names></name> <name><surname>Reiher</surname> <given-names>J</given-names></name></person-group>. <comment>A Novel Error-Tolerant Anonymous Linking Code. SSRN</comment> (<year>2011</year>).</mixed-citation></ref>
<ref id="B52"><label>52.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Demelius</surname> <given-names>L</given-names></name> <name><surname>Kreiner</surname> <given-names>K</given-names></name> <name><surname>Hayn</surname> <given-names>D</given-names></name> <name><surname>Nitzlnader</surname> <given-names>M</given-names></name> <name><surname>Schreier</surname> <given-names>G</given-names></name></person-group>. <article-title>Encoding of numerical data for privacy-preserving record linkage</article-title>. <source>Stud Health Technol Inform</source>. (<year>2020</year>) <volume>271</volume>:<fpage>23</fpage>&#x2013;<lpage>30</lpage>. <pub-id pub-id-type="doi">10.3233/SHTI200070</pub-id><pub-id pub-id-type="pmid">32578537</pub-id></mixed-citation></ref>
<ref id="B53"><label>53.</label><mixed-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Indyk</surname> <given-names>P</given-names></name> <name><surname>Motwani</surname> <given-names>R</given-names></name></person-group>. <article-title>Approximate nearest neighbors: towards removing the curse of dimensionality</article-title>, pp. <fpage>604</fpage>&#x2013;<lpage>13</lpage>.</mixed-citation></ref>
<ref id="B54"><label>54.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Hayn</surname> <given-names>D</given-names></name> <name><surname>Sandner</surname> <given-names>E</given-names></name> <name><surname>Vengadeswaran</surname> <given-names>A</given-names></name> <name><surname>T&#x00E3;taru</surname> <given-names>EA</given-names></name> <name><surname>Wilkinson</surname> <given-names>M</given-names></name> <name><surname>Hanauer</surname> <given-names>M</given-names></name><etal/></person-group> <article-title>Privacy-Preserving linkage of distributed pseudonymised datasets in a virtual European rare disease platform</article-title>. <source>Stud Health Technol Inform</source>. (<year>2024</year>) <volume>316</volume>:<fpage>1442</fpage>&#x2013;<lpage>6</lpage>. <pub-id pub-id-type="doi">10.3233/SHTI240683</pub-id><pub-id pub-id-type="pmid">39176652</pub-id></mixed-citation></ref>
<ref id="B55"><label>55.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Ebner</surname> <given-names>H</given-names></name> <name><surname>Hayn</surname> <given-names>D</given-names></name> <name><surname>Falgenhauer</surname> <given-names>M</given-names></name> <name><surname>Nitzlnader</surname> <given-names>M</given-names></name> <name><surname>Schleiermacher</surname> <given-names>G</given-names></name> <name><surname>Haupt</surname> <given-names>R</given-names></name><etal/></person-group> <article-title>Piloting the European unified patient identity management (EUPID) concept to facilitate secondary use of neuroblastoma data from clinical trials and biobanking</article-title>. <source>Stud Health Technol Inform</source>. (<year>2016</year>) <volume>223</volume>:<fpage>31</fpage>&#x2013;<lpage>8</lpage>. <pub-id pub-id-type="doi">10.3233/978-1-61499-645-3-31</pub-id><pub-id pub-id-type="pmid">27139382</pub-id></mixed-citation></ref>
<ref id="B56"><label>56.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Hayn</surname> <given-names>D</given-names></name> <name><surname>Sandner</surname> <given-names>E</given-names></name> <name><surname>Jammerbund</surname> <given-names>B</given-names></name> <name><surname>Okuyan</surname> <given-names>ES</given-names></name> <name><surname>Koster</surname> <given-names>J</given-names></name> <name><surname>Wittens</surname> <given-names>MMJ</given-names></name><etal/></person-group> <article-title>MONALISA: a privacy-preserving infrastructure supporting liquid biopsies to monitor relapsed neuroblastoma</article-title>. <source>Stud Health Technol Inform</source>. (<year>2025</year>) <volume>327</volume>:<fpage>773</fpage>&#x2013;<lpage>4</lpage>. <pub-id pub-id-type="doi">10.3233/SHTI250462</pub-id><pub-id pub-id-type="pmid">40380571</pub-id></mixed-citation></ref>
<ref id="B57"><label>57.</label><mixed-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Hayn</surname> <given-names>D</given-names></name> <name><surname>Sandner</surname> <given-names>E</given-names></name> <name><surname>Jammerbund</surname> <given-names>B</given-names></name> <name><surname>Zalatnai</surname> <given-names>L</given-names></name> <name><surname>Papakonstantinou</surname> <given-names>A</given-names></name> <name><surname>Beltran</surname> <given-names>S</given-names></name><etal/></person-group> <article-title>Privacy-Preserving record linkage between the SIOPEN BIOPORTAL and the RD-connect genome phenome analysis platform via the EUPID services</article-title>. <conf-name>Europe Biobank Week</conf-name>; <conf-date>Vienna</conf-date> (<year>2024</year>).</mixed-citation></ref>
<ref id="B58"><label>58.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Hayn</surname> <given-names>D</given-names></name> <name><surname>Falgenhauer</surname> <given-names>M</given-names></name> <name><surname>Kropf</surname> <given-names>M</given-names></name> <name><surname>Nitzlnader</surname> <given-names>M</given-names></name> <name><surname>Welte</surname> <given-names>S</given-names></name> <name><surname>Ebner</surname> <given-names>H</given-names></name><etal/></person-group> <article-title>IT Infrastructure for merging data from different clinical trials and across independent research networks</article-title>. <source>Stud Health Technol Inform</source>. (<year>2016</year>) <volume>228</volume>:<fpage>287</fpage>&#x2013;<lpage>91</lpage>.<pub-id pub-id-type="pmid">27577389</pub-id></mixed-citation></ref>
<ref id="B59"><label>59.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Veiga-Canuto</surname> <given-names>D</given-names></name> <name><surname>Cerd&#x00E1; Alberich</surname> <given-names>L</given-names></name> <name><surname>Fern&#x00E1;ndez-Pat&#x00F3;n</surname> <given-names>M</given-names></name> <name><surname>Jim&#x00E9;nez Pastor</surname> <given-names>A</given-names></name> <name><surname>Lozano-Montoya</surname> <given-names>J</given-names></name> <name><surname>Miguel Blanco</surname> <given-names>A</given-names></name><etal/></person-group> <article-title>Imaging biomarkers and radiomics in pediatric oncology: a view from the PRIMAGE (PRedictive in silico multiscale analytics to support cancer personalized diaGnosis and prognosis, empowered by imaging biomarkers) project</article-title>. <source>Pediatr Radiol</source>. (<year>2024</year>) <volume>54</volume>(<issue>4</issue>):<fpage>562</fpage>&#x2013;<lpage>70</lpage>. <pub-id pub-id-type="doi">10.1007/s00247-023-05770-y</pub-id><pub-id pub-id-type="pmid">37747582</pub-id></mixed-citation></ref>
<ref id="B60"><label>60.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Veiga-Canuto</surname> <given-names>D</given-names></name> <name><surname>Cerd&#x00E0;-Alberich</surname> <given-names>L</given-names></name> <name><surname>Jim&#x00E9;nez-Pastor</surname> <given-names>A</given-names></name> <name><surname>Carot Sierra</surname> <given-names>JM</given-names></name> <name><surname>Gomis-Maya</surname> <given-names>A</given-names></name> <name><surname>Sang&#x00FC;esa-Nebot</surname> <given-names>C</given-names></name><etal/></person-group> <article-title>Independent validation of a deep learning nnU-net tool for neuroblastoma detection and segmentation in MR images</article-title>. <source>Cancers (Basel)</source>. (<year>2023</year>) <volume>15</volume>(<issue>5</issue>):<fpage>1622</fpage>. <pub-id pub-id-type="doi">10.3390/cancers15051622</pub-id><pub-id pub-id-type="pmid">36900410</pub-id></mixed-citation></ref>
<ref id="B61"><label>61.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Hayn</surname> <given-names>D</given-names></name> <name><surname>Kreiner</surname> <given-names>K</given-names></name> <name><surname>Sandner</surname> <given-names>E</given-names></name> <name><surname>Baumgartner</surname> <given-names>M</given-names></name> <name><surname>Jammerbund</surname> <given-names>B</given-names></name> <name><surname>Falgenhauer</surname> <given-names>M</given-names></name><etal/></person-group> <article-title>Use cases requiring privacy-preserving record linkage in paediatric Oncology</article-title>. <source>Cancers (Basel)</source>. (<year>2024</year>) <volume>16</volume>(<issue>15</issue>):<fpage>2696</fpage>. <pub-id pub-id-type="doi">10.3390/cancers16152696</pub-id><pub-id pub-id-type="pmid">39123424</pub-id></mixed-citation></ref>
<ref id="B62"><label>62.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Donsa</surname> <given-names>K</given-names></name> <name><surname>Kreiner</surname> <given-names>K</given-names></name> <name><surname>Hayn</surname> <given-names>D</given-names></name> <name><surname>Rzepka</surname> <given-names>A</given-names></name> <name><surname>Ovejero</surname> <given-names>S</given-names></name> <name><surname>Topolnik</surname> <given-names>M</given-names></name><etal/></person-group> <article-title>Smart FOX&#x2014;enabling citizen-based donation of EHR-standardised data for clinical research in Austria</article-title>. <source>Stud Health Technol Inform</source>. (<year>2024</year>) <volume>316</volume>:<fpage>83</fpage>&#x2013;<lpage>7</lpage>. <pub-id pub-id-type="doi">10.3233/SHTI240351</pub-id><pub-id pub-id-type="pmid">39176680</pub-id></mixed-citation></ref>
<ref id="B63"><label>63.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Baumgartner</surname> <given-names>M</given-names></name> <name><surname>Kreiner</surname> <given-names>K</given-names></name> <name><surname>Lauschensky</surname> <given-names>A</given-names></name> <name><surname>Jammerbund</surname> <given-names>B</given-names></name> <name><surname>Donsa</surname> <given-names>K</given-names></name> <name><surname>Hayn</surname> <given-names>D</given-names></name><etal/></person-group> <article-title>Health data space nodes for privacy-preserving linkage of medical data to support collaborative secondary analyses</article-title>. <source>Front Med (Lausanne)</source>. (<year>2024</year>) <volume>11</volume>:<fpage>1301660</fpage>. <pub-id pub-id-type="doi">10.3389/fmed.2024.1301660</pub-id><pub-id pub-id-type="pmid">38660421</pub-id></mixed-citation></ref>
<ref id="B64"><label>64.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>F&#x00F6;rster</surname> <given-names>A</given-names></name> <name><surname>Davenport</surname> <given-names>C</given-names></name> <name><surname>Duployez</surname> <given-names>N</given-names></name> <name><surname>Erlacher</surname> <given-names>M</given-names></name> <name><surname>Ferster</surname> <given-names>A</given-names></name> <name><surname>Fitzgibbon</surname> <given-names>J</given-names></name><etal/></person-group> <article-title>European Standard clinical practice&#x2014;key issues for the medical care of individuals with familial leukemia</article-title>. <source>Eur J Med Genet</source>. (<year>2023</year>) <volume>66</volume>(<issue>4</issue>):<fpage>104727</fpage>. <pub-id pub-id-type="doi">10.1016/j.ejmg.2023.104727</pub-id></mixed-citation></ref>
<ref id="B65"><label>65.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Tyagi</surname> <given-names>K</given-names></name> <name><surname>Willis</surname> <given-names>SJ</given-names></name></person-group>. <article-title>Accuracy of privacy preserving record linkage for real world data in the United States: a systematic review</article-title>. <source>JAMIA Open</source>. (<year>2025</year>) <volume>8</volume>(<issue>1</issue>):<fpage>ooaf002</fpage>. <pub-id pub-id-type="doi">10.1093/jamiaopen/ooaf002</pub-id><pub-id pub-id-type="pmid">39845287</pub-id></mixed-citation></ref>
<ref id="B66"><label>66.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Philips</surname> <given-names>L</given-names></name></person-group>. <article-title>The double metaphone search algorithm</article-title>. <source>C/C&#x002B;&#x002B; Users J</source>. (<year>2000</year>) <volume>18</volume>(<issue>6</issue>):<fpage>38</fpage>&#x2013;<lpage>43</lpage>.</mixed-citation></ref>
<ref id="B67"><label>67.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Jeanson</surname> <given-names>F</given-names></name> <name><surname>Gibson</surname> <given-names>SJ</given-names></name> <name><surname>Alper</surname> <given-names>P</given-names></name> <name><surname>Bernier</surname> <given-names>A</given-names></name> <name><surname>Woolley</surname> <given-names>JP</given-names></name> <name><surname>Mietchen</surname> <given-names>D</given-names></name><etal/></person-group> <article-title>Getting your DUCs in a row&#x2014;standardising the representation of digital use conditions</article-title>. <source>Sci Data</source>. (<year>2024</year>) <volume>11</volume>(<issue>1</issue>):<fpage>464</fpage>. <pub-id pub-id-type="doi">10.1038/s41597-024-03280-6</pub-id><pub-id pub-id-type="pmid">38719839</pub-id></mixed-citation></ref>
<ref id="B68"><label>68.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Sanchez Gonzalez</surname> <given-names>MDC</given-names></name> <name><surname>Kamerling</surname> <given-names>P</given-names></name> <name><surname>Iermito</surname> <given-names>M</given-names></name> <name><surname>Casati</surname> <given-names>S</given-names></name> <name><surname>Riaz</surname> <given-names>U</given-names></name> <name><surname>Veal</surname> <given-names>CD</given-names></name><etal/></person-group> <article-title>Common conditions of use elements. Atomic concepts for consistent and effective information governance</article-title>. <source>Sci Data</source>. (<year>2024</year>) <volume>11</volume>(<issue>1</issue>):<fpage>465</fpage>. <pub-id pub-id-type="doi">10.1038/s41597-024-03279-z</pub-id><pub-id pub-id-type="pmid">38719810</pub-id></mixed-citation></ref>
<ref id="B69"><label>69.</label><mixed-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Fabian Wiesmueller</surname> <given-names>DH</given-names></name> <name><surname>Kreiner</surname> <given-names>K</given-names></name> <name><surname>Schreier</surname> <given-names>G</given-names></name></person-group>. <article-title>Use of QR codes in a Mobile app to support privacy-preserving record linkage via the EUPID services</article-title>. <conf-name>GMDS 2022&#x2014;german Medical Informatics Assoc. Conference</conf-name> (<year>2022</year>).</mixed-citation></ref>
<ref id="B70"><label>70.</label><mixed-citation publication-type="other"><collab>O. H. D. S. a. I. Community</collab>. <comment>The OMOP Common Data Model: Standardizing Observational Healthcare Data for Large-Scale Analytics</comment> (<year>2025</year>).</mixed-citation></ref>
<ref id="B71"><label>71.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Han</surname> <given-names>S</given-names></name> <name><surname>Shen</surname> <given-names>K</given-names></name> <name><surname>Shen</surname> <given-names>D</given-names></name> <name><surname>Wang</surname> <given-names>C</given-names></name></person-group>. <article-title>Enhanced multi-party privacy-preserving record linkage using trusted execution environments</article-title>. <source>Mathematics</source>. (<year>2024</year>) <volume>12</volume>(<issue>15</issue>):<fpage>2337</fpage>. <pub-id pub-id-type="doi">10.3390/math12152337</pub-id></mixed-citation></ref>
<ref id="B72"><label>72.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Han</surname> <given-names>S</given-names></name> <name><surname>Wang</surname> <given-names>Y</given-names></name> <name><surname>Shen</surname> <given-names>D</given-names></name> <name><surname>Wang</surname> <given-names>C</given-names></name></person-group>. <article-title>A multi-party privacy-preserving record linkage method based on secondary encoding</article-title>. <source>Mathematics</source>. (<year>2024</year>) <volume>12</volume>(<issue>12</issue>):<fpage>1800</fpage>. <pub-id pub-id-type="doi">10.3390/math12121800</pub-id></mixed-citation></ref>
<ref id="B73"><label>73.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Han</surname> <given-names>S</given-names></name> <name><surname>Wang</surname> <given-names>Z</given-names></name> <name><surname>Shen</surname> <given-names>D</given-names></name> <name><surname>Wang</surname> <given-names>C</given-names></name></person-group>. <article-title>A parallel multi-party privacy-preserving record linkage method based on a consortium blockchain</article-title>. <source>Mathematics</source>. (<year>2024</year>) <volume>12</volume>(<issue>12</issue>):<fpage>1854</fpage>. <pub-id pub-id-type="doi">10.3390/math12121854</pub-id></mixed-citation></ref></ref-list>
<fn-group>
<fn id="n1" fn-type="custom" custom-type="edited-by"><p>Edited by: <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/3134899/overview">Luis Marco Ruiz</ext-link>, Vitagroup AG, Germany</p></fn>
<fn id="n2" fn-type="custom" custom-type="reviewed-by"><p>Reviewed by: <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/761623/overview">Maria Judit Molnar</ext-link>, Semmelweis University, Hungary</p>
<p><ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/3099601/overview">Karapet Davtyan</ext-link>, WHO Regional Office for Europe, Denmark</p></fn>
</fn-group>
</back>
</article>