mlsanityData to 14 Oct 2026

Plausible Deniability Guarantees for Whistleblowers

arXiv 2607.13928 ↗First posted 15 Jul 2026cs.CR cs.LG stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

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, δ)-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, δ)-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, δ)-DP with noise scaling as O(√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 √log T. Simulations show a substantial improvement over randomized response.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 14 of its 38 references that are in the map. First posted on arXiv 15 Jul 2026.

Builds on

14 of 38 references.

References · 14

  1. 2020Closing the AI Accountability Gap: Defining an End-to-End Framework for Internal Algorithmic Auditingcited by 384
  2. 2023Privacy Auditing with One (1) Training Runcited by 123
  3. 2018Private Selection from Private Candidatescited by 75
  4. 2015Algorithms for Differentially Private Multi-Armed Banditscited by 45
  5. 2019Towards Formalizing the GDPR's Notion of Singling Outcited by 26
  6. 2022Almost Tight Error Bounds on Differentially Private Continual Countingcited by 26
  7. 2022Constant matters: Fine-grained Complexity of Differentially Private Continual Observationcited by 23
  8. 2020Permute-and-Flip: A new mechanism for differentially private selectioncited by 22
  9. 2024Efficient and Near-Optimal Noise Generation for Streaming Differential Privacycited by 17
  10. 2025Unifying Re-Identification, Attribute Inference, and Data Reconstruction Risks in Differential Privacycited by 15
  11. 2024Lower Bounds for Differential Privacy Under Continual Observation and Online Threshold Queriescited by 12
  12. 2024Responsible Reporting for Frontier AI Developmentcited by 10
2 more
  1. 2024Streaming Private Continual Counting via Binningcited by 7
  2. 2015Riposte: An Anonymous Messaging System Handling Millions of Userscited by 4

Built on by

Not cited yet.