For a user-helper-master network with straggling links and up to T colluding helpers, the optimal user-to-helper and helper-to-master rates are both 1/(N_r - T), and secure aggregation is impossible when N_r is at most T.
Secure Aggregation for Buffered Asynchronous Federated Learning
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Federated learning (FL) typically relies on synchronous training, which is slow due to stragglers. While asynchronous training handles stragglers efficiently, it does not ensure privacy due to the incompatibility with the secure aggregation protocols. A buffered asynchronous training protocol known as FedBuff has been proposed recently which bridges the gap between synchronous and asynchronous training to mitigate stragglers and to also ensure privacy simultaneously. FedBuff allows the users to send their updates asynchronously while ensuring privacy by storing the updates in a trusted execution environment (TEE) enabled private buffer. TEEs, however, have limited memory which limits the buffer size. Motivated by this limitation, we develop a buffered asynchronous secure aggregation (BASecAgg) protocol that does not rely on TEEs. The conventional secure aggregation protocols cannot be applied in the buffered asynchronous setting since the buffer may have local models corresponding to different rounds and hence the masks that the users use to protect their models may not cancel out. BASecAgg addresses this challenge by carefully designing the masks such that they cancel out even if they correspond to different rounds. Our convergence analysis and experiments show that BASecAgg almost has the same convergence guarantees as FedBuff without relying on TEEs.
citation-role summary
citation-polarity summary
fields
cs.IT 1years
2024 1verdicts
ACCEPT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Capacity of Hierarchical Secure Coded Gradient Aggregation with Straggling Communication Links
For a user-helper-master network with straggling links and up to T colluding helpers, the optimal user-to-helper and helper-to-master rates are both 1/(N_r - T), and secure aggregation is impossible when N_r is at most T.