On k-Anonymity and the Curse of Dimensionality

Summary: Analyzes k-anonymity in high-dimensional data by modeling inference attacks over all attribute combinations. Demonstrates dimensionality-driven sparsity and an exponential attack space, forcing either heavy data suppression or privacy compromise. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: h55e001fcf6b6712a
Venue: VLDB
Year: 2005
Pagerank: 9.4357064e-05
Overall Rank: 1,876 | 87.43%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Charu C. Aggarwal (IBM)

BibTeX Citation

@article{aggarwal_vldb05,
        title = {{On k-Anonymity and the Curse of Dimensionality}},
        author = {Aggarwal, Charu C.},
        journal = {PVLDB},
        series = {{VLDB} '05},
        volume = {31},
        pages = {901--909},
        year = {2005}
}

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
588	Anatomy: Simple and Effective Privacy Preservation	2006	VLDB	0.00015894454
1,024	m-Invariance: Towards Privacy Preserving Re-publication of Dynamic Datasets	2007	SIGMOD	0.00012396673
1,458	PrivBasis: Frequent Itemset Mining with Differential Privacy	2012	VLDB	0.00010562758
1,714	Injecting Utility into Anonymized Datasets	2006	SIGMOD	9.7943215e-05
2,462	Personalized Privacy Preservation	2006	SIGMOD	8.4116174e-05
4,649	Hiding the Presence of Individuals from Shared Databases	2007	SIGMOD	6.4717415e-05
4,678	Time Series Compressibility and Privacy	2007	VLDB	6.4568192e-05
6,697	Approximate Algorithms for k-Anonymity	2007	SIGMOD	5.6891158e-05
9,198	Dynamic Anonymization: Accurate Statistical Analysis with Privacy Preservation	2008	SIGMOD	5.1954442e-05
9,294	Privacy Preservation by Disassociation	2012	VLDB	5.1860131e-05

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
69	Privacy-Preserving Data Mining	2000	SIGMOD	0.00037815735
256	On the Design and Quantification of Privacy Preserving Data Mining Algorithms	2001	PODS	0.00022933612
406	On the Complexity of Optimal K-Anonymity	2004	PODS	0.00019009895

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	11,792	On the Risks of Collecting Multidimensional Data Under Local Differential Privacy	2023	VLDB
2	347	Generalizing Data to Provide Anonymity when Disclosing Information	1998	PODS
3	2,099	Optimizing error of high-dimensional statistical queries under differential privacy	2018	VLDB
4	12,845	Anonymized Data: Generation, Models, Usage	2009	SIGMOD
5	472	Incognito: Efficient Full-Domain K-Anonymity	2005	SIGMOD
6	8,066	Privacy-Enhancing k-Anonymization of Customer Data	2005	PODS
7	3,177	Achieving Anonymity via Clustering	2006	PODS
8	3,305	Privacy-preserving Anonymization of Set-valued Data	2008	VLDB
9	9,294	Privacy Preservation by Disassociation	2012	VLDB
10	4,826	Fast Data Anonymization with Low Information Loss	2007	VLDB