DBScholar

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
1345
Venue
PODS
Year
2005
Pagerank
8.6299652e-05
Overall Rank
2,401 | 83.53%
DOI
10.1145/1065167.1065183

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{kenthapadi_pods05,
        address = {New York, NY, USA},
        series = {{PODS} '05},
        title = {{Simulatable Auditing}},
        url = {https://dl.acm.org/doi/10.1145/1065167.1065183},
        doi = {10.1145/1065167.1065183},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Kenthapadi, Krishnaram and Mishra, Nina and Nissim, Kobbi},
        year = {2005}
}

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
123 Revealing Information while Preserving Privacy 2003 PODS 0.00031082693
218 Limiting Privacy Breaches in Privacy Preserving Data Mining 2003 PODS 0.00024420564
Previous Page 1 / 1 Next

Semantically Similar Papers