Privacy-Preserving String Comparisons in Record Linkage Systems: A Review

Authors:
Stanley Trepetin
Affiliations:
New York City Department of Health and Mental Hygiene, Chief Information Technology Security Officer, New York, NY, USA
Venue:
Information Security Journal: A Global Perspective
Year:
2008

Citing 5
Cited 8

A two-phase encryption scheme for enhancing database security

Journal of Systems and Software
A database encryption system with subkeys

ACM Transactions on Database Systems (TODS)
For the Record: Protecting Electronic Health Information

For the Record: Protecting Electronic Health Information
Practical Techniques for Searches on Encrypted Data

SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Combating the Insider Cyber Threat

IEEE Security and Privacy

Information fusion in data privacy: A survey

Information Fusion
Quantifying the correctness, computational complexity, and security of privacy-preserving string comparators for record linkage

Information Fusion
Fake injection strategies for private phonetic matching

DPM'11 Proceedings of the 6th international conference, and 4th international conference on Data Privacy Management and Autonomous Spontaneus Security
Reference table based k-anonymous private blocking

Proceedings of the 27th Annual ACM Symposium on Applied Computing
A taxonomy of privacy-preserving record linkage techniques

Information Systems
An efficient two-party protocol for approximate matching in private record linkage

AusDM '11 Proceedings of the Ninth Australasian Data Mining Conference - Volume 121
A distributed framework for scaling Up LSH-based computations in privacy preserving record linkage

Proceedings of the 6th Balkan Conference in Informatics
An iterative two-party protocol for scalable privacy-preserving record linkage

AusDM '12 Proceedings of the Tenth Australasian Data Mining Conference - Volume 134

Quantified Score

Hi-index	0.00

Visualization

Abstract

We face a growing need to be able to perform linkage among data set records to connect data about the same individual, organization or event so that further analysis becomes possible. At the same time, we also need to do a better job of protecting the privacy of the individuals identified by data set records. Therefore, it would be ideal if linkage could be effectively performed based not on the actual data but on some anonymous form of the data without diminishing the ability to link records whose identifiers are only “close” to each other, not equal, because of typical recording errors. This paper reviews existing proposals for how such anonymized string comparisons might be accomplished, but demonstrates that existing methods have various operational deficiencies. It therefore argues that new, more capable methods are needed.