LGAIMar 8

Hide and Find: A Distributed Adversarial Attack on Federated Graph Learning

arXiv:2603.07743v1
Predicted impact top 57% in LG · last 90 daysOriginality Highly original
AI Analysis

This work addresses the vulnerability of Federated Graph Learning to adversarial attacks, which is a significant problem for the security and reliability of distributed graph learning systems.

This paper proposes FedShift, a two-stage distributed adversarial attack on Federated Graph Learning (FedGL) that injects a hidden "shifter" into training data to subtly push graph representations towards a target class boundary. The method achieves the highest attack effectiveness compared to existing methods, evades 3 mainstream defense algorithms, and reduces time cost by over 90%.

Federated Graph Learning (FedGL) is vulnerable to malicious attacks, yet developing a truly effective and stealthy attack method remains a significant challenge. Existing attack methods suffer from low attack success rates, high computational costs, and are easily identified and smoothed by defense algorithms. To address these challenges, we propose \textbf{FedShift}, a novel two-stage "Hide and Find" distributed adversarial attack. In the first stage, before FedGL begins, we inject a learnable and hidden "shifter" into part of the training data, which subtly pushes poisoned graph representations toward a target class's decision boundary without crossing it, ensuring attack stealthiness during training. In the second stage, after FedGL is complete, we leverage the global model information and use the hidden shifter as an optimization starting point to efficiently find the adversarial perturbations. During the final attack, we aggregate these perturbations from multiple malicious clients to form the final effective adversarial sample and trigger the attack. Extensive experiments on six large-scale datasets demonstrate that our method achieves the highest attack effectiveness compared to existing advanced attack methods. In particular, our attack can effectively evade 3 mainstream robust federated learning defense algorithms and converges with a time cost reduction of over 90\%, highlighting its exceptional stealthiness, robustness, and efficiency.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes