Privacy-preserving record linkage using Bloom filters.
BACKGROUND
Combining multiple databases with disjunctive or additional information on the same person is occurring increasingly throughout research. If unique identification numbers for these individuals are not available, probabilistic record linkage is used for the identification of matching record pairs. In many applications, identifiers have to be encrypted due to privacy concerns.


METHODS
A new protocol for privacy-preserving record linkage with encrypted identifiers allowing for errors in identifiers has been developed. The protocol is based on Bloom filters on q-grams of identifiers.


RESULTS
Tests on simulated and actual databases yield linkage results comparable to non-encrypted identifiers and superior to results from phonetic encodings.


CONCLUSIONS
We proposed a protocol for privacy-preserving record linkage with encrypted identifiers allowing for errors in identifiers. Since the protocol can be easily enhanced and has a low computational burden, the protocol might be useful for many applications requiring privacy-preserving record linkage.
Schnell
Rainer
R
Methodology Research Unit, Department of Social Sciences, University of Duisburg-Essen, D-47057 Duisburg, Germany. Rainer.Schnell@uni-due.de
Bachteler
Tobias
T
Reiher
Jörg
J
D000465:Algorithms; D008498:Medical Record Linkage / Q000592:standards*; D016347:Medical Records Systems, Computerized / Q000458:organization & administration*; D018907:Privacy; D011381:Programming Languages
Methods Inf Med. 2005;44(1):72-9
15778797
Arch Pathol Lab Med. 2004 Mar;128(3):344-6
14987147
Comput Biomed Res. 1992 Oct;25(5):486-509
1395524
BMC Med Inform Decis Mak. 2004 Jun 28;4:9
15222890
Proc AMIA Annu Fall Symp. 1996;:323-7
8947681