A Novel Error-Tolerant Anonymous Linking Code
Open accessThe DOI matches its Crossref record; 34 of the 35 references it cites were found in a registry or an index.
Abstract
An anonymous linking code is an encrypted key for linking data from different sources. So far, quite simple algorithms for the generation of such codes based on personal characteristics as names and date of birth are in common use. These algorithms will yield many non matching codes when facing errors in the underlying indentifier values. We suggested the use of Bloom filters for calculating string similarities in a privacy-preserving manner. Here, we claim that this principle can also be used for a novel error-tolerant but still irreversible encrypted key. We call the proposed code Cryptographic Longterm Key. It consists of one single Bloom filter into which identfiers are subsequently stored. Tests on simulated databases yield linkage results comparable to non encrypted identifiers and superior to results from hitherto existing methods. Since the Cryptographic Longterm Key can be easily adapted to meet quite different prerequisites it might be useful for many applications.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Comparing these two results, we see that minibatch SGD attains the optimal 'statistical' term ( σ / √ TKM ), whilst SGD on a single device (ignoring the updates of the other devices) achieves the optimal 'optimization' term ( H / ( TK ) 2 ).”
From Advances and Open Problems in Federated Learning (2021) · cites this paper as [151]
Citations
Cites
Measures of the Amount of Ecologic Association Between Species
Dice, L. R. (1945) · Ecology · doi:10.2307/1932409 · Cited by 11,874
Space/time trade-offs in hash coding with allowable errors
Bloom, B. H. (1970) · Communications of the ACM · doi:10.1145/362686.362692 · Cited by 7,492
HMAC: Keyed-Hashing for Message Authentication
Krawczyk, H., Bellare, M., & Canetti, R. (1997) · doi:10.17487/rfc2104 · Cited by 2,031
Network Applications of Bloom Filters: A Survey
Broder, A., & Mitzenmacher, M. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129096 · Cited by 1,991
Summary cache: a scalable wide-area Web cache sharing protocol
Fan, L., Cao, P., Almeida, J., & Broder, A. Z. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.851975 · Cited by 1,811
Research use of linked health data - a best practice protocol
Kelman, C. W., Bass, A. J., & Holman, C. D. J. (2002) · Australian and New Zealand Journal of Public Health · doi:10.1111/j.1467-842x.2002.tb00161.x · Cited by 437
Data Quality and Record Linkage Techniques
(2007) · Springer eBooks · doi:10.1007/0-387-69505-2 · Cited by 429
Kimura, S., Sato, T., Ikeda, S., Noda, M., & Nakayama, T. (2010) · Journal of Epidemiology · doi:10.2188/jea.je20090066 · Cited by 353
Privacy-preserving record linkage using Bloom filters
Schnell, R., Bachteler, T., & Reiher, J. (2009) · BMC Medical Informatics and Decision Making · doi:10.1186/1472-6947-9-41 · Cited by 342
Self-citationStephen, G. A. (1994) · Lecture Notes Series on Computing · doi:10.1142/2418 · Cited by 324
Cited by
Advances and Open Problems in Federated Learning
Kairouz, P., & McMahan, H. B. (2021) · Foundations and Trends in Machine Learning · doi:10.1561/2200000083 · Cited by 7,772
“Independently of the eventual technical levy of carrying out record linkage privately [348], the task itself happens to be substantially noise prone in the real world [347] and only sparse results have addressed its impact on training models [198].”
BackgroundPrivacy-Preserving Record Linkage for Big Data: Current Approaches and Research Challenges
Vatsalan, D., Sehili, Z., Christen, P., & Rahm, E. (2017) · Handbook of Big Data Technologies · doi:10.1007/978-3-319-49340-4_25 · Cited by 159
FedV: Privacy-Preserving Federated Learning over Vertically Partitioned Data
Xu, R., Baracaldo, N., Zhou, Y., Anwar, A., Joshi, J. B. D., & Ludwig, H. (2021) · ACM Workshop on Artificial Intelligence and Security (AISec) · doi:10.1145/3474369.3486872 · Cited by 143
Privacy-preserving record linkage on large real world datasets.
Randall, S. M., Ferrante, A. M., Boyd, J. H., Bauer, J. K., & Semmens, J. B. (2014) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2013.12.003 · Cited by 137
Composite Bloom Filters for Secure Record Linkage
Durham, E., Kantarcıoğlu, M., Xue, Y., Toth, C., Kuzu, M., & Malin, B. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.91 · Cited by 114
Cryptanalysis of Basic Bloom Filters Used for Privacy Preserving Record Linkage
Niedermeyer, F., Steinmetzer, S., Kroll, M., & Schnell, R. (2014) · Journal of Privacy and Confidentiality · doi:10.29012/jpc.v6i2.640 · Cited by 109
Self-citationModern Privacy-Preserving Record Linkage Techniques: An Overview
Gkoulalas-Divanis, A., Vatsalan, D., Karapiperis, D., & Kantarcıoğlu, M. (2021) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2021.3114026 · Cited by 98
Karapiperis, D., & Verykios, V. S. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2349916 · Cited by 90
Efficient Cryptanalysis of Bloom Filters for Privacy-Preserving Record Linkage
Christen, P., Schnell, R., Vatsalan, D., & Ranbaduge, T. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-57454-7_49 · Cited by 78
Self-citationPrivacy-preserving matching of similar patients
Vatsalan, D., & Christen, P. (2015) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2015.12.004 · Cited by 75
Randomized Response and Balanced Bloom Filters for Privacy Preserving Record Linkage
Schnell, R., & Borgs, C. (2016) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2016.0038 · Cited by 68
Self-citationAn Evaluation Framework for Privacy-Preserving Record Linkage
Vatsalan, D., Christen, P., O’Keefe, C. M., & Verykios, V. S. (2014) · Journal of Privacy and Confidentiality · doi:10.29012/jpc.v6i1.636 · Cited by 64
A practical approach to achieve private medical record linkage in light of public resources
Kuzu, M., Kantarcıoğlu, M., Durham, E., Toth, C., & Malin, B. (2012) · Journal of the American Medical Informatics Association · doi:10.1136/amiajnl-2012-000917 · Cited by 63
NN-EMD: Efficiently Training Neural Networks Using Encrypted Multi-Sourced Datasets
Xu, R., Joshi, J. B. D., & Li, C. (2021) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2021.3074439 · Cited by 48
FEDERAL: A Framework for Distance-Aware Privacy-Preserving Record Linkage
Karapiperis, D., Gkoulalas-Divanis, A., & Verykios, V. S. (2017) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2761759 · Cited by 47
A Graph Matching Attack on Privacy-Preserving Record Linkage
Vidanage, A., Christen, P., Ranbaduge, T., & Schnell, R. (2020) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3340531.3411931 · Cited by 45
Self-citationBrown, A., Borgs, C., Randall, S. M., & Schnell, R. (2017) · BMC Medical Informatics and Decision Making · doi:10.1186/s12911-017-0478-5 · Cited by 37
Self-citationPrivacy Preserving Record Linkage with PPJoin.
Sehili, Z., Kolb, L., Borgs, C., Schnell, R., & Rahm, E. (2015) · BTW · Cited by 36
Self-citationA fast and efficient Hamming LSH-based scheme for accurate linkage
Karapiperis, D., & Verykios, V. S. (2016) · Knowledge and Information Systems · doi:10.1007/s10115-016-0919-y · Cited by 34
Scalable Privacy-Preserving Linking of Multiple Databases Using Counting Bloom Filters
Vatsalan, D., Christen, P., & Rahm, E. (2016) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2016.0130 · Cited by 32
Estimating parameters for probabilistic linkage of privacy-preserved datasets
Brown, A., Randall, S. M., Ferrante, A. M., Semmens, J. B., & Boyd, J. (2017) · BMC Medical Research Methodology · doi:10.1186/s12874-017-0370-0 · Cited by 31
An efficient privacy-preserving record linkage technique for administrative data and censuses
Schnell, R. (2014) · Statistical Journal of the IAOS · doi:10.3233/sji-140833 · Cited by 25
Self-citationKroll, M., & Steinmetzer, S. (2015) · Communications in computer and information science · doi:10.1007/978-3-319-27707-3_21 · Cited by 24
Baumgartner, M., Kreiner, K., Lauschensky, A., Jammerbund, B., Donsa, K., Hayn, D., Wiesmüller, F., Demelius, L., Modre‐Osprian, R., Neururer, S. B., et al. (2024) · Frontiers in Medicine · doi:10.3389/fmed.2024.1301660 · Cited by 22
Parallel Privacy-preserving Record Linkage using LSH-based Blocking
Franke, M., Sehili, Z., & Rahm, E. (2018) · International Conference on Internet of Things, Big Data and Security (IoTBDS) · doi:10.5220/0006682701950203 · Cited by 22
Similarity Filtering with Multibit Trees for Record LinkagePreprint
Bachteler, T., Reiher, J., & Schnell, R. (2020) · SSRN Electronic Journal · doi:10.2139/ssrn.3530899 · Cited by 22
Self-citationA Vulnerability Assessment Framework for Privacy-preserving Record Linkage
Vidanage, A., Christen, P., Ranbaduge, T., & Schnell, R. (2023) · ACM Transactions on Privacy and Security · doi:10.1145/3589641 · Cited by 20
Self-citationPost-processing Methods for High Quality Privacy-Preserving Record Linkage
Franke, M., Sehili, Z., Gladbach, M., & Rahm, E. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-00305-0_19 · Cited by 16
Privacy‐preserving record linkage
Verykios, V. S., & Christen, P. (2013) · Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery · doi:10.1002/widm.1101 · Cited by 16
Privacy preserving record linkage using homomorphic encryption
Randall, S. M., Brown, A., Ferrante, A. M., Boyd, J., & Semmens, J. B. (2015) · Figshare · doi:10.13140/rg.2.1.3052.4887 · Cited by 16
Evaluation of Hardening Techniques for Privacy-Preserving Record Linkage
Franke, M., Sehili, Z., Rohde, F., & Rahm, E. (2021) · Movebank · doi:10.5441/002/edbt.2021.26 · Cited by 15
Liu, Y., Li, H., & Hao, M. (2023) · Peer-to-Peer Networking and Applications · doi:10.1007/s12083-023-01584-9 · Cited by 14
A critique and attack on “Blockchain-based privacy-preserving record linkage”
Christen, P., Schnell, R., Ranbaduge, T., & Vidanage, A. (2021) · Information Systems · doi:10.1016/j.is.2021.101930 · Cited by 14
Self-citationStrengthening Privacy-Preserving Record Linkage using Diffusion
Armknecht, F., Heng, Y., & Schnell, R. (2023) · Proceedings on Privacy Enhancing Technologies · doi:10.56553/popets-2023-0054 · Cited by 14
Self-citationSpeeding up Privacy Preserving Record Linkage for Metric Space Similarity Measures
Sehili, Z., & Rahm, E. (2016) · Datenbank-Spektrum · doi:10.1007/s13222-016-0222-9 · Cited by 14
Scheenstra, B., Bruninx, A., van Daalen, F., Stahl, N., Latuapon, E., Imkamp, M. S. V., Ippel, L., Duijsings-Mahangi, S., Smits, D., Townend, D. M. R., et al. (2022) · JMIR Cardio · doi:10.2196/37437 · Cited by 12
Building a National Perinatal Data Base without the Use of Unique Personal Identifiers
Schnell, R., & Borgs, C. (2015) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2015.19 · Cited by 11
Self-citationAccurate privacy-preserving record linkage for databases with missing values
Vaiwsri, S., Ranbaduge, T., Christen, P., & Schnell, R. (2021) · Information Systems · doi:10.1016/j.is.2021.101959 · Cited by 10
Self-citationDifferential Cryptanalysis of Bloom Filters for Privacy-Preserving Record Linkage
Yin, W., Yuan, L., Ren, Y., Meng, W., Wang, D., & Wang, Q. (2024) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2024.3421292 · Cited by 10
A Federated Record Linkage Algorithm for Secure Medical Data Sharing
Heidt, C. M., Hund, H., & Fegeler, C. (2021) · Studies in health technology and informatics · doi:10.3233/shti210062 · Cited by 10
Scalable and approximate privacy-preserving record linkage
Vatsalan, D. (2014) · ANU Open Research (Australian National University) · doi:10.25911/5d739004a7846 · Cited by 10
Distributed Privacy-Preserving Record Linkage Using Pivot-Based Filter Techniques
Gladbach, M., Sehili, Z., Kudraß, T., Christen, P., & Rahm, E. (2018) · IEEE International Conference on Data Engineering Workshops (ICDEW) · doi:10.1109/icdew.2018.00013 · Cited by 9
ScaDS Research on Scalable Privacy-preserving Record Linkage
Franke, M., Gladbach, M., Sehili, Z., Rohde, F., & Rahm, E. (2019) · Datenbank-Spektrum · doi:10.1007/s13222-019-00305-y · Cited by 8
Privacy-Preserving Vertical Federated Learning
Xu, R., Baracaldo, N., Zhou, Y., Abay, A., & Anwar, A. (2022) · Springer eBooks · doi:10.1007/978-3-030-96896-0_18 · Cited by 7
Privacy-preserving record linkage using reference set based encoding: A single parameter method
Ziyad, S., Christen, P., Vidanage, A., Nanayakkara, C., & Schnell, R. (2025) · Information Systems · doi:10.1016/j.is.2025.102569 · Cited by 6
Self-citationMicrosimulation of an educational attainment register to predict future record linkage quality
Schnell, R., & Weiand, S. V. (2023) · International Journal for Population Data Science · doi:10.23889/ijpds.v8i1.2122 · Cited by 6
Self-citationR+R: Revisiting Graph Matching Attacks on Privacy-Preserving Record Linkage
Schäfer, J., Armknecht, F., & Heng, Y. (2024) · Annual Computer Security Applications Conference · doi:10.1109/acsac63791.2024.00064 · Cited by 5
MapReduce Implementations for Privacy Preserving Record Linkage
Μπούσης, Δ., Dritsas, E., Kanavos, A., Sioutas, S., Tzimas, G. E., & Verykios, V. S. (2018) · Hellenic Conference on Artificial Intelligence · doi:10.1145/3200947.3201043 · Cited by 5
Hyper-Parameter Optimization for Privacy-Preserving Record Linkage
Yu, J., Nabaglo, J., Vatsalan, D., Henecka, W., & Thorne, B. (2020) · Communications in computer and information science · doi:10.1007/978-3-030-65965-3_18 · Cited by 5
Enhancing Privacy in Lightweight Data Encoding for Sensitive Applications
Wang, Y., Xu, M., & Zhong, S. (2025) · IEEE Access · doi:10.1109/access.2025.3580958 · Cited by 3
Privacy-Preserving Linkage of Distributed Datasets using the Personal Health TrainPreprint
Jugl, M., Welten, S., Mou, Y., Yediel, Y. Ü., Beyan, O., Sax, U., & Kirsten, T. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2309.06171 · Cited by 3
A Review of Privacy Preserving Mechanisms for Record Linkage
Bonomi, L., Fan, L., & Xiong, L. (2015) · Springer eBooks · doi:10.1007/978-3-319-23633-9_10 · Cited by 2
Private record linkage with linkage maps
Patel, S. D., & Dewri, R. (2022) · Security and Privacy · doi:10.1002/spy2.265 · Cited by 1
Privacy-Preserving Data Integration for Recidivism Assessment
Trigiante, L., Beneventano, D., & Bergamaschi, S. (2025) · International Journal of Computer Applications · doi:10.5120/ijca2025925080 · Cited by 1
Big Data Linkage no Brasil: Aspectos metodológicos e práticos
Pita, R., Carreiro, R., Santos, C. J. C., Protásio, L. D. S., Barreto, M. E., Orrico, V. B., Gomes, J. A. D., Eustáquio, F. S., Sena, S., Barreto, M. L., et al. (2025) · doi:10.5753/sbc.16731.5.8 · Cited by 1
Culea, H. (. (2021) · Research Repository (Delft University of Technology) · Cited by 1
xDup: Privacy-Preserving Deduplication for Humanitarian Organizations using Fuzzy PSIPreprint
Rausch, T., Chatel, S., & Lueks, W. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2604.08019 · Cited by 1
Scalable, Accurate and Secure Privacy-Preserving Record Linkage
Franke, M. (2023) · Qucosa (Saxon State and University Library Dresden) · Cited by 1
Counteracting Bloom Filter Encoding Techniques for Private Record Linkage
Sharma, V. (2015) · Scholarship@Western (Western University)
Linkage of De-Identified Records in Accordance to the European Legislation
Quantin, C., Benzenine, É., Guesdon, M., Gouyon, J., & Allaert, F. (2014) · Advances in information quality and management · doi:10.4018/978-1-4666-5888-2.ch319
Harron, K. L., Goldstein, H., & Dibben, C. J. L. (2015) · Wiley series in probability and statistics · doi:10.1002/9781119072454.refs
Generating-Set Evaluation of Bloom Filter Hardening Techniques in Private Record Linkage
Mortl, K., & Dewri, R. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-23690-7_3
(2025) · Frontiers research topics · doi:10.3389/978-2-8325-6095-2
Scalable privacy-preserving record linkage: Evaluating MultiBit tree indexing in Atyimo
Orrico, V. B., Eustáquio, F. S., Almeida, B. D. A., Silva, M., & Pita, R. (2025) · Simpósio Brasileiro de Bancos de Dados (SBBD) · doi:10.5753/sbbd.2025.247288
Privacy-preserving record linkage for high linkage quality
Vaiwsri, S. (2023) · ANU Open Research (Australian National University) · doi:10.25911/9h9q-7j51
Weiand, S. V. (2025) · Econstor (Econstor)
Bifrost: A Much Simpler Secure Two-Party Data Join Protocol for Secure Data Analytics
Chen, S., Zhou, M., Niu, H., Lin, G., & Han, W. (2026) · Proceedings of the VLDB Endowment · doi:10.14778/3797919.3797925
Robust and transparent Privacy-Preserving Record Linkage
Rohde, F. (2026) · Qucosa (Saxon State and University Library Dresden)
xDup: Privacy-Preserving Deduplication for Humanitarian Organizations Using Fuzzy PSI
Rausch, T., Chatel, S., & Lueks, W. (2026) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp63933.2026.00140
Vatsalan, D., Asghar, H., & Kâafar, M. A. (2026) · Advances in information security · doi:10.1007/978-3-032-21932-9_2
Metadata
- Authors
- Schnell, R., Bachteler, T., & Reiher, J.
- Affiliations
- University of Duisburg-Essen (DE)
- Corresponding author
- Schnell, Rainer
- ORCID
- Schnell, Rainer
- Venue
- SSRN Electronic Journal
- Publisher
- Elsevier BV
- Published
- 2020
- ISSN
- 1556-5068 (ISSN-L)
- OpenAlex
- W2510261309
- Cited by
- 61
- References
- 35
- Citations by year
- 2026: 2 · 2025: 4 · 2024: 3 · 2023: 4 · 2022: 5 · 2021: 6 · 2020: 5
- Type
- posted content
- Language
- en
- Open access
- green
- doi.org
- Locations
- SSRN Electronic Journal (acceptedVersion)
- Topics
- Physical Sciences › Computer Science › Information Systems › Data Quality and Management
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Keywords
- data linkage, Bloom filter, error tolerance, privacy-preserving data linkage, string similarity
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.