Database Paper Browser

Back to papers

Simulatable Auditing

Summary: Show offline audit methods fail online because denials can leak information, and introduce simulatable auditing, a model where denials provably reveal no extra information. Prove max queries auditable under classical "no full compromise" privacy and define a probabilistic partial-compromise notion that enables simulatable auditing for sum queries. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1346
Venue
PODS
Year
2005
Pagerank
8.5099821e-05
Overall Rank
2,577 | 82.08%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
136 Revealing Information while Preserving Privacy 2003 PODS 0.0004241101
177 Limiting Privacy Breaches in Privacy Preserving Data Mining 2003 PODS 0.0003788711
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
3,760 Output Perturbation with Query Relaxation 2008 VLDB 6.7805033e-05
1,761 The Boundary Between Privacy and Utility in Data Publishing 2007 VLDB 0.00010651764
3,304 Plausible Deniability for Privacy-Preserving Data Synthesis 2017 VLDB 7.2467347e-05
4,570 On the Efficiency of Checking Perfect Privacy 2006 PODS 6.0780779e-05
136 Revealing Information while Preserving Privacy 2003 PODS 0.0004241101
9,513 Multi-Analyst Differential Privacy for Online Query Answering 2023 VLDB 4.3335882e-05
1,506 Auditing Boolean Attributes 2000 PODS 0.00011618118
6,510 Efficient Auditing For Complex SQL queries 2011 SIGMOD 5.0326078e-05
2,625 Epistemic Privacy 2008 PODS 8.4317678e-05
3,258 Towards Robustness in Query Auditing 2006 VLDB 7.3150323e-05