%0 Journal Article %1 Christen2022-ng %A Christen, Victor %A Häntschel, Tim %A Christen, Peter %A Rahm, Erhard %D 2022 %I Springer Science and Business Media LLC %J Int. J. Data Sci. Anal. %K area_bigdata %T Privacy-preserving record linkage using autoencoders %X AbstractPrivacy-preserving record linkage (PPRL) is the process aimed at identifying records that represent the same real-world entity across different data sources while guaranteeing the privacy of sensitive information about these entities. A popular PPRL method is to encode sensitive plain-text data into Bloom filters (BFs), bit vectors that enable the efficient calculation of similarities between records that is required for PPRL. However, BF encoding cannot completely prevent the re-identification of plain-text values because sets of BFs can contain bit patterns that can be mapped to plain-text values using cryptanalysis attacks. Various hardening techniques have therefore been proposed that modify the bit patterns in BFs with the aim to prevent such attacks. However, it has been shown that even hardened BFs can still be vulnerable to attacks. To avoid any such attacks, we propose a novel encoding technique for PPRL based on autoencoders that transforms BFs into vectors of real numbers. To achieve a high comparison quality of the generated numerical vectors, we propose a method that guarantees the comparability of encodings generated by the different data owners. Experiments on real-world data sets show that our technique achieves high linkage quality and prevents known cryptanalysis attacks on BF encoding.

@article{Christen2022-ng, abstract = {AbstractPrivacy-preserving record linkage (PPRL) is the process aimed at identifying records that represent the same real-world entity across different data sources while guaranteeing the privacy of sensitive information about these entities. A popular PPRL method is to encode sensitive plain-text data into Bloom filters (BFs), bit vectors that enable the efficient calculation of similarities between records that is required for PPRL. However, BF encoding cannot completely prevent the re-identification of plain-text values because sets of BFs can contain bit patterns that can be mapped to plain-text values using cryptanalysis attacks. Various hardening techniques have therefore been proposed that modify the bit patterns in BFs with the aim to prevent such attacks. However, it has been shown that even hardened BFs can still be vulnerable to attacks. To avoid any such attacks, we propose a novel encoding technique for PPRL based on autoencoders that transforms BFs into vectors of real numbers. To achieve a high comparison quality of the generated numerical vectors, we propose a method that guarantees the comparability of encodings generated by the different data owners. Experiments on real-world data sets show that our technique achieves high linkage quality and prevents known cryptanalysis attacks on BF encoding.}, added-at = {2024-09-10T11:56:37.000+0200}, author = {Christen, Victor and H{\"a}ntschel, Tim and Christen, Peter and Rahm, Erhard}, biburl = {https://puma.scadsai.uni-leipzig.de/bibtex/2c4ca3329cbcb5d31e07b465f45a50910/scadsfct}, copyright = {https://creativecommons.org/licenses/by/4.0}, interhash = {5cf1b7cf9ac1a5403d38566cbce487aa}, intrahash = {c4ca3329cbcb5d31e07b465f45a50910}, journal = {Int. J. Data Sci. Anal.}, keywords = {area_bigdata}, language = {en}, month = {12}, publisher = {Springer Science and Business Media LLC}, timestamp = {2024-11-22T15:44:21.000+0100}, title = {Privacy-preserving record linkage using autoencoders}, year = 2022 }