Using Identification Codes in the Two-Party Privacy-Preserving Record Linkage (PPRL)

In this paper, we show the problem of two-party privacy-preserving record linkage (PPRL) can be seen as an identification problem in Information Theory. We propose to apply the identification codes that are designed for identification via channels to the problem of PPRL, due to their advantage in th...

Full description

Saved in:
Bibliographic Details
Main Author: Yanling Chen
Format: Article
Language:English
Published: Graz University of Technology 2025-08-01
Series:Journal of Universal Computer Science
Subjects:
Online Access:https://lib.jucs.org/article/167412/download/pdf/
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1849341533273194496
author Yanling Chen
author_facet Yanling Chen
author_sort Yanling Chen
collection DOAJ
description In this paper, we show the problem of two-party privacy-preserving record linkage (PPRL) can be seen as an identification problem in Information Theory. We propose to apply the identification codes that are designed for identification via channels to the problem of PPRL, due to their advantage in the performance analysis, especially on a quantitative evaluation of the privacy. Note that for the PPRL, linkage quality is typically evaluated experimentally, whilst for privacy, there are so far no commonly accepted privacy measures available that allow an objective evaluation. Our approach of identification code provides an objective evaluation on both linkage quality and privacy based on parameters of employed identification codes.
format Article
id doaj-art-bdd4f72cf1e94f908db1262803ef21b7
institution Kabale University
issn 0948-6968
language English
publishDate 2025-08-01
publisher Graz University of Technology
record_format Article
series Journal of Universal Computer Science
spelling doaj-art-bdd4f72cf1e94f908db1262803ef21b72025-08-20T03:43:36ZengGraz University of TechnologyJournal of Universal Computer Science0948-69682025-08-0131987789910.3897/jucs.167412167412Using Identification Codes in the Two-Party Privacy-Preserving Record Linkage (PPRL)Yanling Chen0Volkswagen Infotainment GmbHIn this paper, we show the problem of two-party privacy-preserving record linkage (PPRL) can be seen as an identification problem in Information Theory. We propose to apply the identification codes that are designed for identification via channels to the problem of PPRL, due to their advantage in the performance analysis, especially on a quantitative evaluation of the privacy. Note that for the PPRL, linkage quality is typically evaluated experimentally, whilst for privacy, there are so far no commonly accepted privacy measures available that allow an objective evaluation. Our approach of identification code provides an objective evaluation on both linkage quality and privacy based on parameters of employed identification codes.https://lib.jucs.org/article/167412/download/pdf/Record LinkageIdentification CodePrivacy
spellingShingle Yanling Chen
Using Identification Codes in the Two-Party Privacy-Preserving Record Linkage (PPRL)
Journal of Universal Computer Science
Record Linkage
Identification Code
Privacy
title Using Identification Codes in the Two-Party Privacy-Preserving Record Linkage (PPRL)
title_full Using Identification Codes in the Two-Party Privacy-Preserving Record Linkage (PPRL)
title_fullStr Using Identification Codes in the Two-Party Privacy-Preserving Record Linkage (PPRL)
title_full_unstemmed Using Identification Codes in the Two-Party Privacy-Preserving Record Linkage (PPRL)
title_short Using Identification Codes in the Two-Party Privacy-Preserving Record Linkage (PPRL)
title_sort using identification codes in the two party privacy preserving record linkage pprl
topic Record Linkage
Identification Code
Privacy
url https://lib.jucs.org/article/167412/download/pdf/
work_keys_str_mv AT yanlingchen usingidentificationcodesinthetwopartyprivacypreservingrecordlinkagepprl