Efficient protocols for private record linkage

Tools

Wen, Zikai and Dong, Changyu; (2014) Efficient protocols for private record linkage. In: Proceedings of 29th ACM Symposium on Applied Computing. ACM, New York, pp. 1688-1694. ISBN 9781450324694 (https://doi.org/10.1145/2554850.2555001)

[thumbnail of Wen-Dong-SAC2014-efficient-protocols-for-private-record-linkage]
Preview
 PDF. Filename: Wen_Dong_SAC2014_efficient_protocols_for_private_record_linkage.pdf
Accepted Author Manuscript
Download (347kB)| Preview

Abstract

Record linkage allows data from different sources to be integrated to facilitate data mining tasks. However, in many cases, records have to be linked by personally identifiable information. To prevent privacy breaches, ideally records should be linked in a private way such that no information other than the matching result is leaked in the process. In this paper, we present an exact Private Record Linkage (PRL) protocol and an approximate PRL protocol. The exact PRL protocol is based on Oblivious Bloom Intersection, which is an efficient private set intersection protocol. The approximate PRL protocol extends the exact PRL protocol by incorporating Locality Sensitive Hash functions. Both protocols are secure in the semi-honest model. We also report the evaluation results based on our C implementation of the protocols. The results show that our protocols are efficient and effective.

ORCID iDs

Wen, Zikai and Dong, Changyu ORCID logoORCID: https://orcid.org/0000-0002-8625-0275;
CORE (COnnecting REpositories)