cs.CRJul 15, 2026

Plausible Deniability Guarantees for Whistleblowers

Authors: Leo RichterMatt J. Kusner

Organizations: University College London · 2 ´Ecole Polytechnique de Montr´eal · 3Mila - Qu´ebec Artificial Intelligence Institute

Abstract

Whistleblowers are a key safeguard against organizational wrongdoing, but the threat of retaliation deters reporting. Existing whistleblower-protection proposals lack formal privacy guarantees, and existing differential privacy mechanisms do not directly target the natural threat model -- one in which the audited organization itself observes auditor selection decisions and uses them to identify reporters. We formalize protection against a strong-adversary threat model as per-report (0,δ)(0, δ)-differential privacy on the transcript of audit selections. Within this framework we prove that a natural approach -- randomized response applied at the selection step -- can never outperform uniform random auditing by more than δδ at any horizon. We then give a generic mechanism that reduces private auditing to private continual counting: any (0,δ)(0, δ)-DP continual counter plugs in by post-processing, and the audit transcript inherits the same per-report guarantee. Instantiating the reduction with a recent work in continual counting yields per-report (0,δ)(0, δ)-DP with noise scaling as O(logT)O(\sqrt{\log T}) across a horizon of TT audit decisions. A utility theorem shows that the selection error vanishes whenever the noisy report gap between the most-reported organization and the runner-up grows faster than logT\sqrt{\log T}. Simulations show a substantial improvement over randomized response.

Explore similar work

May 8, 2026cs.GT

Differentially Private Auditing Under Strategic Response

Regulatory audits of AI systems increasingly rely on differential privacy (DP) to protect training data and model internals. We study audit design when the audited developer can strategically respond to the privacy-constrained audit interface. We formalize privacy-constrained auditing as a bilevel Stackelberg game, in which an auditor commits to a query policy and DP budget allocation across harm dimensions, and a strategic developer reallocates mitigation efforts in response. We introduce the welfare-weighted under-detection gap BwB_w, the welfare-weighted true residual harm the audit fails to detect at the developer's strategic best response, and prove that naive DP auditing (uniform or harm-proportional allocation) induces a strictly larger BwB_w than any non-strategic mitigation baseline whenever effective detectability is heterogeneous, the welfare weights are not comonotone with detectability, and the developer's optimum is interior. We characterize the optimal auditor allocation as a four-factor balance of welfare weight, audit miss-probability, detectability elasticity, and mitigation-cost curvature, and provide a single-level reformulation of the bilevel problem via the developer's KKT system. We propose Strategic Private Audit Design (SPAD), a projected-gradient algorithm with hypergradients computed through the developer's best response.
Florian A. D. Burnat
Jun 10, 2026cs.LG

Let's Ask Gauss: Improved One-Run Privacy Auditing

Privacy auditing provides an important safeguard by estimating the actual information leaked by a model, thus ensuring that theoretical privacy guarantees hold in practice. We study empirical privacy auditing for differentially private (DP) machine learning, focusing on efficient one-run methods for mechanisms such as DP-SGD. Prior one-run approaches threshold training examples or "canaries" into binary membership guesses, which discards useful information. We show that, in the white-box DP-SGD setting, canary-aligned signals naturally form a sequence of random variables whose normalized sum is asymptotically Gaussian. Leveraging this distributional perspective, we develop a DP-auditing framework that leads to tighter privacy lower bounds from a single training run.
Adya Agrawal, Yu Wei, Jaspal Singh +2
Apr 20, 2026cs.CR

Tight Auditing of Differential Privacy in MST and AIM

State-of-the-art Differentially Private (DP) synthetic data generators such as MST and AIM are widely used, yet tightly auditing their privacy guarantees remains challenging. We introduce a Gaussian Differential Privacy (GDP)-based auditing framework that measures privacy via the full false-positive/false-negative tradeoff. Applied to MST and AIM under worst-case settings, our method provides the first tight audits in the strong-privacy regime. For (ε,δ)=(1,102)(ε,δ)=(1,10^{-2}), we obtain μemp0.43μ_{emp}\approx0.43 vs. implied μ=0.45μ=0.45, showing a small theory-practice gap. Our code is publicly available: https://github.com/sassoftware/dpmm.
Georgi Ganev, Meenatchi Sundaram Muthu Selva Annamalai, Bogdan Kulynych