A Federated Record Linkage Algorithm for Secure Medical Data Sharing

The process of consolidating medical records from multiple institutions into one data set makes privacy-preserving record linkage (PPRL) a necessity. Most PPRL approaches, however, are only designed to link records from two institutions, and existing multi-party approaches tend to discard non-matching records, leading to incomplete result sets. In this paper, we propose a new algorithm for federated record linkage between multiple parties by a trusted third party using record-level bloom filters to preserve patient data privacy. We conduct a study to find optimal weights for linkage-relevant data fields and are able to achieve 99.5% linkage accuracy testing on the Febrl record linkage dataset. This approach is integrated into an end-to-end pseudonymization framework for medical data sharing.

[1]  Peter Christen,et al.  Precise and Fast Cryptanalysis for Bloom Filter Based Privacy-Preserving Record Linkage , 2019, IEEE Transactions on Knowledge and Data Engineering.

[2]  C. Dieterich,et al.  HiGHmed – An Open Platform Approach to Enhance Care and Research across Institutional Boundaries , 2018, Methods of Information in Medicine.

[3]  Hans-Ulrich Prokosch,et al.  Implementation of a National Framework to Promote Health Data Sharing , 2018, Yearbook of Medical Informatics.

[4]  Rinku Dewri,et al.  A graph traversal attack on Bloom filter-based medical data aggregation , 2017, Int. J. Big Data Intell..

[5]  Peter Christen,et al.  Efficient Cryptanalysis of Bloom Filters for Privacy-Preserving Record Linkage , 2017, PAKDD.

[6]  Martin Lablans,et al.  A RESTful interface to pseudonymization services in modern web applications , 2015, BMC Medical Informatics and Decision Making.

[7]  REGULATION (EU) 2019/518 OF THE EUROPEAN PARLIAMENT AND OF THE COUNCIL , 2015 .

[8]  Rainer Schnell,et al.  Cryptanalysis of Basic Bloom Filters Used for Privacy Preserving Record Linkage , 2014, J. Priv. Confidentiality.

[9]  Murat Kantarcioglu,et al.  Composite Bloom Filters for Secure Record Linkage , 2014, IEEE Transactions on Knowledge and Data Engineering.

[10]  Peter Christen,et al.  Scalable Privacy-Preserving Record Linkage for Multiple Databases , 2014, CIKM.

[11]  W. Marsden I and J , 2012 .

[12]  Rainer Schnell,et al.  A Novel Error-Tolerant Anonymous Linking Code , 2011 .

[13]  Rainer Schnell,et al.  Bmc Medical Informatics and Decision Making Privacy-preserving Record Linkage Using Bloom Filters , 2022 .

[14]  Michael Mitzenmacher,et al.  Less hashing, same performance: Building a better Bloom filter , 2006, Random Struct. Algorithms.

[15]  P Crosignani,et al.  The EpiLink Record Linkage Software , 2005, Methods of Information in Medicine.

[16]  John Viega,et al.  The Security and Performance of the Galois/Counter Mode (GCM) of Operation , 2004, INDOCRYPT.

[17]  Peter Christen,et al.  Febrl - A Parallel Open Source Data Linkage System: http://datamining.anu.edu.au/linkage.html , 2004, PAKDD.

[18]  Andrei Broder,et al.  Network Applications of Bloom Filters: A Survey , 2004, Internet Math..