An LSH-Based Blocking Approach with a Homomorphic Matching Technique for Privacy-Preserving Record Linkage
- 20 August 2014
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 27 (4) , 909-921
Abstract
We present a Λ-fold Redundant Blocking Framework, that relies on the Locality-Sensitive Hashing technique for identifying candidate record pairs, which have undergone an anonymization transformation. In this context, we demonstrate the usage and evaluate the performance of a variety of families of hash functions used for blocking. We illustrate that the performance attained is highly correlated to the distance-preserving properties of the anonymization format used. The parameters, of the blocking scheme, are optimally selected so that we achieve the highest possible accuracy in the least possible running time. We also introduce an SMC-based protocol in order to compare the formulated record pairs homomorphically, without running the risk of breaching the privacy of the underlying records.Keywords
This publication has 24 references indexed in Scilit:
- A distributed framework for scaling Up LSH-based computations in privacy preserving record linkage2013
- A taxonomy of privacy-preserving record linkage techniquesInformation Systems, 2013
- Efficient privacy-aware record integration2013
- Frequent grams based embedding for privacy preserving record linkage2012
- Privacy-preserving record linkage using Bloom filtersBMC Medical Informatics and Decision Making, 2009
- Privacy-Preserving Fuzzy Matching Using a Public Reference Table2009
- Near-optimal hashing algorithms for approximate nearest neighbor in high dimensionsCommunications of the ACM, 2008
- Privacy preserving schema and data matching2007
- Blocking-aware private record linkage2005
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes1999