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
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.