Wenhao Cheng

Wenhao Cheng

Auto-generated profile, based on publicly available information

Wenhao Cheng

Southeast University, Nanjing, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
12 March 2024 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
XFXia Feng
Xia Feng
WCWenhao Cheng
Wenhao Cheng
CCChunjie Cao
Chunjie Cao
Liangmin WangLiangmin Wang
Liangmin Wang
VSVictor Sheng
Victor Sheng
Federated learning (FL) is vulnerable to data poisoning attacks when an adversary attempts to upload poison gradients with the intent to corrupt the global model of FL. Various approaches have been proposed to counter these risks. However, it becomes challenging when one tries to preserve the privacy of FL participants and ensure robustness against data poisoning attacks. In this paper, we propose DPFLA, a novel scheme that can detect poisoning attacks without revealing the actual gradients of participants. DPFLA is a lossless aggregation scheme delicately designed for adopting masks to protect private data while extracting poisoned data features. Specifically, we first apply removable masks to the gradients outputted by each participant. Second, we aggregate the masked data and decompose them using Singular Value Decomposition (SVD) to extract specific features as well as achieve dimensionality reduction. Third, we leverage a clustering paradigm to detect poison gradients from the low dimension and eliminate them in the following training rounds. We conducted extensive experiments to demonstrate that DPFLA can detect poison gradients effectively. Additionally, the comparisons of case studies demonstrate that DPFLA outperforms the state-of-the-art methods.

9 December 2025 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
XFXia Feng
Xia Feng
HYHaowei Yang
Haowei Yang
WCWenhao Cheng
Wenhao Cheng
HZHuijuan Zhu
Huijuan Zhu
Zhiquan LiuZhiquan Liu
Zhiquan Liu
Liangmin WangLiangmin Wang
Liangmin Wang
Federated Learning (FL) has recently gained prominence in the context of Vehicular Ad-hoc Networks (VANETs) as a promising approach to enhancing autonomous driving capabilities. However, vehicles’ high mobility, real-time communication, and dynamic network topology lead to frequent disconnections during operation, which may slow down the convergence of FL or even lead to training failure. In this study, we propose a scalable aggregation scheme (SAPE) designed to improve computation efficiency and address vehicle dropouts. SAPE employs a lossless encoding algorithm with parallel technology for efficient aggregation of large vectors. Then, we leverage TJL (ACSAC ’22) to reconstruct gradients for dropout vehicles, using online vehicles to establish a $k$-regular graph. In a network with $N$ vehicles, SAPE achieves a secure aggregation overhead of $O(log^{2}(N))$, as opposed to $O(N^{2})$, tolerating a vehicle dropout rate of up to 33%. Furthermore, we conduct a theoretical security analysis of SAPE to prove its security under honest-but-curious (HBC) and malicious attack models. Extensive experiments show that SAPE outperforms existing baseline aggregation schemes by up to 1.4× speedups in aggregation time.

3 November 2026
Verified
Conference Paper
Open access
LPLingfeng Peng
Lingfeng Peng
XXXiaohui Xie
Xiaohui Xie
WCWenhao Cheng
Wenhao Cheng
YCYong Cui
Yong Cui

18 August 2025 in Computer Networks
Verified
Journal Article
Closed access
WCWenhao Cheng
Wenhao Cheng
XFXia Feng
Xia Feng
Liangmin WangLiangmin Wang
Liangmin Wang
ZXZhan Xie
Zhan Xie
LWLiang Wang
Liang Wang
STSiben Tian
Siben Tian