A distributed framework for scaling Up LSH-based computations in privacy preserving record linkage
Proceedings of the 6th Balkan Conference in Informatics
Efficient two-party private blocking based on sorted nearest neighborhood clustering
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.00 |
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.