The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
On the tradeoff between privacy and utility in data publishing
Abstract
In data publishing, anonymization techniques such as generalization and bucketization have been designed to provide privacy protection. In the meanwhile, they reduce the utility of the data. It is important to consider the tradeoff between privacy and utility. In a paper that appeared in KDD 2008, Brickell and Shmatikov proposed an evaluation methodology by comparing privacy gain with utility gain resulted from anonymizing the data, and concluded that "even modest privacy gains require almost complete destruction of the data-mining utility". This conclusion seems to undermine existing work on data anonymization. In this paper, we analyze the fundamental characteristics of privacy and utility, and show that it is inappropriate to directly compare privacy with utility. We then observe that the privacy-utility tradeoff in data publishing is similar to the risk-return tradeoff in financial investment, and propose an integrated framework for considering privacy-utility tradeoff, borrowing concepts from the Modern Portfolio Theory for financial investment. Finally, we evaluate our methodology on the Adult dataset from the UCI machine learning repository. Our results clarify several common misconceptions about data utility and provide data publishers useful guidelines on choosing the right tradeoff between privacy and utility.
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 Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,410
On Information and Sufficiency
Kullback, S., & Leibler, R. A. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729694 · Cited by 20,193
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 5×
“One popular anonymization method is generalization [25, 26].”
BackgroundInfluentialMining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335372 · Cited by 6,402
Dwork, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11787006_1 · Cited by 5,291
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 10×
“First, one chooses a specific privacy requirement, such as k-anonymity [25, 26], `-diversity [21], (α, k)anonymity [29], t-closeness [19], and δ-presence [23], based on intuitions of what privacy means.”
BackgroundMethodInfluentialt-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
Self-citationMining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335372 · Cited by 3,216
Modern Portfolio Theory and Investment Analysis.
Smith, K. V., Elton, E. J., & Gruber, M. J. (1982) · The Journal of Finance · doi:10.2307/2327857 · Cited by 3,012
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
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 · cited 1×
“Several researchers have proposed to evaluate the utility of the anonymized data in terms of data mining workloads, such as classification and aggregate query answering (A comprehensive discussion on the privacy-preserving data publishing is given in [9]).”
BackgroundData 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
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
(α, k)-anonymity: an enhanced k-anonymity model for privacy preserving data publishing
Wong, R. C.-W., Li, J., Fu, A. W.-C., & Wang, K. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150499 · Cited by 625
On k -anonymity and the curse of dimensionality
Aggarwal, C. C. (2005) · Cited by 614
Top-Down Specialization for Information and Privacy Preservation
Fung, B. C. M., Wang, K., & Yu, P. S. (2005) · 21st International Conference on Data Engineering (ICDE'05) · doi:10.1109/icde.2005.143 · Cited by 576
Aggregate Query Answering on Anonymized Tables
Zhang, Q., Koudas, N., Srivastava, D., & Yu, T. (2007) · 2007 IEEE 23rd International Conference on Data Engineering · doi:10.1109/icde.2007.367857 · Cited by 357
The cost of privacy: destruction of data-mining utility in anonymized data publishing
Brickell, J., & Shmatikov, V. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401904 · Cited by 319
Bottom-Up Generalization: A Data Mining Solution to Privacy Protection
Wang, K., Yu, P. S., & Chakraborty, S. (2005) · Fourth IEEE International Conference on Data Mining (ICDM'04) · doi:10.1109/icdm.2004.10110 · Cited by 311
Hiding the presence of individuals from shared databases
Nergiz, M. E., Atzori, M., & Clifton, C. (2007) · Proceedings of the 2007 ACM SIGMOD international conference on Management of data · doi:10.1145/1247480.1247554 · Cited by 304
Injecting utility into anonymized datasets
Kifer, D., & Gehrke, J. (2006) · Proceedings of the 2006 ACM SIGMOD international conference on Management of data · doi:10.1145/1142473.1142499 · Cited by 296
Worst-Case Background Knowledge for Privacy-Preserving Data Publishing
Martin, D. J., Kifer, D., Machanavajjhala, A., Gehrke, J., & Halpern, J. Y. (2007) · 2007 IEEE 23rd International Conference on Data Engineering · doi:10.1109/icde.2007.367858 · Cited by 263
The boundary between privacy and utility in data publishing
Rastogi, V., Suciu, D. M., & Hong, S. (2007) · Very Large Data Bases · Cited by 228
Disclosure-Limited Data Dissemination
Duncan, G. T., & Lambert, D. (1986) · Journal of the American Statistical Association · doi:10.1080/01621459.1986.10478229 · Cited by 226
LeFevre, K., DeWitt, D. J., & Ramakrishnan, R. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150435 · Cited by 215
Template-Based Privacy Preservation in Classification Problems
Wang, K., Fung, B. C. M., & Yu, P. S. (2006) · Proceedings · doi:10.1109/icdm.2005.142 · Cited by 115
Injector: Mining Background Knowledge for Data Anonymization
Li, T., & Li, N. (2008) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2008.4497453 · Cited by 83
Self-citationPublishing Sensitive Transactions for Itemset Utility
Xu, Y., Fung, B. C. M., Wang, K., Fu, A. W.-C., & Pei, J. (2008) · Proceedings · doi:10.1109/icdm.2008.98 · Cited by 66
Cited by
Measuring Large-Scale Social Networks with High Resolution
Stopczynski, A., Sekara, V., Sapiezynski, P., Cuttone, A., Madsen, M. M., Larsen, J. E., & Lehmann, S. (2014) · PLoS ONE · doi:10.1371/journal.pone.0095978 · Cited by 409
Utility-Privacy Tradeoffs in Databases: An Information-Theoretic Approach
Sankar, L., Rajagopalan, S. R., & Poor, H. V. (2013) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2013.2253320 · Cited by 371
Anonymization of location data does not work: a large-scale measurement study
Zang, H., & Bolot, J. (2011) · Proceedings of the 17th annual international conference on Mobile computing and networking · doi:10.1145/2030613.2030630 · Cited by 362
Slicing: A New Approach for Privacy Preserving Data Publishing
Li, T., Li, N., Zhang, J., & Molloy, I. (2012) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.236 · Cited by 312
Self-citationAnonymization 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
Metadata
- Authors
- Li, T., & Li, N.
- Venue
- Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2009-06-28
- Pages
- 517-526
- OpenAlex
- W1992263322
- Cited by
- 309
- References
- 31
- FWCI
- 12.46
- 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.