Secure Blocking + Secure Matching = Secure Record Linkage

摘要: 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 privacy rises. In this paper, we propose a novel technique to address efficient privacy-preserving record linkage. The secure framework consists two basic components. First, utilize blocking component based on phonetic algorithms statistically enhanced improve security. Second, use where actual is performed using private approach Levenshtein Distance algorithm. Our goal combine speed with increased accuracy matching. Category: Ubiquitous computing; Security