Full Citation

Title: Secure Blocking + Secure Matching = Secure Record Linkage

Citation Type: Journal Article

Publication Year: 2011

ISBN:

ISSN:

DOI:

NSFID:

PMCID:

PMID:

Abstract: Performing approximate data matching has always been an intriguing problem for both industry and academia. This task becomes even more challenging when the requirement of data privacy rises. In this paper, we propose a novel technique to address the problem of efficient privacy-preserving approximate record linkage. The secure framework we propose consists of two basic components. First, we utilize a secure blocking component based on phonetic algorithms statistically enhanced to improve security. Second, we use a secure matching component where actual approximate matching is performed using a novel private approach of the Levenshtein Distance algorithm. Our goal is to combine the speed of private blocking with the increased accuracy of approximate secure matching.

User Submitted?: No

Authors: Karakasidis, Alexandros; Verykios, Vassilios S.

Periodical (Full): Journal of Computing Science and Engineering

Issue: 3

Volume: 5

Pages: 223-235

Data Collections: IPUMS USA

Topics: Other

Countries: