VLDB 2026 Research / reviewers in the wild / expert
Vincent Dunning
dblp:318/5228
· DBLP profile ↗
4ranked-venue papers
0as first author
4since 2021 · last 2026
0009-0004-1148-3017ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 4 · 4 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Privacy-Preserving Counterfactual Explanations for Federated AIabstractAs 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. © 2026 by SCITEPRESS – Science and Technology Publications, Ltd. Sjoerd Berning, Vincent Dunning, Thijs Veugen, Kevin Witlox |
SECRYPT (1) | 2 |
| 2024 | The Trade-off Between Privacy & Quality for Counterfactual ExplanationsabstractCounterfactual explanations are a promising direction of explainable AI in many domains such as healthcare. These explanations produce a counterexample from the dataset that shows, for example, what should change about a patient to reduce their risk of developing diabetes type 2. However, this poses a clear privacy risk when the dataset contains information about people. Recent literature shows that this risk can be mitigated by using k-anonymity to generalise the explanation, such that it is not about a single person. In this paper, we investigate the trade-offs between privacy and explanation quality in the medical domain. Our results show that for around 40% of the explained cases, the real gain in privacy is limited as the generalisation increases while the explanations continue decreasing in quality. These findings suggest that this can be an unsuitable strategy in some situations, as its effectiveness depends on characteristics of the underlying dataset. Sjoerd Berning, Vincent Dunning, Dayana Spagnuelo, Thijs Veugen, Jasper van der Waa |
ARES | 2 |
| 2024 | Privacy-Preserving Anti-money Laundering Using Secure Multi-party Computation
Marie Beth van Egmond, Vincent Dunning, Stefan van den Berg, Thomas Rooijakkers, Alex Sangers, Ton Poppe, Jan Veldsink |
FC (2) | 2 |
| 2022 | Efficient Compiler to Covert Security with Public Verifiability for Honest Majority MPC
Thomas Attema, Vincent Dunning, Maarten H. Everts, Peter Langenkamp |
ACNS | 2 |