This work formalizes protection against a strong-adversary threat model as per-report $(0, \delta)-differential privacy on the transcript of audit selections, and proves that a natural approach can never outperform uniform random auditing by more than $\delta$ at any horizon.
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, \delta)$-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 $\delta$ at any horizon. We then give a generic mechanism that reduces private auditing to private continual counting: any $(0, \delta)$-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, \delta)$-DP with noise scaling as $O(\sqrt{\log T})$ across a horizon of $T$ 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 $\sqrt{\log T}$. Simulations show a substantial improvement over randomized response.
A novel audit protocol designed to significantly increase the post-audit detectability of manipulations by enabling the auditor to query the model in an oblivious manner and providing theoretical guarantees showing that, under this protocol, a provider attempting to hide unfairness must falsify a significantly larger n...
Augustin Godinot, Sofiane Azogagh, Julien Ferry et al.· 0 citations
This paper fills the gap in provable anonymity guarantees for Zcash and Firo under the compromise of the incoming viewing key, while, at the same time, exposing problems with Monero.
Adrian Cinal· IACR Cryptology ePrint Archi...· 0 citations
A lightweight black-box auditing framework that injects four silent failure profiles across 12 production-adjacent tool stubs and classifies agent responses into three mutually exclusive behavioral classes: Honest Surrender (HSR), Fabrication (FAR), and Unfaithful Safety Refusal (USR).
An empirical evaluation in a cybersecurity case study with two networks and real vulnerabilities drawn from CVE and scored using the Common Vulnerability Scoring System shows that QSE beats Stackelberg in realized defender utility spanning 144 scenarios with specification errors and 25 parameter configurations.
Asif Rahman, Md Abu Sayed, Ahmed Ann Noor Ryen et al.· 0 citations
A deployable mechanism combining history-dependent challenges, reputation-weighted slashing, and stake vesting is proposed, which restores infinite-horizon subgame-perfect incentive compatibility against stationary mixed-strategy deviations above an explicit discount-factor threshold without per-query cryptographic ver...
GuardianAgent, a policy-conditioned anonymization framework that couples structured risk assessment with verified adaptive rewriting, achieves the strongest privacy-utility trade-off among published baselines and is the only method to reach more than 0.90 privacy in all three domains, remaining robust under a backbone...
Rui-Yi Yang, Gayathri Lihinikaduarachchi, Rahat Masood et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.