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.
SHFL: Secure Hierarchical Federated Learning Framework for Edge Networks
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Federated Learning (FL) is a distributed machine learning paradigm designed for privacy-sensitive applications that run on resource-constrained devices with non-Identically and Independently Distributed (IID) data. Traditional FL frameworks adopt the client-server model with a single-level aggregation (AGR) process, where the server builds the global model by aggregating all trained local models received from client devices. However, this conventional approach encounters challenges, including susceptibility to model/data poisoning attacks. In recent years, advancements in the Internet of Things (IoT) and edge computing have enabled the development of hierarchical FL systems with a two-level AGR process running at edge and cloud servers. In this paper, we propose a Secure Hierarchical FL (SHFL) framework to address poisoning attacks in hierarchical edge networks. By aggregating trained models at the edge, SHFL employs two novel methods to address model/data poisoning attacks in the presence of client adversaries: 1) a client selection algorithm running at the edge for choosing IoT devices to participate in training, and 2) a model AGR method designed based on convex optimization theory to reduce the impact of edge models from networks with adversaries in the process of computing the global model (at the cloud level). The evaluation results reveal that compared to state-of-the-art methods, SHFL significantly increases the maximum accuracy achieved by the global model in the presence of client adversaries applying model/data poisoning attacks.
fields
cs.IT 1years
2024 1verdicts
ACCEPT 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.