Paper 2026/1488
Privacy-Preserving Counterfactual Explanations for Federated AI
Abstract
As the usage of Artificial Intelligence (AI) for sensitive purposes increases, there is a growing need for privacy-aware explainable AI (XAI) tools. In this paper, we present a privacy-preserving counterfactual explanation algorithm. Our starting point is a decision-support model that is able to operate on vertically partitioned datasets, meaning that each party holds a different subset of datapoint attributes. The goal of a counterfactual algorithm is to find, given an observation, a datapoint from the (virtual) dataset that is closest to the observation but has a different label. Our algorithm fully preserves the privacy of the n datapoints belonging to the different parties by combining the strengths of homomorphic encryption and secret sharing. Through a number of experiments, we demonstrate the added value of combining multiple datasets in a realistic scenario and show that the privacy-preserving solution does not affect the accuracy. We fully implement our solution and demonstrate that it scales as to thousands of datapoints.
Metadata
- Available format(s)
-
PDF
- Category
- Applications
- Publication info
- Published elsewhere. Minor revision. SECRYPT 2026
- DOI
- 10.5220/0015066300004103
- Keywords
- XAICounterfactual ExplanationsPrivacy-Enhancing TechnologiesFederated Learning
- Contact author(s)
-
sjoerd berning @ tno nl
vincent dunning @ tno nl
thijs veugen @ tno nl
kevin witlox @ tno nl - History
- 2026-07-23: approved
- 2026-07-21: received
- See all versions
- Short URL
- https://ia.cr/2026/1488
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2026/1488,
author = {Sjoerd Berning and Vincent Dunning and Thijs Veugen and Kevin Witlox},
title = {Privacy-Preserving Counterfactual Explanations for Federated {AI}},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/1488},
year = {2026},
doi = {10.5220/0015066300004103},
url = {https://eprint.iacr.org/2026/1488}
}