Welcome to Journal of University of Chinese Academy of Sciences,Today is

Journal of University of Chinese Academy of Sciences

Previous Articles     Next Articles

FLShadow:Byzantine-robust federated aggregation based on a trusted shadow model

XU Chenchen1, WANG Xutong2,3, WANG Taochun1, CHEN Fulong1, LIU Qixu2,3   

  1. 1. School of Computer & Information, Anhui Normal University, Wuhu 241000, Anhui China;
    2. Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100085, China;
    3. School of Cyber Security, University of Chinese Academy of Sciences, Beijing 100049, China
  • Received:2023-10-08 Revised:2024-05-17 Online:2024-06-11

Abstract: In federated learning, Byzantine nodes carefully manipulate the model updates of clients. As a result, the central model accuracy decreases or fails to converge after aggregation. The number of communication rounds increases in turn. Without trusted reference gradients, the central model cannot be properly aggregated only based on updates provided by untrustworthy clients. In this paper, we introduce a trusted reference and we regard it as shadow model. To overcome such challenge, we propose a novel Byzantine robust federated aggregation method. The central server collects the shadow dataset in advance and trains a model called shadow model. The central server compares the update direction between the client model and the trusted shadow model. Accordingly, the central server computes malicious score and marks the malicious clients. Then, the central model deletes or prunes the update of the malicious clients. Finally, the central model aggregates the corrected gradients to ensure the convergence and accuracy of the model. The proposed method has been evaluated on a variety of model architectures and real datasets. The results show that the proposed method can effectively defend against six different Byzantine node attacks in three datasets.

Key words: federated learning, byzantine attack, shadow model, shadow dataset, aggregation rule

CLC Number: