The DOI matches its Crossref record; 73 of the 73 references it cites were found in a registry or an index.
L -diversity: Privacy beyond k -anonymity
Abstract
Publishing data about individuals without revealing sensitive information about them is an important problem. In recent years, a new definition of privacy called k -anonymity has gained popularity. In a k -anonymized dataset, each record is indistinguishable from at least k − 1 other records with respect to certain identifying attributes. In this article, we show using two simple attacks that a k -anonymized dataset has some subtle but severe privacy problems. First, an attacker can discover the values of sensitive attributes when there is little diversity in those sensitive attributes. This is a known problem. Second, attackers often have background knowledge, and we show that k -anonymity does not guarantee privacy against attackers using background knowledge. We give a detailed analysis of these two attacks, and we propose a novel and powerful privacy criterion called ℓ-diversity that can defend against such attacks. In addition to building a formal foundation for ℓ-diversity, we show in an experimental evaluation that ℓ-diversity is practical and can be implemented efficiently.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“To address these shortcomings, Machanavajjhala et al. [162] proposed l-diversity, which ensures that each sensitive attribute of the user should have l distinct values for every equivalence class, which share the same quasi-identifier values.”
From A Deep Dive into Fairness, Bias, Threats, and Privacy in Recommender Systems: Insights and Future Research (2024) · cites this paper as [162]
In the citing paper
“Key approaches (e.g.[194,205,276]) seek to protect speciic individuals and groups from being identiiable, i.e., minimize disclosure risk.”
From Fairness in machine learning: A survey (2024) · cites this paper as [205]
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot the international journal of robotics research and application · doi:10.1108/ir.1999.04926fae.001 · Cited by 39,228
Fast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,454
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
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Randomized Response: A Survey Technique for Eliminating Evasive Answer Bias
Warner, S. L. (1965) · Journal of the American Statistical Association · doi:10.1080/01621459.1965.10480775 · Cited by 3,261
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335438 · Cited by 3,009
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Ben-Or, M., & Wigderson, A. (1988) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/62212.62213 · Cited by 2,529
L-diversity: privacy beyond k-anonymity
Machanavajjhala, A., Gehrke, J. E., Kifer, D., & Venkitasubramaniam, M. (2006) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2006.1 · Cited by 2,436
Self-citationProtecting respondents identities in microdata release
Samarati, P. (2001) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.971193 · Cited by 2,339
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335438 · Cited by 1,719
Research works printed but not linked: 4
- Cox , L. H. 1982 . Solving confidentiality protection problems in tabulations using network optimization: A network model for cell suppression in the u.s. economic censuses . In Proceedings of the International Seminar on Statistical Confidentiality. Dublin International Statistical Institute , Dublin, Ireland. 229--245. Cox, L. H. 1982. Solving confidentiality protection problems in tabulations using network optimization: A network model for cell suppression in the u.s. economic censuses. In Proceedings of the International Seminar on Statistical Confidentiality. Dublin International Statistical Institute, Dublin, Ireland. 229--245.
- Cox , L. H. 1987 . New results in dislosure avoidance for tabulations . In Proceedings of the International Statistical Institute 46th Session . Tokyo, Japan. 83--84. Cox, L. H. 1987. New results in dislosure avoidance for tabulations. In Proceedings of the International Statistical Institute 46th Session. Tokyo, Japan. 83--84.
- 10.5555/1316689.1316701 · DOI
- Sweeney , L. 2000. Uniqueness of simple demographics in the u.s. population. Tech. rep ., Carnegie Mellon University . Sweeney, L. 2000. Uniqueness of simple demographics in the u.s. population. Tech. rep., Carnegie Mellon University.
Cited by
Sorted by citations
Items 1,001–1,006 of 1,006
Towards Privacy-Preserving Dummy Generation in Location-Based Services
Parmar, D., & Rao, U. P. (2020) · Procedia Computer Science · doi:10.1016/j.procs.2020.04.141 · Cited by 17
KHyperLogLog: Estimating Reidentifiability and Joinability of Large Data at Scale
Chia, P. H., Desfontaines, D., Perera, I. M., Simmons-Marengo, D., Li, C., Day, W.-Y., Wang, Q., & Guevara, M. (2019) · 2019 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2019.00046 · Cited by 15
Privacy-aware filter-based feature selection
Jafer, Y., Matwin, S., & Sokolova, M. (2014) · 2014 IEEE International Conference on Big Data (Big Data) · doi:10.1109/bigdata.2014.7004382 · Cited by 14
Security and Privacy in Big Data Environment
Chenthara, S., Wang, H., & Ahmed, K. (2018) · Encyclopedia of Big Data Technologies · doi:10.1007/978-3-319-63962-8_245-1 · Cited by 8
Understanding the protection of privacy when counting subway travelers through anonymization
Shafaeipour, N., Stanciu, V.-D., van Steen, M., & Wang, M. (2024) · Computers, Environment and Urban Systems · doi:10.1016/j.compenvurbsys.2024.102091 · Cited by 6
Roy, F., Ding, X., Choo, K. K. R., & Zhou, P. (2024) · arXiv · doi:10.48550/arxiv.2409.12651 · Cited by 7
Metadata
- Authors
- Machanavajjhala, A., Kifer, D., Gehrke, J., & Venkitasubramaniam, M.
- Affiliations
- Cornell University (US)
- Venue
- ACM Transactions on Knowledge Discovery from Data
- Published
- 2007-03
- Volume
- 1
- Issue
- 1
- Pages
- 3
- ISSN
- 1556-4681 (ISSN-L)
- 1556-472X
- OpenAlex
- W2134167315
- Cited by
- 3,617
- References
- 72
- Citations by year
- 2026: 96 · 2025: 180 · 2024: 152 · 2023: 179 · 2022: 179 · 2021: 237 · 2020: 199 · 2019: 183 · 2018: 245 · 2017: 248 · 2016: 232 · 2015: 246 · 2014: 264 · 2013: 219 · 2012: 189
- FWCI
- 155.30
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- ACM Transactions on Knowledge Discovery from Data (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Social Sciences › Sociology and Political Science › Privacy, Security, and Data Protection
- Physical Sciences › Computer Science › Computer Networks and Communications › Access Control and Trust
- Keywords
- l-diversity, k-anonymity, privacy preservation, data anonymization, background knowledge attack, privacy attacks
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
