FedSSuper: A Secure and Private Federated Learning Under Trusted Supervision

Federated Learning (FL) allows multiple clients and a server to jointly learn a global model while keeping their training data private. However, FL has been proved to be vulnerable to Byzantine attacks where malicious clients submit misleading updates to the server to further manipulate the global model, and inference attacks where the curious server infers clients' training data via analyzing their updates. Mitigating both Byzantine and inference attacks is highly challenging since resisting inference attacks prohibits access to clients' updates, but preventing Byzantine attacks requires such access. Several existing works focusing on such two intuitively conflicting events cannot achieve desirable performance with the Byzantine ratio larger than 0.5, and moreover did not consider the non-independent and identically distributed (non-IID) data, especially the completely non-IID cases. To this end, we propose a secure and private <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Fed</u>erated Learning under tru<underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">S</u>ted <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Super</u>vision (FedSSuper). The intuition of FedSSuper is that the server first deploys a shadow dataset on the clients to supervise the local training on clients and thereby adaptively tame Byzantines. Likewise, clients supervise the aggregation of local updates on the server side via Secret Sharing based Secure P-Parties Computation, thereby resisting inference attacks. Finally, we theoretically prove FedSSuper's security and privacy guarantees against Byzantine and inference attacks, robustness to clients' dropouts, and desirable computation and communication complexity. Extensive experiments on three datasets and comparisons to seven existing defenses demonstrate the superior performance of FedSSuper against two state-of-the-art Byzantine attacks with large Byzantine ratio 0.7 and high level of non-IID data 1.0, as well as the well-designed inference attacks.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Network Science and Engineering
Published
2025-05-30
DOI
https://doi.org/10.1109/tnse.2025.3572493
Citations
2
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
4.96

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

FedSSuper: A Secure and Private Federated Learning Under Trusted Supervision

Ping Zhao, Guanglin Zhang, Jin Jiang
2 citations
IEEE Transactions on Network Science and Engineering
Cryptography and Data Security
4.96
article

FedSSuper: A Secure and Private Federated Learning Under Trusted Supervision

Ping Zhao, Guanglin Zhang, Jin Jiang
article en
2 citations

Abstract

Federated Learning (FL) allows multiple clients and a server to jointly learn a global model while keeping their training data private. However, FL has been proved to be vulnerable to Byzantine attacks where malicious clients submit misleading updates to the server to further manipulate the global model, and inference attacks where the curious server infers clients' training data via analyzing their updates. Mitigating both Byzantine and inference attacks is highly challenging since resisting inference attacks prohibits access to clients' updates, but preventing Byzantine attacks requires such access. Several existing works focusing on such two intuitively conflicting events cannot achieve desirable performance with the Byzantine ratio larger than 0.5, and moreover did not consider the non-independent and identically distributed (non-IID) data, especially the completely non-IID cases. To this end, we propose a secure and private <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Fed</u>erated Learning under tru<underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">S</u>ted <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Super</u>vision (FedSSuper). The intuition of FedSSuper is that the server first deploys a shadow dataset on the clients to supervise the local training on clients and thereby adaptively tame Byzantines. Likewise, clients supervise the aggregation of local updates on the server side via Secret Sharing based Secure P-Parties Computation, thereby resisting inference attacks. Finally, we theoretically prove FedSSuper's security and privacy guarantees against Byzantine and inference attacks, robustness to clients' dropouts, and desirable computation and communication complexity. Extensive experiments on three datasets and comparisons to seven existing defenses demonstrate the superior performance of FedSSuper against two state-of-the-art Byzantine attacks with large Byzantine ratio 0.7 and high level of non-IID data 1.0, as well as the well-designed inference attacks.

IEEE Transactions on Network Science and EngineeringVol. 12(6)
Donghua University (CN)
National Natural Science Foundation of China, Fundamental Research Funds for the Central Universities
Partnerships for the goals
Openalex Percentile: Top 5%
Cryptography and Data Security
4.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.