FBA: Fairness Backdoor Attack on Graph Neural Networks

Graph neural networks (GNNs) are a set of methods that aim to apply deep neural networks to graph-structured data. Despite their promising performance on various graph analysis tasks, they might have discrimination towards certain populations when exploited in human-centered applications without fairness considerations. Moreover, extant studies have shown that GNNs are vulnerable to backdoor attacks, through which malicious users can degrade the predication performance of GNNs. Nevertheless, attacks to the fairness of GNNs are still unexplored. In this paper, we analyze the limitations of existing GNNs backdoor attacks, and propose a novel fairness backdoor attack (FBA) method for GNNs. Firstly, we provide the candidate space selection mechanism to select the fair node candidate space using the long-tail distribution, which facilitates the subsequent generation of triggers. Secondly, we develop the trigger generation strategy to generate fairness triggers by quantifying the deviations between different groups of sensitive attributes, enabling the attack to degrade the fairness almost without affecting the accuracy. Finally, we undertake extensive evaluation experiments on real datasets and state-of-the-art models to demonstrate the effectiveness of the FBA method, including five mainstream models (GCN, GraphSAGE, GAT, GAE, and VGAE), three downstream tasks (node classification, graph classification and link prediction), and two fair GNNs (NIFTY and Fairedit).

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Dependable and Secure Computing
Published
2025-04-23
DOI
https://doi.org/10.1109/tdsc.2025.3563668
Citations
4
Primary Topic
Adversarial Robustness in Machine Learning
Type
article
Field-Weighted Citation Impact
9.92
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

FBA: Fairness Backdoor Attack on Graph Neural Networks

Minghao Xu, Fengrui Hao, Ming Liu, Tianlong Gu
4 citations
IEEE Transactions on Dependable and Secure Computing
Adversarial Robustness in Machine Learning
9.92
article

FBA: Fairness Backdoor Attack on Graph Neural Networks

Minghao Xu, Fengrui Hao, Ming Liu, Tianlong Gu
article en
4 citations

Abstract

Graph neural networks (GNNs) are a set of methods that aim to apply deep neural networks to graph-structured data. Despite their promising performance on various graph analysis tasks, they might have discrimination towards certain populations when exploited in human-centered applications without fairness considerations. Moreover, extant studies have shown that GNNs are vulnerable to backdoor attacks, through which malicious users can degrade the predication performance of GNNs. Nevertheless, attacks to the fairness of GNNs are still unexplored. In this paper, we analyze the limitations of existing GNNs backdoor attacks, and propose a novel fairness backdoor attack (FBA) method for GNNs. Firstly, we provide the candidate space selection mechanism to select the fair node candidate space using the long-tail distribution, which facilitates the subsequent generation of triggers. Secondly, we develop the trigger generation strategy to generate fairness triggers by quantifying the deviations between different groups of sensitive attributes, enabling the attack to degrade the fairness almost without affecting the accuracy. Finally, we undertake extensive evaluation experiments on real datasets and state-of-the-art models to demonstrate the effectiveness of the FBA method, including five mainstream models (GCN, GraphSAGE, GAT, GAE, and VGAE), three downstream tasks (node classification, graph classification and link prediction), and two fair GNNs (NIFTY and Fairedit).

IEEE Transactions on Dependable and Secure ComputingVol. 22(5)
Jinan University (CN), Guangzhou Mechanical Engineering Research Institute (China) (CN), Guangzhou Chemistry (China) (CN), Shanghai Key Laboratory of Trustworthy Computing (CN)
Openalex Percentile: Top 2%
Adversarial Robustness in Machine Learning
9.92
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.