JUCS - Journal of Universal Computer Science 31(9): 877-899, doi: 10.3897/jucs.167412
Using Identification Codes in the Two-Party Privacy-Preserving Record Linkage (PPRL)
Yanling Chen‡‡ Volkswagen Infotainment GmbH, Bochum, Germany
Corresponding author: Yanling Chen ( al_xy@msn.com ) © Yanling Chen. This is an open access article distributed under the terms of the Creative Commons Attribution License (CC BY 4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Citation:
Chen Y (2025) Using Identification Codes in the Two-Party Privacy-Preserving Record Linkage (PPRL). JUCS - Journal of Universal Computer Science 31(9): 877-899. https://doi.org/10.3897/jucs.167412 |  |
Abstract
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.
Keywords
Record Linkage, Identification Code, Privacy