A clean-label graph backdoor attack method in node classification task
원문 초록
Backdoor attacks in the traditional graph neural networks (GNNs) field are easily detectable due to the dilemma of confusing labels. To explore the backdoor vulnerability of GNNs and create a more stealthy backdoor attack method, a clean-label graph backdoor attack method(CGBA) in the node classification task is proposed in this paper. Differently from existing backdoor attack methods, CGBA requires neither modification of node labels nor graph structure. Specifically, to solve the problem of inconsistency between the contents and labels of the samples, CGBA selects poisoning samples in a specific target class and uses the label of sample as the target label (i.e., clean-label) after injecting triggers into the target samples. To guarantee the similarity of neighboring nodes, the raw features of the nodes are elaborately picked as triggers to further improve the concealment of the triggers. Extensive experiments results show the effectiveness of our method. When the poisoning rate is 0.04, CGBA can achieve an average attack success rate of 87.8%, 98.9%, 89.1%, and 98.5%, respectively.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
A Semantic and Clean-label Backdoor Attack against Graph Convolutional Networks
Demystifying Distributed Training of Graph Neural Networks for Link Prediction
Equivariance Everywhere All At Once: A Recipe for Graph Foundation Models
Delving into Instance-Dependent Label Noise in Graph Data: A Comprehensive Study and Benchmark
Invisible Backdoor Triggers in Image Editing Model via Deep Watermarking
Improving the Effective Receptive Field of Message-Passing Neural Networks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.