FBFL: Flexible Byzantine-Robust Federated Learning With Privacy-Preserving
- 9 December 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 14 (1) , 224-241
Abstract
Privacy-preserving federated learning allows many clients to collaboratively train a machine learning model by sharing encrypted models. Among them, mask-based schemes have been widely applied due to their efficiency advantages. Unfortunately, as the invisibility of an individual local model, such schemes are vulnerable to poisoning attacks by Byzantine clients. Current work lacks a practical method to detect Byzantine clients within the mask-based scheme. We propose FBFL, a flexible Byzantine-robust federated learning scheme with privacy-preserving. While protecting the privacy of the client, we implement a defense against Byzantine clients without relying on an individual masked local model. Specifically, we design a secure distance computation method based on the Pedersen commitment. The exponential Manhattan distance we design is utilized to compute the malicious score of the client in order to distinguish the benign model from the abnormal model. Since the malicious score is obtained utilizing only the commitment value and not the masked local model, our Byzantine-robust method can be flexibly combined with other mask-based privacy-preserving methods. Security analysis shows that FBFL is Byzantine-robust and can ensure the data security of clients. Experimental evaluation shows that the robustness and efficiency of FBFL are great.Keywords
Funding Information
- National Natural Science Foundation of China (62472047)
- National Natural Science Foundation of China (62572068)
- National Natural Science Foundation of China (62502042)
- National Natural Science Foundation of China (62572073)
- National Natural Science Foundation of China (62172055)
- BUPT Excellent Ph.D. Students Foundation (CX2023122)
This publication has 39 references indexed in Scilit:
- Byzantine-robust Decentralized Federated Learning via Dual-domain Clustering and Trust Bootstrapping2024
- Efficient and Straggler-Resistant Homomorphic Encryption for Heterogeneous Federated Learning2024
- HeteroSAg: Secure Aggregation With Heterogeneous Quantization in Federated LearningIEEE Transactions on Communications, 2022
- SEAR: Secure and Efficient Aggregation for Byzantine-Robust Federated LearningIEEE Transactions on Dependable and Secure Computing, 2021
- Federated Learning for Internet of Things: A Comprehensive SurveyIEEE Communications Surveys & Tutorials, 2021
- Byzantine-Resilient Secure Federated LearningIEEE Journal on Selected Areas in Communications, 2020
- Federated Learning for Open Banking2020
- Identity-Based Encryption from the Weil Pairing2001
- Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing2001
- How to generate cryptographically strong sequences of pseudo random bits1982