Brave: Byzantine-Resilient and Privacy-Preserving Peer-to-Peer Federated Learning
Not on the map. Why?
Abstract (arXiv)
Federated learning (FL) enables multiple participants to train a global machine learning model without sharing their private training data. Peer-to-peer (P2P) FL advances existing centralized FL paradigms by eliminating the server that aggregates local models from participants and then updates the global model. However, P2P FL is vulnerable to (i) honest-but-curious participants whose objective is to infer private training data of other participants, and (ii) Byzantine participants who can transmit arbitrarily manipulated local models to corrupt the learning process. P2P FL schemes that simultaneously guarantee Byzantine resilience and preserve privacy have been less studied. In this paper, we develop Brave, a protocol that ensures Byzantine Resilience And privacy-preserving property for P2P FL in the presence of both types of adversaries. We show that Brave preserves privacy by establishing that any honest-but-curious adversary cannot infer other participants' private data by observing their models. We further prove that Brave is Byzantine-resilient, which guarantees that all benign participants converge to an identical model that deviates from a global model trained without Byzantine adversaries by a bounded distance. We evaluate Brave against three state-of-the-art adversaries on a P2P FL for image classification tasks on benchmark datasets CIFAR10 and MNIST. Our results show that the global model learned with Brave in the presence of adversaries achieves comparable classification accuracy to a global model trained in the absence of any adversary.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 18 of its 40 references that are in the map. First posted on arXiv 10 Jan 2024.
Builds on
18 of 40 references.
References · 18
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,461
- 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 698
- 2019Federated Learning with Differential Privacy: Algorithms and Performance Analysiscited by 528
- 2019Local Model Poisoning Attacks to Byzantine-Robust Federated Learningcited by 479
- 2017Deep Models Under the GAN: Information Leakage from Collaborative Deep Learningcited by 326
- 2020Data Poisoning Attacks Against Federated Learning Systemscited by 266
- 2018A Hybrid Approach to Privacy-Preserving Federated Learningcited by 208
- 2018RSA: Byzantine-Robust Stochastic Aggregation Methods for Distributed Learning from Heterogeneous Datasetscited by 148
- 2019BrainTorrent: A Peer-to-Peer Environment for Decentralized Federated Learningcited by 115
- 2019Peer-to-peer Federated Learning on Graphscited by 85
- 2020A Blockchain-based Decentralized Federated Learning Framework with Committee Consensuscited by 83
6 more
- 2019Federated Learning with Cooperating Devices: A Consensus Approach for Massive IoT Networkscited by 79
- 2019BAFFLE : Blockchain Based Aggregator Free Federated Learningcited by 38
- 2020Secure Byzantine-Robust Machine Learningcited by 18
- 2021A Decentralized Federated Learning Framework via Committee Mechanism with Convergence Guaranteecited by 16
- 2021Secure Byzantine-Robust Distributed Learning via Clusteringcited by 12
- 2022DeFL: Decentralized Weight Aggregation for Cross-silo Federated Learningcited by 2
Built on by
Not cited yet.