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 number of responses.
Abstract
Audits have emerged as a critical instrument for algorithmic governance, providing a mechanism for external scrutiny and governance of machine learning models. However, ensuring the integrity of such assessments remains a challenging issue. For instance in regulatory contexts, audits are typically declared or easily detected, thus enabling model providers to manipulate the process, whether intentionally or inadvertently. This vulnerability is particularly acute in the context of fairness evaluations, in which providers can often infer sensitive attributes and strategically equalize allocation rates between groups to satisfy fairness metrics. In this paper, we introduce a novel audit protocol designed to significantly increase the post-audit detectability of such manipulations by enabling the auditor to query the model in an oblivious manner. Our approach leverages a Private Information Retrieval mechanism to require the provider to label a large set of instances, while preventing it from knowing which subset will ultimately be used for the audit. The protocol is efficient, imposes minimal overhead on the auditor, and requires no modification to the audited model, its training procedure, or its inference pipeline. We provide theoretical guarantees showing that, under this protocol, a provider attempting to hide unfairness must falsify a significantly larger number of responses, thereby increasing both the difficulty and the likelihood of detection of manipulation. Experimental results across representative audit scenarios confirm the effectiveness and practicality of our approach.
The Consistency Radius is introduced, a metric that quantifies the maximum distribution shift under which an audit conclusion based on a third-party dataset remains consistent, and a convex relaxation-based optimization method to estimate the radius using only model responses over the audit dataset is proposed.
Yuan-Hao Liu, Qi Cao, Hua-Wei Shen· Proceedings of the Thirty-Fi...· 0 citations
This work forms fairness auditing as a min-max optimization between a computationally unbounded company and a budget-constrained auditor, and demonstrates that increasing audit resources reduces, but does not eliminate, the scope for post-audit manipulation.
Rachit Verma, P. Manisha, Sujit Gujar· 0 citations
This work formalizes rigorous cryptographic security notions tailored to CMC frameworks, introduces a generic protocol template, and proves that it satisfies these requirements, which offer both cautionary evidence about existing approaches and constructive guidance for designing secure, privacy-preserving ML auditing...
Carter Luck, Olive Franzese-McLaughlin, Elisaweta Masserova et al.· 0 citations
A novel defense framework is introduced that leverages a Zero-Trust architecture (ZTA) design to be incorporated within the XAI explanation supply chain and ensures the integrity of the generated explanation and evaluates how ExplainGuard can effectively neutralize state- of-the-art explanation manipulation attacks whi...
Maraz Mia, Shovan Roy, M. M. A. Pritom et al.· 0 citations
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.
Security analysis demonstrates that SecuAudit can effectively resist data forgery, metadata tampering, and sub-threshold collusion attacks under the defined threat model, and establishes a feasible framework for secure data circulation under the evaluated deployment assumptions.
Yufa Shi, Jia-Xing Hu, Li-Peng Wang et al.· Computers, Materials & C...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.