Graph Backdoor
Zhaohan Xi, Ren Pang, Shouling Ji, Ting Wang

TL;DR
This paper introduces GTA, a novel backdoor attack on graph neural networks that uses subgraph triggers, adapts to individual graphs, and poses significant security threats across various GNN applications.
Contribution
GTA is the first backdoor attack specifically designed for GNNs, featuring graph-specific triggers, input adaptation, and applicability to multiple tasks without model knowledge.
Findings
GTA achieves high attack success rates on benchmark datasets.
It is effective across different GNN architectures and tasks.
Countermeasures and future research directions are discussed.
Abstract
One intriguing property of deep neural networks (DNNs) is their inherent vulnerability to backdoor attacks -- a trojan model responds to trigger-embedded inputs in a highly predictable manner while functioning normally otherwise. Despite the plethora of prior work on DNNs for continuous data (e.g., images), the vulnerability of graph neural networks (GNNs) for discrete-structured data (e.g., graphs) is largely unexplored, which is highly concerning given their increasing use in security-sensitive domains. To bridge this gap, we present GTA, the first backdoor attack on GNNs. Compared with prior work, GTA departs in significant ways: graph-oriented -- it defines triggers as specific subgraphs, including both topological structures and descriptive features, entailing a large design spectrum for the adversary; input-tailored -- it dynamically adapts triggers to individual graphs, thereby…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Advanced Graph Neural Networks
