arXiv (All)
open access
Tight Privacy Audit in One Run
In this paper, we study the problem of privacy audit in one run and show that our method achieves tight audit results for various differentially private protocols. This includes obtaining tight results for auditing $(\varepsilon,δ)$-DP algorithms where all previous work fails to achieve in any param
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Fast Mixing Mechanism for Differential Privacy#652332
- The Fast Mixing Mechanism for Differential Privacy#650879
- The EAP-TLS Authentication Protocol#420382
- Beyond Epsilon: A Principled QIF Framework for Local Differential Privacy#229444
- Sort, Partition, Randomize: Optimal Binary Hypothesis Testing under Local Differential Privacy#266105
Record · ID 1036576
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive