28 October 2024 in IEEE Internet of Things Journal
In edge computing environments, the rapid growth of Internet of Things (IoT) devices presents significant challenges for data processing. These devices are often resource-constrained, leading to a tradeoff between achieving efficiency and ensuring security. On one hand, traditional certificateless encryption methods are computationally expensive; on the other hand, offloading the computational load to third-party entities can enhance efficiency but still introduces security risks. To address these issues, this article proposes a novel lightweight certificateless edge-assisted encryption scheme (CL-EAED). Ours scheme offloads computationally intensive tasks to edge servers, ensuring that edge-assisted processing does not expose sensitive information and only needs to be performed once. This approach effectively prevents data leakage and enhances both the efficiency and security of task offloading. Moreover, the CL-EAED scheme achieves IND-CCA security in standard model (SM) and has been validated using the ProVerif tool. Experimental evaluations demonstrate that CL-EAED eliminates the dependency on computationally intensive pairing operations, significantly reducing computational and communication costs. It outperforms existing solutions in terms of energy consumption, latency, and scalability, fully meeting the requirements of practical applications.
12 April 2024 in IEEE Internet of Things Journal
Federated learning (FL) allows clients to keep local data sets and train collaboratively by uploading model gradients, which achieves the goal of learning from fragmented sensitive data. Although FL prevents clients’ data sets from being shared directly, local private information may be leaked through gradients. To mitigate this problem, we combine game theory to design an FL scheme (incentive mechanism for the FL) based on the incentive mechanism and differential privacy (DP). First, we explore three DP variants, all of which are resistant to deep leakage from gradients (DLG) but differ in their level of privacy protection. In addition, we perform the convergence analysis of the FL model based on DP. Then, with the assistance of game theory, we analyze the natural state of the server and clients in the FL process and formulate the utility function of both sides under the case of considering the attack. Finally, we establish the optimization problem as a Stackelberg game and solve for the optimal strategy of the server and clients by deriving the Nash equilibrium to achieve personalized protection. Theoretical proof demonstrates that both types of entities can achieve optimal actions by maximizing their utility functions upon reaching the Nash equilibrium. Besides, extensive experiments are conducted on real-world data sets to demonstrate that the IMFL is efficient and feasible.
15 April 2025 in IEEE Internet of Things Journal
Delegation learning (DL) flourishes data sharing, enabling agents to delegate data to the cloud for model training. To preserve privacy, homomorphic encryption (HE) offers an effective solution for privacy-preserving machine learning (PPML) in DL, yet faces critical challenges in functionality (nonlinear activation support), practicality (ciphertext blow-up from iterative computations), and security (data leakage risks caused by public knowledge of the mathematical principles applied in model training). To tackle these challenges, we propose THC-DL, a three-party HE framework addressing these challenges holistically for the first time. We elaborately design the ciphertext secure comparison (DL-CSC) protocol to satisfy secure comparison with private inputs, enabling efficient nonlinear operations with $\mathcal {O}(1)$ communication complexity that reduces runtime to 12.5% of the DGK (Dolev-Greensmith-Kent protocol, the well-known comparison protocol). Second, we construct a Truncation-Mapping (Tru-Map) scheme, a mechanism that transforms input data by truncating and mapping it into a domain that facilitates more efficient processing, and the addition of truncated mapped data to resolve ciphertext blow-up by adaptively scaling ciphertexts during iterative training, ensuring correctness. Third, we formalize data leakage risks in HE-based quadratic convex optimization (standard in ML) and apply THC-DL to construct a secure optimization scheme. Theoretical analysis confirms THC-DL’s resilience against input recovery attacks, even when adversaries exploit public model parameters. Experiments on a real-world platform validate DL-CSC’s efficiency and scalability while reducing the computational complexity and communication complexity from $\mathcal {O}(n)$ to $\mathcal {O}(1)$ where n denotes the length of the input bits.
27 October 2025 in IEEE Transactions on Mobile Computing
Federated learning (FL) enables multiple clients to exchange gradients to facilitate collaborative training in edge computing without transferring private data to the cloud server. However, the malicious server may disrupt the model training process by obtaining gradients to infer client information or faking validation results. Considering these threats, we construct a dynamic, secure, and verifiable FL scheme, named DSVFL. Specifically, we propose the fine-grained top-$k$ gradient selection algorithm to accelerate model convergence, which can improve model accuracy by up to 49.14%. Furthermore, we propose a single-cloud secure aggregation protocol that guarantees the server cannot access the real model parameters. We also design a trusted verification algorithm to validate the server’s aggregation results while resisting collusion between the server and clients. For federation dynamics, we adopt the Shamir’s secret sharing in both the aggregation and verification phases, which enables the correct aggregation and decryption of ciphertexts and the independent verification of client signatures, even in cases of client dropouts. Rigorous theoretical analysis demonstrates that DSVFL can protect data privacy and ensure correct training results. Experimental results indicate that DSVFL can reduce clients’ computational cost by 48%–63% and communication overhead by 33%–49% compared with existing solutions.
30 May 2026 in Information Processing & Management
1 January 2026 in IEEE Transactions on Information Forensics and Security