Evidence Hub

Privacy-Preserving and Byzantine-Robust Federated Learning

Caiqin Dong, Jian Weng, Ming Li, Jia-Nan Liu, Zhiquan Liu, Yu-Dan Cheng, Shui Yu

IEEE Transactions on Dependable and Secure Computing, 2024

87 citations

Abstract

Federated learning (FL) trains a model over multiple datasets by collecting the local models rather than raw data, which can help facilitate distributed data analysis in many real-world applications. Since the model parameters can leak information about the training datasets, it is necessary to preserve the privacy of the FL participants’ local models. Furthermore, FL is vulnerable to poisoning attacks which can significantly decrease the model utility. To settle the above issues, we propose a privacy-preserving and Byzantine-robust FL scheme $\Pi _{\text{P2Brofl}}$ΠP2Brofl that maintains robustness in the presence of poisoning attacks and preserves the privacy of local models simultaneously. Specifically, $\Pi _{\text{P2Brofl}}$ΠP2Brofl leverages three-party computation (3 PC) to securely achieve a Byzantine-robust aggregation method. To improve the efficiency of privacy-preserving local model selection and aggregation, we propose a maliciously secure top-$k$k protocol $\Pi _{\text{top}-k}$Πtop-k that has low communication overhead. Moreover, we present an efficient maliciously secure shuffling protocol $\Pi _{\text{shuffle}}$Πshuffle since secure shuffling is necessary for our secure top-$k$k protocol. The security proof of the scheme is given and experiments on real-world datasets are conducted in this paper. When the proportion of Byzantine participants is 50%, the error rate of the model only increases by 1.05% while it increases by 23.78% without using our protection.

Read the paper

Related studies

Go deeper in Evidence Hub

Evidence Hub adds a study data sheet (design, sample size, evidence level, key numbers), an AI summary and a chat grounded in the paper's text.

Open this study Sign up free