aiqbench analysis
This research identifies a critical security vulnerability where explainability interfaces in Graph Machine Learning platforms can be weaponized to extract models under strict black-box constraints. By leveraging explanation subgraphs and edge sensitivity estimation, attackers can efficiently reconstruct decision boundaries without access to probability scores or gradients. These findings highlight the inherent risks of regulatory transparency mandates and underscore the urgent need for robust defensive mechanisms against model extraction attacks in graph neural networks.
Can Subgraph Explanations Be Weaponized to Steal Graph Neural Networks?
arXiv:2605.30470v2 Announce Type: replace Abstract: Graph Machine Learning as a Service (GMLaaS) platforms increasingly implement explainability interfaces to meet regulatory transparency requirements. However, this transparency creates exploitable vulnerabilities for model extraction attacks. We present the first model extraction attack specifically designed for graph classification under strict black-box constraints where the attacker observes only discrete class labels and binary explanation masks (no probability scores, gradients, or confidence values). Our method (1) uses model explanation outputs to guide Monte Carlo edge sensitivity estimation toward decision boundaries, with Hoeffding concentration guarantees on estimation accuracy and (2) exploits explanation subgraphs to efficiently narrow the boundary search space. Extensive experiments on benchmark graph datasets across multiple domains demonstrate our method's superiority over comparable baselines. These findings demonstrate that such explainability interfaces create exploitable attack surfaces, informing both defensive mechanisms and policy frameworks for explainable AI mandates. The implementation code is provided in https://github.com/LabRAI/XSTEAL/.
Title:Can Subgraph Explanations Be Weaponized to Steal Graph Neural Networks?
Abstract:Graph Machine Learning as a Service (GMLaaS) platforms increasingly implement explainability interfaces to meet regulatory transparency requirements. However, this transparency creates exploitable vulnerabilities for model extraction attacks. We present the first model extraction attack specifically designed for graph classification under strict black-box constraints where the attacker observes only discrete class labels and binary explanation masks (no probability scores, gradients, or confidence values). Our method (1) uses model explanation outputs to guide Monte Carlo edge sensitivity estimation toward decision boundaries, with Hoeffding concentration guarantees on estimation accuracy and (2) exploits explanation subgraphs to efficiently narrow the boundary search space. Extensive experiments on benchmark graph datasets across multiple domains demonstrate our method's superiority over comparable baselines. These findings demonstrate that such explainability interfaces create exploitable attack surfaces, informing both defensive mechanisms and policy frameworks for explainable AI mandates. The implementation code is provided in this https URL.
28 pages, 8 figures, 10 tables. Under review at NeurIPS 2026
Machine Learning (cs.LG)
arXiv:2605.30470 [cs.LG]
(or arXiv:2605.30470v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2605.30470 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 258 words
Related coverage
Do Explanations Increase the Risk of Decision Logic Leakage? Explanation-Guided Stealing of Graph Models
arXiv · Jun 3, 2026
From Abductive Explanations to Global Logical Rules for Node Classification in SGCs
arXiv · Aug 20, 2026
Towards Faithful Graph Explanations with Synergistic Edge Effects via Granular Balls
arXiv · Jul 24, 2026
GENIE: Watermarking Graph Neural Networks for Link Prediction
arXiv · Sep 2, 2026