The DOI matches its Crossref record.
Privacy-preserving record linkage using Bloom filters
Open accessAbstract
BACKGROUND: Combining multiple databases with disjunctive or additional information on the same person is occurring increasingly throughout research. If unique identification numbers for these individuals are not available, probabilistic record linkage is used for the identification of matching record pairs. In many applications, identifiers have to be encrypted due to privacy concerns. METHODS: A new protocol for privacy-preserving record linkage with encrypted identifiers allowing for errors in identifiers has been developed. The protocol is based on Bloom filters on q-grams of identifiers. RESULTS: Tests on simulated and actual databases yield linkage results comparable to non-encrypted identifiers and superior to results from phonetic encodings. CONCLUSION: We proposed a protocol for privacy-preserving record linkage with encrypted identifiers allowing for errors in identifiers. Since the protocol can be easily enhanced and has a low computational burden, the protocol might be useful for many applications requiring privacy-preserving record linkage.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Challenges in administrative data linkage for research
Harron, K., Dibben, C., Boyd, J., Hjern, A., Azimaee, M., Barreto, M. L., & Goldstein, H. (2017) · Big Data & Society · doi:10.1177/2053951717745678 · Cited by 357
A taxonomy of privacy-preserving record linkage techniques
Vatsalan, D., Christen, P., & Verykios, V. S. (2013) · Information Systems · doi:10.1016/j.is.2012.11.005 · Cited by 295
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
A Novel Error-Tolerant Anonymous Linking Code
Schnell, R., Bachteler, T., & Reiher, J. (2020) · doi:10.2139/ssrn.3549247 · Cited by 61
Self-citationOptimization of the mainzelliste software for fast privacy-preserving record linkage
Rohde, F., Franke, M., Sehili, Z., Lablans, M., & Rahm, E. (2021) · Journal of Translational Medicine · doi:10.1186/s12967-020-02678-1 · Cited by 14
Metadata
- Authors
- Schnell, R., Bachteler, T., & Reiher, J.
- Venue
- BMC Medical Informatics and Decision Making
- Published
- 2009-08-25
- Volume
- 9
- Issue
- 1
- Pages
- 41-41
- ISSN
- 1472-6947 (ISSN-L)
- OpenAlex
- W2141965543
- Cited by
- 342
- References
- 0
- FWCI
- 14.43
- Type
- journal article
- Language
- en
- Open access
- gold
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: Privacy-preserving record linkage using Bloom filters. https://app.cochat.ai/papers/10.1186/1472-6947-9-41
- The paper
- Schnell, R., Bachteler, T., & Reiher, J. (2009). Privacy-preserving record linkage using Bloom filters. BMC Medical Informatics and Decision Making. https://doi.org/10.1186/1472-6947-9-41
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.
