Database Paper Browser

Back to papers

Checking for k-Anonymity Violation by Views

Summary: Defines k-anonymity violation caused by views over a private relation. Proves the general checking problem is hard; identifies tractable subcases with polynomial-time checks and provides a conservative algorithm for necessary conditions. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9368
Venue
VLDB
Year
2005
Pagerank
6.7690512e-05
Overall Rank
3,785 | 73.67%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
654 Anatomy: Simple and Effective Privacy Preservation 2006 VLDB 0.00018613167
2,682 Personalized Privacy Preservation 2006 SIGMOD 8.3202837e-05
4,509 Privacy Skyline: Privacy with Multidimensional Adversarial Knowledge 2007 VLDB 6.1270304e-05
12,352 Publishing Naive Bayesian Classifiers: Privacy without Accuracy Loss 2009 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

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
40 Privacy-Preserving Data Mining 2000 SIGMOD 0.00074232718
225 Generalizing Data to Provide Anonymity when Disclosing Information 1998 PODS 0.00032707646
304 On the Complexity of Optimal K-Anonymity 2004 PODS 0.00028290121
607 Extending Query Rewriting Techniques for Fine-Grained Access Control 2004 SIGMOD 0.00019266724
1,083 A Formal Analysis of Information Disclosure in Data Exchange 2004 SIGMOD 0.00014210752
Previous Page 1 / 1 Next

Semantically Similar Papers