Jie Zhang

Mr. Jie Zhang


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 August 2025 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
YHYuanyuan He
Yuanyuan He
JZJie Zhang
Jie Zhang
PYPeng Yang
Peng Yang
Zhe SunZhe Sun
Zhe Sun
XSXuemin Shen
Xuemin Shen
Edge-assisted Hierarchical Federated Learning (EHFL) accelerates global model training across mobile devices by hierarchically aggregating models. However, EHFL encounters critical challenges such as privacy risks for local and edge-level models, vulnerability to collusive Byzantine attacks, and issues with model diversity and heterogeneity due to Non-Independent and Identically Distributed (Non-IID) data. In this paper, we propose PPBR, a novel hybrid scheme that subtly integrates Condensed Local Differential Privacy (CLDP) and Packed Linearly Homomorphic Encryption (PLHE) to achieve strong privacy protection and resilience against various Byzantine attacks in Non-IID data scenarios. Specifically, PPBR clusters the sign statistics of local models and clips the norms of edge-level momenta to filter anomalous models and mitigate Byzantine faults while retaining diverse models coming from Non-IID data. To enhance privacy protection with acceptable accuracy loss, the sign tuples of local models are perturbed with CLDP guarantees, and the momenta of edge-level models are encrypted under PLHE. Meanwhile, PPBR enhances privacy in single-edge-server and single-cloud-server aggregations by using random perturbations, secret sharing, and PLHE. In addition to safeguarding privacy with accommodating abrupt dropouts of mobile devices and edge servers, the aggregations effectively mitigate the adverse effects of Non-IID data under advanced Byzantine attacks. Theoretical analysis and comprehensive experiments validate PPBR’s strong privacy guarantees and resilience to various Byzantine attacks under Non-IID data.

18 December 2023 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
YHYuanyuan He
Yuanyuan He
PLPeizhi Li
Peizhi Li
Jianbing NiJianbing Ni
Jianbing Ni
Xianjun DengXianjun Deng
Xianjun Deng
HLHongwei Lu
Hongwei Lu
Laurence YangLaurence Yang
Laurence Yang
In Internet-of-Vehicles (IoVs), Federated Learning (FL) is increasingly used by smart vehicles to process various sensing data. FL is a collaborative learning approach that enables vehicles to train a shared machine learning (ML) model by exchanging their local models instead of their sensitive training data in a distributed manner. Secure aggregation, as a privacy primitive for FL, aims to further protect the local models.c However, existing secure aggregation methods for FL in IoVs mostly suffer from poor security against Byzantine attacks, e.g., malicious vehicles submit fake local models, which are common in IoVs and greatly degrade the accuracy of the final shared model without being detected. In this paper, we propose a new secure and efficient aggregation approach, RSAM, for resisting Byzantine attacks FL in IoVs. RSAM first securely calculates an approximate median of local models of the distributed vehicles via the divide-and-conquer strategy as the aggregation model in each training round, providing the strong Byzantine robustness that is similar to the real median (a proven robust rank-based statistic) does, where median means the coordinate-wise median. Furthermore, RSAM is a single-server secure aggregation protocol that protects the vehicles' local models and training data against inside conspiracy attacks based on zero-sharing. Finally, RSAM is efficient for vehicles in IoVs, since RSAM transforms the sorting operation over the encrypted data to a small number of comparison operations over plain texts and vector-addition operations over ciphertexts, and the main building block relies on fast symmetric-key primitives. The correctness, Byzantine resilience, and privacy protection of RSAM are analyzed, and extensive experiments demonstrate its effectiveness.

28 January 2026 in IEEE Transactions on Cognitive Communications and Networking
Verified
Journal Article
Closed access
JZJie Zhang
Jie Zhang
YHYuanyuan He
Yuanyuan He
Xianjun DengXianjun Deng
Xianjun Deng
XYXinwei Yu
Xinwei Yu
SLShenghao Liu
Shenghao Liu
EWEn Wang
En Wang
Driven by the low-altitude economy, heterogeneous aerial vehicles (e.g., AAVs, piloted aircraft, eVTOLs) are expected to collaboratively support Artificial General Intelligence (AGI) models. Their data are Non-Independent and Identically Distributed (Non-IID), privacy-sensitive, and vulnerable to Byzantine attacks. Existingriven by the low-altitude economy, heterogeneous aerial vehicles (e.g., AAVs, piloted aircraft, eVTOLs) are expected to collaboratively support Artificial General Intelligence (AGI) models. Their data are Non-Independent and Identically Distributed (Non-IID), privacy-sensitive, and vulnerable to Byzantine attacks. ExistingD Federated Learning (FL) schemes still struggle to efficiently mitigate both privacy leakage and Byzantine threats in low-altitude networks characterized by mobility and data heterogeneity. We propose SuperFL, a secure FL framework that bridges Local Differential Privacy (LDP) and Byzantine resilience for Non-IID low-altitude networks. In each round, every device (i.e., client) splits the model into small segments and compresses them to perform parallel aggregations. The compressed sensing drastically reduces the number of parameters subjected to LDP perturbation, cutting the volume of noise while preserving geometry. Additionally, each client adaptively tunes LDP noise on the compressed segments to optimize aggregation accuracy while ensuring privacy, and shuffles those noisy segments to curb privacy-budget inflation from repeated rounds. Owing to approximate invariance of cosine similarity and norms under compression, the server can effectively identify and filter Byzantine clients in Non-IID data settings via executing the cosine-similarity-based robust aggregation rules on locally perturbed and aggregated model segments under compression without significant accuracy losses. The privacy and correctness of SuperFL are theoretically analyzed. Experimental results confirm its effectiveness and efficiency in low-altitude networks.

28 February 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
ZSZhe Sun
Zhe Sun
WLWeiping Li
Weiping Li
JLJunxi Liang
Junxi Liang
LYLihua Yin
Lihua Yin
CLChao Li
Chao Li
HWHanyi Wang
Hanyi Wang
The advent of the big data era has brought unprecedented data demands. The integration of computing resources with network resources in the computing force network enables the possibility of distributed collaborative training. However, unencrypted collaborative training is vulnerable to threats such as gradient inversion attacks and model theft. To address this issue, the data in collaborative training are usually protected by cryptographic methods. However, the semantic meaninglessness of encrypted data makes it difficult to prevent potential data poisoning attacks and free-riding attacks. In this paper, we propose a fairness guarantee approach for privacy-preserving collaborative training, employing blockchain technology to enable participants to share data and exclude potential violators from normal users. We utilize a cryptography-based secure aggregation method to prevent data leakage during blockchain transactions, and employ a contribution evaluation method for encrypted data to prevent data poisoning and free-riding attacks. Additionally, utilizing Shamir’s secret sharing for secret key negotiation within the group, the negotiated key is directly introduced as noise into the model, ensuring the encryption process is computationally lightweight. Decryption is efficiently achieved through the aggregation of encrypted models within the group, without incurring additional computational costs, thereby enhancing the computational efficiency of the encryption and decryption processes. Finally, the experimental results demonstrate the effectiveness and efficiency of our proposed approach.