The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Hiding the presence of individuals from shared databases
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 present a metric, δ-presence, that clearly links the quality of anonymization to the risk posed by inadequate anonymization. We show 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), and present algorithms for effectively anonymizing to meet δ-presence. 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
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
SWEENEY, L. (2002) · International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems · doi:10.1142/s0218488502001648 · Cited by 8,571 · cited 1×
“Health information that does not identify an individual and with respect to which there is no reasonable basis to believe that the information can be used to identify an individual is not individually identi.able health information.”
BackgroundUCI Repository of Machine Learning Databases
Merz, C. J. (1996) · Medical Entomology and Zoology · Cited by 2,363
L-diversity: privacy beyond k-anonymity
Machanavajjhala, A., Gehrke, J., Kifer, D., & Venkitasubramaniam, M. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.1 · Cited by 2,362
Protecting respondents identities in microdata release
Samarati, P. (2001) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.971193 · Cited by 2,324
Data Privacy through Optimal k-Anonymization
Bayardo, R. J., & Agrawal, R. (2005) · 21st International Conference on Data Engineering (ICDE'05) · doi:10.1109/icde.2005.42 · Cited by 1,131
Mondrian Multidimensional K-Anonymity
LeFevre, K., DeWitt, D. J., & Ramakrishnan, R. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.101 · Cited by 1,124
Incognito: efficient full-domain K-anonymity
LeFevre, K., DeWitt, D. J., & Ramakrishnan, R. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066164 · Cited by 1,070
Transforming data to satisfy privacy constraints
Iyengar, V. S. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775089 · Cited by 790
Anatomy: simple and effective privacy preservation
Xiao, X., & Tao, Y. (2006) · Very Large Data Bases · doi:10.5555/1182635.1164141 · Cited by 642
On k -anonymity and the curse of dimensionality
Aggarwal, C. C. (2005) · Cited by 614
Proceedings of the 31st international conference on Very large data bases
Bratbergsengen, K. (2005) · International Conference on Multimodal Interfaces · Cited by 414
Standards for privacy of individually identifiable health information. Final rule.
(2002) · PubMed · Cited by 400
Achieving anonymity via clustering
Aggarwal, G., Feder, T., Kenthapadi, K., Khuller, S., Panigrahy, R., Thomas, D., & Zhu, A. (2006) · Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1142351.1142374 · Cited by 271
Nergiz, M. E., & Clifton, C. (2007) · Data & Knowledge Engineering · doi:10.1016/j.datak.2007.03.009 · Cited by 142
Self-citationUsing Boolean reasoning to anonymize databases
Øhrn, A., & Ohno‐Machado, L. (1999) · Artificial Intelligence in Medicine · doi:10.1016/s0933-3657(98)00056-6 · Cited by 71
Nergiz, M. E., & Clifton, C. (2006) · doi:10.1109/icdew.2006.147 · Cited by 51
Self-citation
Cited by
Privacy-preserving data publishing: A survey of recent developments
Fung, B. C. M., Wang, K., Chen, R., & Yu, P. S. (2010) · ACM Computing Surveys · doi:10.1145/1749603.1749605 · Cited by 1,704
Trustworthy AI: From Principles to Practices
Li, B., Qi, P., Liu, B., Di, S., Liu, J., Pei, J., Yi, J., & Zhou, B. (2023) · ACM Computing Surveys · doi:10.1145/3555803 · Cited by 612
“Different principles of quantitative data anonymization have been developed, such as k-anonymity [288], (c,k )-safety [236], and δ -presence [253].”
BackgroundPreserving the Privacy of Sensitive Relationships in Graph Data
Zheleva, E., & Getoor, L. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78478-4_9 · Cited by 403
Airavat: security and privacy for MapReduce
Roy, I., Setty, S., Kilzer, A., Shmatikov, V., & Witchel, E. (2010) · doi:10.5555/1855711.1855731 · Cited by 393
Technical Privacy Metrics: A Systematic Survey
Wagner, I., & Eckhoff, D. (2019) · ACM Computing Surveys · doi:10.1145/3168389 · Cited by 346
Metadata
- Authors
- Nergiz, M. E., Atzori, M., & Clifton, C.
- Venue
- Proceedings of the 2007 ACM SIGMOD international conference on Management of data
- Publisher
- ACM
- Published
- 2007-06-11
- Pages
- 665-676
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2139864694
- Cited by
- 304
- References
- 17
- FWCI
- 16.48
- Type
- conference paper
- 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.