The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Attacks on privacy and deFinetti's theorem
Abstract
In this paper we present a method for reasoning about privacy using the concepts of exchangeability and deFinetti's theorem. We illustrate the usefulness of this technique by using it to attack a popular data sanitization scheme known as Anatomy. We stress that Anatomy is not the only sanitization scheme that is vulnerable to this attack. In fact, any scheme that uses the random worlds model, i.i.d. model, or tuple-independent model needs to be re-evaluated.
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
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 10×
“This fear is well-founded, since inadequate data sanitization allowed the identification of the medical records of the governor of Massachusetts in the GIC data [46]; it allowed the identification (and subsequent interview) of an AOL user by reporters from the New York Times [6]; and it allowed for the potential ident…”
BackgroundMethodInfluentialL -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 7×
“[35] have shown formally that if an attacker knows that a target individual corresponds to tuples 1,2,3 or 4 in Table 3, and if the attacker uses the random worlds reasoning model, then the attacker will conclude that this individual has AIDS with probability 3/4 (essentially because 3 out of 4 of the tuples in this g…”
BackgroundMethodInfluentialSelf-citationt-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 2×
“These include (c, k)-safety [36], privacy skyline [10], and t-closeness [33].”
BackgroundRobust De-anonymization of Large Sparse Datasets
Narayanan, A., & Shmatikov, V. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.33 · Cited by 2,372
Cited by
Resisting structural re-identification in anonymized social networks
Hay, M., Miklau, G., Jensen, D., Towsley, D., & Weis, P. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453873 · Cited by 549
Differential Privacy via Wavelet Transforms
Xiao, X., Wang, G., & Gehrke, J. (2011) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.247 · Cited by 369
Security and privacy challenges in smart cities
Braun, T., Fung, B. C. M., Iqbal, F., & Shah, B. (2018) · Sustainable Cities and Society · doi:10.1016/j.scs.2018.02.039 · Cited by 352
Differentially private data release for data mining
Mohammed, N., Chen, R., Fung, B. C. M., & Yu, P. S. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020487 · Cited by 325
From Group to Individual Labels Using Deep Features
Kotzias, D., Denil, M., de Freitas, N., & Smyth, P. (2015) · Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2783258.2783380 · Cited by 312
Metadata
- Authors
- Kifer, D.
- Venue
- Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
- Publisher
- ACM
- Published
- 2009-06-29
- Pages
- 127-138
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2112340163
- Cited by
- 162
- References
- 4
- FWCI
- 13.63
- 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.