TY - GEN
T1 - A2GBD
T2 - 35th ACM Web Conference, WWW 2026
AU - Du, Chenxu
AU - Liu, Yang
AU - Yu, Xingtong
AU - Xu, Zhuoer
AU - Liu, Yang
AU - Li, Tianrui
N1 - Publisher Copyright:
© 2026 Owner/Author.
PY - 2026/4/12
Y1 - 2026/4/12
N2 - Graph Neural Networks (GNNs) are vulnerable to graph backdoor attacks, which poses severe risks to their deployment in safety-critical applications. Existing defenses predominantly focus on specific backdoor triggers, making them brittle and unable to generalize across different backdoor triggers with varying properties. Motivated by this limitation, this work proposes an attack-agnostic graph backdoor defense mechanism A2GBD, which does not require prior knowledge of the specific attack strategies (e.g., edge perturbation, node attribute manipulation) to achieve effective defense. A2GBD consists of suspicious node selection and defense strategy generation. The selection module selects high-suspicion nodes to enhance defense awareness, while the defense agent adaptively determines and executes defense strategies. Extensive experiments on multiple benchmark datasets demonstrate that A2GBD consistently lowers attack success rates while maintaining high clean accuracy, showing strong robustness and generalizability against diverse graph backdoor attack strategies.
AB - Graph Neural Networks (GNNs) are vulnerable to graph backdoor attacks, which poses severe risks to their deployment in safety-critical applications. Existing defenses predominantly focus on specific backdoor triggers, making them brittle and unable to generalize across different backdoor triggers with varying properties. Motivated by this limitation, this work proposes an attack-agnostic graph backdoor defense mechanism A2GBD, which does not require prior knowledge of the specific attack strategies (e.g., edge perturbation, node attribute manipulation) to achieve effective defense. A2GBD consists of suspicious node selection and defense strategy generation. The selection module selects high-suspicion nodes to enhance defense awareness, while the defense agent adaptively determines and executes defense strategies. Extensive experiments on multiple benchmark datasets demonstrate that A2GBD consistently lowers attack success rates while maintaining high clean accuracy, showing strong robustness and generalizability against diverse graph backdoor attack strategies.
KW - attack-agnostic
KW - graph backdoor attack
KW - graph backdoor defense
UR - https://www.scopus.com/pages/publications/105038540281
U2 - 10.1145/3774904.3792507
DO - 10.1145/3774904.3792507
M3 - 会议稿件
AN - SCOPUS:105038540281
T3 - WWW 2026 - Proceedings of the ACM Web Conference 2026
SP - 1229
EP - 1239
BT - WWW 2026 - Proceedings of the ACM Web Conference 2026
PB - Association for Computing Machinery, Inc
Y2 - 29 June 2026 through 3 July 2026
ER -