On the Efficiency of Checking Perfect Privacy
Summary: Shows that checking perfect privacy (whether answered query QV leaks information about secret QS) is Pi^p_2-complete in general but tractable for large, practical subclasses of conjunctive queries. Key idea: reduce perfect-privacy checking to query containment, transferring containment complexity/algorithms to privacy enforcement and unifying tractability results. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,512 | Privacy Skyline: Privacy with Multidimensional Adversarial Knowledge | 2007 | VLDB | 6.1188233e-05 |
| 6,504 | Efficient Auditing For Complex SQL queries | 2011 | SIGMOD | 5.0283716e-05 |
| 12,102 | On Scaling Up Sensitive Data Auditing | 2013 | VLDB | 4.1905499e-05 |
| 12,204 | Whodunit: An Auditing Tool for Detecting Data Breaches | 2011 | VLDB | 4.1905499e-05 |
| 12,485 | Materialized Views in Probabilistic Databases | 2007 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 234 | An Authorization Mechanism for a Relational Data Base System | 1976 | SIGMOD | 0.00031991515 |
| 401 | Conjunctive-Query Containment and Constraint Satisfaction | 1998 | PODS | 0.00024281448 |
| 1,082 | A Formal Analysis of Information Disclosure in Data Exchange | 2004 | SIGMOD | 0.00014196516 |
| 2,579 | Simulatable Auditing | 2005 | PODS | 8.5010694e-05 |
| 4,055 | On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates | 1998 | PODS | 6.4906839e-05 |
| 7,603 | Polynomial-time program transformations in deductive databases | 1990 | PODS | 4.6959912e-05 |
Previous
Page 1 / 1
Next