CoChat

A Novel Error-Tolerant Anonymous Linking Code

Open access
Schnell, Rainer, Bachteler, Tobias, Reiher, Jörg · 2020 · SSRN Electronic Journal

The 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

Crossref · 10.2139/ssrn.3549247

Cites

34 of 34 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 34 references

Cited by

See all 70

Metadata

Authors
Schnell, R., Bachteler, T., & Reiher, J.
Affiliations
University of Duisburg-Essen (DE)
Corresponding author
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
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A Novel Error-Tolerant Anonymous Linking Code. https://app.cochat.ai/papers/10.2139/ssrn.3549247
The paper
Schnell, R., Bachteler, T., & Reiher, J. (2020). A Novel Error-Tolerant Anonymous Linking Code. SSRN Electronic Journal. https://doi.org/10.2139/ssrn.3549247

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.