This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2012 IEEE 12th International Conference on Data Mining Workshops
A Sorted Neighborhood Approach to Multidimensional Privacy Preserving Blocking
Brussels, Belgium Belgium
December 10-December 10
ISBN: 978-1-4673-5164-5
Privacy Preserving Record Linkage is an emerging field of research which aims to integrate data from heterogeneous data sources while respecting privacy. It is evident that this task exhibits high computational complexity, therefore Privacy Preserving Blocking has been introduced in order to improve performance by eliminating unrelated candidate pairs. In this paper we present a solution to this problem by introducing the Sorted Neighborhood for Encrypted Fields algorithm and combining it with a secure multidimensional privacy preserving blocking method. Our approach is applicable to all types of data fields and manages to significantly boost the Privacy Preserving Record Linkage process without sacrificing matching accuracy. We analytically prove that our method is secure and we also provide empirical evidence where the high performance of our method is established by comparing it to other established methods.
Index Terms:
Privacy,Couplings,Clustering algorithms,Data privacy,Encryption,Measurement,blocking,sortedneighborhood,privacy,record linkage,performance,data integration
Citation:
Alexandros Karakasidis, Vassilios S. Verykios, "A Sorted Neighborhood Approach to Multidimensional Privacy Preserving Blocking," icdmw, pp.937-944, 2012 IEEE 12th International Conference on Data Mining Workshops, 2012
Usage of this product signifies your acceptance of the Terms of Use.