Title :
Efficient Private Record Linkage
Author :
Yakout, Mohamed ; Atallah, Mikhail J. ; Elmagarmid, Ahmed
Author_Institution :
Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN
fDate :
March 29 2009-April 2 2009
Abstract :
Record linkage is the computation of the associations among records of multiple databases. It arises in contexts like the integration of such databases, online interactions and negotiations, and many others. The autonomous entities who wish to carry out the record matching computation are often reluctant to fully share their data. In such a framework where the entities are unwilling to share data with each other, the problem of carrying out the linkage computation without full data exchange has been called private record linkage. Previous private record linkage techniques have made use of a third party. We provide efficient techniques for private record linkage that improve on previous work in that (i) they make no use of a third party; (ii) they achieve much better performance than that of previous schemes in terms of execution time and quality of output (i.e., practically without false negatives and minimal false positives). Our software implementation provides experimental validation of our approach and the above claims.
Keywords :
data privacy; distributed databases; pattern matching; autonomous entity; data privacy; multiple databases; private record linkage; record matching computation; Couplings; Cryptography; Data engineering; Data privacy; Databases; Euclidean distance; Impedance matching; Perturbation methods; Protocols; USA Councils; Record Linkage; data integration; database security; privacy preserving;
Conference_Titel :
Data Engineering, 2009. ICDE '09. IEEE 25th International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-3422-0
Electronic_ISBN :
1084-4627
DOI :
10.1109/ICDE.2009.221