Nowadays, many edge computing service providers expect to leverage the computational power and data of edge nodes to improve their models without transmitting data. Federated learning facilitates collaborative training of global models among distributed edge nodes without sharing their training data. Unfortunately, existing privacy-preserving federated learning applied to this scenario still faces three challenges: 1) It typically employs complex cryptographic algorithms, which results in excessive training overhead; 2) It cannot guarantee Byzantine robustness while preserving data privacy; and 3) Edge nodes have limited computing power and may drop out frequently. As a result, the privacy-preserving federated learning cannot be effectively applied to edge computing scenarios. Therefore, we propose a lightweight and secure federated learning scheme LSFL, which combines the features of privacy-preserving and Byzantine-Robustness. Specifically, we design the Lightweight Two-Server Secure Aggregation protocol, which utilizes two servers to enable secure Byzantine robustness and model aggregation. This scheme protects data privacy and prevents Byzantine nodes from influencing model aggregation. We implement and evaluate LSFL in a LAN environment, and the experiment results show that LSFL meets fidelity, security, and efficiency design goals, and maintains model accuracy compared to the popular FedAvg scheme.
4 August 2022 in IEEE Transactions on Network and Service Management
Federated learning, as a typical distributed learning paradigm, shows great potential in Industrial Internet of Things, Smart Home, Smart City, etc. It enables collaborative learning without data leaving local users. Despite the huge benefits, it still faces the risk of privacy breaches and a single point of failure for aggregation server. Adversaries can use intermediate models to infer user privacy, or even return incorrect global model by manipulating the aggregation server. To address these issues, several federated learning solutions focusing on privacy-preserving and security have been proposed. However, theses solutions still faces challenges in resource-limited scenarios. In this paper, we propose G-VCFL, a grouped verifiable chained privacy-preserving federated learning scheme. Specifically, we first use the grouped chain learning mechanism to guarantee the privacy of users, and then propose a verifiable secure aggregation protocol to guarantee the verifiability of the global model. G-VCFL does not require any complex cryptographic primitives and does not introduce noise, but enables verifiable privacy-preserving federated learning by utilizing lightweight pseudorandom generators. We conduct extensive experiments on real-world datasets by comparing G-VCFL with other state-of-the-art approaches. The experimental results and functional evaluation indicate that G-VCFL is efficient in the six experimental cases and satisfies all the intended design goals.
4 February 2025 in IEEE Transactions on Industrial Informatics
With the intelligence and automation of industrial Internet of Things, a new collaborative Cloud-Fog Automation paradigm has emerged. The emergence of federated learning (FL) has further enhanced the capabilities of Cloud-Fog Automation, making it possible to develop more secure and versatile collaborative industrial models. However, FL faces various security risks. More importantly, the security risks faced by FL when applied in Cloud-Fog Automation, along with corresponding security measures, have not yet been explored. To address this issue, we make an initial attempt to analyze the security of FL within the context of Cloud-Fog Automation, with the aim of facilitating the design of a more secure FL framework for this paradigm. Specifically, we first analyze the security risks that may be encountered at different phases, then analyze the challenges that need to be faced to resolve these risks. Subsequently, we conduct a systematic review of the state-of-the-art security solutions, and finally summarize the future research directions.
Federated learning in mobile edge computing allows a larger number of devices to jointly train an accurate machine learning model without collecting local data from edge nodes. However, there are two major challenges to using federated learning for mobile edge computing. The first is that mobile edge computing networks only tolerate a limited communication overhead, that is, communication overhead between edge nodes, edge servers, and cloud servers cannot be excessive. Unfortunately, federated learning clients send a large number of local model update that do not meet realistic requirements. The second is that resource-constrained edge nodes are vulnera-ble to attacks, that is, these edge nodes are highly vulnerable to potential adversary compromise and can be used to launch Byzantine attacks. To address the aforementioned challenges, we propose a communication-efficient and Byzan-tine-robust federated learning for mobile edge computing networks named CBFL. Specifically, edge nodes compress local model updates by taking element-wise signs for local model updates. Then, edge nodes sends it to the edge server for local model aggregation. Finally, the cloud server uses a small evaluation dataset to evaluate the edge servers' local model aggregation results and utilizes the evaluation results for global model aggregation. Moreover, extensive experiments are also conducted to evaluate the performance of the proposed CBFL, and the results show that our CBFL can withstand Byzantine attacks while maintaining communication efficiency.
20 March 2024 in IEEE Transactions on Sustainable Computing
Federated Learning (FL), as a distributed machine learning technique, has promise for training models with distributed data in Artificial Intelligence of Things (AIoT). However, FL is vulnerable to Byzantine attacks from diverse participants. While numerous Byzantine-robust FL solutions have been proposed, most of them involve deploying defenses at either the aggregation server or the participant level, significantly impacting the original FL process. Moreover, it will bring extra computational burden to the server or the participant, which is especially unsuitable for the resource-constrained AIoT domain. To resolve the aforementioned concerns, we propose FL-Auditor, a Byzantine-robust FL approach based on public auditing. Its core idea is to use a Third-Party Auditor (TPA) to audit samples from the FL training process, analyzing the trustworthiness of different participants, thereby helping FL obtain a more robust global model. In addition, we also design a lazy update mechanism to reduce the negative impact of sampling audit on the performance of the global model. Extensive experiments have demonstrated the effectiveness of our FL-Auditor in terms of accuracy, robustness against attacks, and flexibility. In particular, compared to the existing method, our FL-Auditor significantly reduces the computation time on the aggregation server by 8×-17×.
20 May 2024 in IEEE Transactions on Information Forensics and Security
Existing multitask outsourcing computations struggle to guarantee the fairness for participants and the correctness of the computation results. Some solutions use blockchain to address the fairness issue in outsourcing computations. However, blockchain suffers from poor data privacy due to its public and transparent nature, as well as the latency because of limited scalability. To effectively confront these problems, we propose the Libras: a fair, secure, verifiable and scalable outsourcing computation scheme based on blockchain. In Libras, tasks are divided into multiple sub-task blocks, coupled with a deposit mechanism that enforces fairness throughout the process. Libras integrates a commitment mechanism with on-chain and off-chain collaboration for security, where the computation results are securely stored off-chain while proofs of these results are immutably recorded on-chain. Moreover, it employs a Directed Acyclic Graph (DAG)-based ledger architecture to significantly expedite transaction confirmations and facilitate elastic scalability. Furthermore, we devise a batch verification algorithm to simultaneously verify the accuracy of all computation results. Theoretical analysis and experiments demonstrate that Libras is fair, secure, verifiable, and scalable. The comparison results indicate that the verification time is $1.2\times $ that of FVP-EOC.