δ-Presence without Complete World Knowledge
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Advances in information technology, and its use in research, are increasing both the need for anonymized data and the risks of poor anonymization. We presented a new privacy metric, δ-presence, that clearly links the quality of anonymization to the risk posed by inadequate anonymization. It was shown that existing anonymization techniques are inappropriate for situations where δ-presence is a good metric (specifically, where knowing an individual is in the database poses a privacy risk). This article addresses a practical problem with, extending to situations where the data anonymizer is not assumed to have complete world knowledge. The algorithms are evaluated in the context of a real-world scenario, demonstrating practical applicability of the approach.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cites
L -diversity: Privacy beyond k -anonymity
Machanavajjhala, A., Kifer, D., Gehrke, J., & Venkitasubramaniam, M. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217302 · Cited by 3,617 · cited 2×
“Privacy definitions such as ‘-diversity [ 6 ], t-closeness [11], ð�;k Þ-anonymity [12], ... prevent linking individuals to specific values in a sensitive attribute (e.g., linking students to GPA information) by enforcing diversity in sensitive values of indistinguishable tuples.”
BackgroundMethodt-Closeness: Privacy Beyond k-Anonymity and l-Diversity
Li, N., Li, T., & Venkatasubramanian, S. (2007) · 2007 IEEE 23rd International Conference on Data Engineering · doi:10.1109/icde.2007.367856 · Cited by 3,451 · cited 1×
“Privacy definitions such as ‘-diversity [6], t-closeness [11], ð ; kÞ-anonymity [12], . . . prevent linking individuals to specific values in a sensitive attribute (e.g., linking students to GPA information) by enforcing diversity in sensitive values of indistinguishable tuples.”
Background
Cited by
Federated learning: Challenges, methods, and future directions
Li, T., Sahu, A. K., Talwalkar, A., & Smith, V. (2020) · IEEE Signal Processing Magazine · doi:10.1109/msp.2020.2975749 · Cited by 6,210
“Despite the fact that differential privacy is the de facto metric for privacy in machine learning, there are many other privacy definitions, such as k-anonymity [15] and d-presence [34], which may be applicable to different learning problems.”
BackgroundInteractive machine learning for health informatics: when do we need the human-in-the-loop?
Holzinger, A. (2016) · Brain Informatics · doi:10.1007/s40708-016-0042-6 · Cited by 906
From Machine Learning to Explainable AI
Holzinger, A. (2018) · 2018 World Symposium on Digital Intelligence for Systems and Machines (DISA) · doi:10.1109/disa.2018.8490530 · Cited by 306
Anonymization Techniques for Privacy Preserving Data Publishing: A Comprehensive Survey
Majeed, A., & Lee, S. (2021) · IEEE Access · doi:10.1109/access.2020.3045700 · Cited by 287
How Much Is Enough? Choosing ε for Differential Privacy
Lee, J., & Clifton, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-24861-0_22 · Cited by 201
Self-citation
Metadata
- Authors
- Nergiz, M. E., & Clifton, C.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2010-06
- Volume
- 22
- Issue
- 6
- Pages
- 868-883
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2159002431
- Cited by
- 39
- References
- 2
- FWCI
- 1.45
- Type
- journal article
- Language
- en
- Open access
- closed
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.