Privacy preserving record linkage approaches

被引:23
作者
Verykios, Vassilios S. [1 ]
Karakasidis, Alexandros [1 ]
Mitrogiannis, Vassilios K. [2 ]
机构
[1] Univ Thessaly, Sch Engn, Dept Comp & Commun Engn, Glavani 37 & 28th Octovriou St, Volos GR-38221, Greece
[2] SingularLog S A, Athens GR-14234, Greece
关键词
data integration; privacy preserving record linkage; cryptography;
D O I
10.1504/IJDMMM.2009.026076
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Privacy-preserving record linkage is a very important task, mostly because of the very sensitive nature of the personal data. The main focus in this task is to find a way to match records from among different organisation data sets or databases without revealing competitive or personal information to non-owners. Towards accomplishing this task, several methods and protocols have been proposed. In this work, we propose a certain methodology for preserving the privacy of various record linkage approaches and we implement, examine and compare four pairs of privacy preserving record linkage methods and protocols. Two of these protocols use n-gram based similarity comparison techniques, the third protocol uses the well known edit distance and the fourth one implements the Jaro-Winkler distance metric. All of the protocols used are enhanced by private key cryptography and hash encoding. This paper presents also a blocking scheme as an extension to the privacy preserving record linkage methodology. Our comparison is backed up by extended experimental evaluation that demonstrates the performance achieved by each of the proposed protocols.
引用
收藏
页码:206 / 221
页数:16
相关论文
共 31 条
[1]  
Al-Lawati A., 2005, P IQIS 05 BALT MD US
[2]  
Baxter R., 2003, P 1 WORKSH DAT CLEAN
[3]  
Bilenko M, 2006, IEEE DATA MINING, P87
[4]  
Christen P, 2005, LECT NOTES COMPUT SC, V3578, P109
[5]  
Christen P., 2006, P WORKSH PRIV ASP DA
[6]  
Christen P., 2005, FEBRL RELEASE 0 3
[7]  
Churches T, 2004, LECT NOTES ARTIF INT, V3056, P121
[8]  
Clifton C., 2004, P 9 ACM SIGMOD WORKS, P19, DOI [10.1145/1008694.1008698, DOI 10.1145/1008694.1008698]
[9]  
Cohen W.W., 2003, P KDD 2003 WORKSH DA, P13
[10]  
ELFEKY M, 2002, P 18 INT C DAT ENG I