Privacy-Preserving String Comparisons in Record Linkage Systems: A Review
- 4 December 2008
- journal article
- review article
- Published by Informa UK Limited in Information Security Journal: A Global Perspective
- Vol. 17 (5-6), 253-266
- https://doi.org/10.1080/19393550802492503
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.Keywords
This publication has 5 references indexed in Scilit:
- Probabilistic Record Linkage: Relationships between File Sizes, Identifiers, and Match WeightsMethods of Information in Medicine, 2001
- Protocols for Secure Remote Database Access with Approximate MatchingPublished by Springer Science and Business Media LLC ,2001
- Effects of record linkage errors on registry-based follow-up studiesStatistics in Medicine, 1997
- A two-phase encryption scheme for enhancing database securityJournal of Systems and Software, 1995
- A database encryption system with subkeysACM Transactions on Database Systems, 1981