Paper Info
Title
A Sorted Neighborhood Approach to Multidimensional Privacy Preserving Blocking
Abstract
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.
Year
DOI
Venue
2012
10.1109/ICDMW.2012.70
ICDM Workshops
Keywords
Field
DocType
computational complexity,cryptography,data integration,data privacy,distributed databases,performance evaluation,sorting,computational complexity,data integration,encrypted fields algorithm,heterogeneous data sources,matching accuracy,multidimensional privacy preserving blocking,performance improvement,privacy preserving record linkage process,sorted neighborhood approach,blocking,data integration,performance,privacy,record linkage,sortedneighborhood
Data integration,Data mining,Computer science,Cryptography,Encryption,Data type,Distributed database,Cluster analysis,Information privacy,Computational complexity theory
Conference
ISSN
Citations 
PageRank 
2375-9232
11
0.55
References 
Authors
14
2
Name
Order
Citations
PageRank
Alexandros Karakasidis115311.58
Vassilios S. Verykios2140296.96