Checking for k-Anonymity Violation by Views

Summary: Formalizes k-anonymity disclosure over materialized views, including secret associations, rather than released base tables. Establishes general computational hardness, identifies polynomial subcases, and gives an efficient conservative violation checker. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: h9e56d8a97a3d736a
Venue: VLDB
Year: 2005
Pagerank: 6.9196266e-05
Overall Rank: 3,926 | 73.61%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Chao Yao (George Mason University)
2. X. Sean Wang (University of Vermont)
3. Sushil Jajodia (George Mason University)

BibTeX Citation

@article{yao_vldb05,
        title = {{Checking for k-Anonymity Violation by Views}},
        author = {Yao, Chao and Wang, X. Sean and Jajodia, Sushil},
        journal = {PVLDB},
        series = {{VLDB} '05},
        year = {2005}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
584	Anatomy: Simple and Effective Privacy Preservation	2006	VLDB	0.00015954725
2,453	Personalized Privacy Preservation	2006	SIGMOD	8.4435151e-05
4,133	Privacy Skyline: Privacy with Multidimensional Adversarial Knowledge	2007	VLDB	6.7880955e-05
12,835	Publishing Naive Bayesian Classifiers: Privacy without Accuracy Loss	2009	VLDB	4.9793485e-05

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
68	Privacy-Preserving Data Mining	2000	SIGMOD	0.00037958605
347	Generalizing Data to Provide Anonymity when Disclosing Information	1998	PODS	0.00020325683
404	On the Complexity of Optimal K-Anonymity	2004	PODS	0.00019081867
568	Extending Query Rewriting Techniques for Fine-Grained Access Control	2004	SIGMOD	0.00016262553
1,109	A Formal Analysis of Information Disclosure in Data Exchange	2004	SIGMOD	0.00011987291

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	347	Generalizing Data to Provide Anonymity when Disclosing Information	1998	PODS
2	4,802	Fast Data Anonymization with Low Information Loss	2007	VLDB
3	8,008	Differentially Private Data Release over Multiple Tables	2023	PODS
4	4,240	On the Efficiency of Checking Perfect Privacy	2006	PODS
5	3,293	Privacy-preserving Anonymization of Set-valued Data	2008	VLDB
6	8,041	Privacy-Enhancing k-Anonymization of Customer Data	2005	PODS
7	6,678	Approximate Algorithms for k-Anonymity	2007	SIGMOD
8	12,715	Non-homogeneous Generalization in Privacy Preserving Data Publishing	2010	SIGMOD
9	1,782	The Boundary Between Privacy and Utility in Data Publishing	2007	VLDB
10	404	On the Complexity of Optimal K-Anonymity	2004	PODS