Privacy preserving record linkage approaches (Q1046586)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Privacy preserving record linkage approaches |
scientific article; zbMATH DE number 5651382
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Privacy preserving record linkage approaches |
scientific article; zbMATH DE number 5651382 |
Statements
Privacy preserving record linkage approaches (English)
0 references
22 December 2009
0 references
Summary: Privacy-preserving record linkage is a very important task, mostly because of the very sensitive nature of the personal data. The main focus in this task is to find a way to match records from among different organisation data sets or databases without revealing competitive or personal information to non-owners. Towards accomplishing this task, several methods and protocols have been proposed. In this work, we propose a certain methodology for preserving the privacy of various record linkage approaches and we implement, examine and compare four pairs of privacy preserving record linkage methods and protocols. Two of these protocols use \(n\)-gram based similarity comparison techniques, the third protocol uses the well known edit distance and the fourth one implements the Jaro-Winkler distance metric. All of the protocols used are enhanced by private key cryptography and hash encoding. This paper presents also a blocking scheme as an extension to the privacy preserving record linkage methodology. Our comparison is backed up by extended experimental evaluation that demonstrates the performance achieved by each of the proposed protocols.
0 references
data integration
0 references
privacy preserving record linkage
0 references
cryptography
0 references
personal data
0 references
privacy protection
0 references
private key cryptography
0 references
hash encoding
0 references
blocking schemes
0 references