ExpProof : Operationalizing Explanations for Confidential Models with ZKPs

Chhavi Yadav, Evan Laufer, Dan Boneh, Kamalika Chaudhuri
2/14/2026

No official code found. Best implementation: emlaufer/ExpProof (1 star, Rust, last commit 2025-05-20). 1 more below.

Abstract

In principle, explanations are intended as a way to increase trust in machine learning models and are often obligated by regulations. However, many circumstances where these are demanded are adversarial in nature, meaning the involved parties have misaligned interests and are incentivized to manipulate explanations for their purpose. As a result, explainability methods fail to be operational in such settings despite the demand \cite{bordt2022post}. In this paper, we take a step towards operationalizing explanations in adversarial scenarios with Zero-Knowledge Proofs (ZKPs), a cryptographic primitive. Specifically we explore ZKP-amenable versions of the popular explainability algorithm LIME and evaluate their performance on Neural Networks and Random Forests. Our code is publicly available at https://github.com/emlaufer/ExpProof.

View on arXivView PDF

Code Implementations(2)

emlaufer/ExpProofCommunity100%
Rust
12Rust, MetalSep 13, 20241 years ago

Code for the paper ExpProof : Operationalizing Explanations for Confidential Models with ZKPs

00Apr 9, 20251 years ago

Similar Papers

Cite this paper

@article{yadav2026expproof,
  title  = {ExpProof : Operationalizing Explanations for Confidential Models with ZKPs},
  author = {Chhavi Yadav and Evan Laufer and Dan Boneh and Kamalika Chaudhuri},
  year   = {2026},
  eprint = {2502.03773},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2502.03773},
  journal = {ICML 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.03773.svg)](https://codeofpaper.com/paper/2502.03773)

Discussion