Efficient protocols for private record linkage

Zikai Wen, Changyu Dong

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

9 Citations (Scopus)
103 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationProceedings of 29th ACM Symposium on Applied Computing
Place of PublicationNew York
Pages1688-1694
Number of pages7
DOIs
Publication statusPublished - 2014

Keywords

  • record linkage study
  • private record linkage
  • data mining
  • PRL

Fingerprint Dive into the research topics of 'Efficient protocols for private record linkage'. Together they form a unique fingerprint.

  • Cite this

    Wen, Z., & Dong, C. (2014). Efficient protocols for private record linkage. In Proceedings of 29th ACM Symposium on Applied Computing (pp. 1688-1694). https://doi.org/10.1145/2554850.2555001