By Topic

A Sorted Neighborhood Approach to Multidimensional Privacy Preserving Blocking

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Alexandros Karakasidis ; Sch. of Sci. & Technol., Hellenic Open Univ., Patras, Greece ; Vassilios S. Verykios

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.

Published in:

2012 IEEE 12th International Conference on Data Mining Workshops

Date of Conference:

10-10 Dec. 2012