Quantifying the Correctness, Computational Complexity, and Security of Privacy-Preserving String Comparators for Record Linkage.

Quantifying the Correctness, Computational Complexity, and Security of Privacy-Preserving String Comparators for Record Linkage.
复制标题

DOI:
10.1016/j.inffus.2011.04.004
复制
发表时间:
2012-10-01
期刊:
影响因子:
18.6
通讯作者:
Malin, Bradley
Malin, Bradley
中科院分区:
计算机科学1区
文献类型:
--
作者:
Durham, Elizabeth;Xue, Yuan;Kantarcioglu, Murat;Malin, Bradley

文献摘要

参考文献

相似文献

Record linkage is the task of identifying records from disparate data sources that refer to the same entity. It is an integral component of data processing in distributed settings, where the integration of information from multiple sources can prevent duplication and enrich overall data quality, thus enabling more detailed and correct analysis. Privacy-preserving record linkage (PPRL) is a variant of the task in which data owners wish to perform linkage without revealing identifiers associated with the records. This task is desirable in various domains, including healthcare, where it may not be possible to reveal patient identity due to confidentiality requirements, and in business, where it could be disadvantageous to divulge customers' identities. To perform PPRL, it is necessary to apply string comparators that function in the privacy-preserving space. A number of privacy-preserving string comparators (PPSCs) have been proposed, but little research has compared them in the context of a real record linkage application. This paper performs a principled and comprehensive evaluation of six PPSCs in terms of three key properties: 1) correctness of record linkage predictions, 2) computational complexity, and 3) security. We utilize a real publicly-available dataset, derived from the North Carolina voter registration database, to evaluate the tradeoffs between the aforementioned properties. Among our results, we find that PPSCs that partition, encode, and compare strings yield highly accurate record linkage results. However, as a tradeoff, we observe that such PPSCs are less secure than those that map and compare strings in a reduced dimensional space.
DOI: 10.1002/sim.1147
发表时间: 2002-05-30
影响因子: 2
作者:
Gomatam, S;Carter, R;Mitchell, G
通讯作者: Mitchell, G
DOI: 10.1186/1472-6947-4-9
发表时间: 2004-06-28
影响因子: 3.5
作者:
Churches, Tim;Christen, Peter
通讯作者: Christen, Peter
DOI: 10.1145/362686.362692
发表时间: 1970-01-01
影响因子: 22.7
作者:
BLOOM, BH
通讯作者: BLOOM, BH
DOI: 10.1109/tpami.2003.1195989
发表时间: 2003-05-01
影响因子: 23.6
作者:
Hjaltason, GR;Samet, H
通讯作者: Samet, H
DOI: 10.1023/a:1009761603038
发表时间: 1998-01-01
影响因子: 4.8
作者:
Hernandez, MA;Stolfo, SJ
通讯作者: Stolfo, SJ