A taxonomy of privacy-preserving record linkage techniques

Dinusha Vatsalan*, Peter Christen, Vassilios S. Verykios

*Corresponding author for this work

    Research output: Contribution to journalArticlepeer-review

    226 Citations (Scopus)

    Abstract

    The process of identifying which records in two or more databases correspond to the same entity is an important aspect of data quality activities such as data pre-processing and data integration. Known as record linkage, data matching or entity resolution, this process has attracted interest from researchers in fields such as databases and data warehousing, data mining, information systems, and machine learning. Record linkage has various challenges, including scalability to large databases, accurate matching and classification, and privacy and confidentiality. The latter challenge arises because commonly personal identifying data, such as names, addresses and dates of birth of individuals, are used in the linkage process. When databases are linked across organizations, the issue of how to protect the privacy and confidentiality of such sensitive information is crucial to successful application of record linkage. In this paper we present an overview of techniques that allow the linking of databases between organizations while at the same time preserving the privacy of these data. Known as 'privacy-preserving record linkage' (PPRL), various such techniques have been developed. We present a taxonomy of PPRL techniques to characterize these techniques along 15 dimensions, and conduct a survey of PPRL techniques. We then highlight shortcomings of current techniques and discuss avenues for future research.

    Original languageEnglish
    Pages (from-to)946-969
    Number of pages24
    JournalInformation Systems
    Volume38
    Issue number6
    DOIs
    Publication statusPublished - Sept 2013

    Fingerprint

    Dive into the research topics of 'A taxonomy of privacy-preserving record linkage techniques'. Together they form a unique fingerprint.

    Cite this