Jing Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jing Wang has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Libing Wu
Wuhan University
5 shared publications - Zhuangzhuang Zhang
Wuhan University
3 shared publications - Debiao He
Wuhan University
2 shared publications - Jiong Jin
Swinburne University of Technology
2 shared publications - Lijuan Huo
Wuhan University
2 shared publications - Yizhou Wang
Key Laboratory of Aerospace Information Security and Trusted Computing, Ministry of Education, School of Cyber Science and Engineering, Wuhan University, Wuhan, China
2 shared publications
Latest Publications
- 6 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. PP, 1-15
PrivGNN: Privacy-Preserving Graph Neural Network Inference Based on Collaborative Computing for Cyber-Physical-Social Systems
Graph neural networks (GNNs) are gaining significant attention for enabling “cognitive intelligence” by processing complex, non-Euclidean data, particularly in cyber-physical-social systems (CPSS). These systems rely on real-time decision-making to optimize interactions across physical, social, and digital environments. Collaborative learning further enhances GNNs by allowing distributed entities to learn together from shared data, improving scalability and intelligence. However, the intricate structure of graph data and the increasing use of GNNs raise serious privacy concerns, particularly when sensitive data from distributed artificial intelligence of things (AIoT) devices of CPSS is involved. Although several privacy-preserving GNN schemes have been proposed, they often incur prohibitive communication and computation costs. To address the challenges, we propose PrivGNN, an efficient and privacy-preserving system for GNN inference with the help of multiple cloud servers. This system leverages novel variants of secret sharing techniques to develop secure multiparty computing protocols that safeguard data privacy. Our security analysis and performance evaluations confirm that PrivGNN ensures robust security, high efficiency, and scalability in cloud-based inference services. Almost each subprotocol reduces protocol communication costs from 33% to 40% and computation times from 25% to 30% in the LAN without compromising security. Benchmarking on the Cora and Pubmed datasets shows that PrivGNN cuts overall communication expenses by at least 30%, highlighting its practical value for privacy-sensitive, large-scale applications in AIoT and CPSS.
- 6 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. PP, 1-15
PrivGNN: Privacy-Preserving Graph Neural Network Inference Based on Collaborative Computing for Cyber-Physical-Social Systems
Graph neural networks (GNNs) are gaining significant attention for enabling “cognitive intelligence” by processing complex, non-Euclidean data, particularly in cyber-physical-social systems (CPSS). These systems rely on real-time decision-making to optimize interactions across physical, social, and digital environments. Collaborative learning further enhances GNNs by allowing distributed entities to learn together from shared data, improving scalability and intelligence. However, the intricate structure of graph data and the increasing use of GNNs raise serious privacy concerns, particularly when sensitive data from distributed artificial intelligence of things (AIoT) devices of CPSS is involved. Although several privacy-preserving GNN schemes have been proposed, they often incur prohibitive communication and computation costs. To address the challenges, we propose PrivGNN, an efficient and privacy-preserving system for GNN inference with the help of multiple cloud servers. This system leverages novel variants of secret sharing techniques to develop secure multiparty computing protocols that safeguard data privacy. Our security analysis and performance evaluations confirm that PrivGNN ensures robust security, high efficiency, and scalability in cloud-based inference services. Almost each subprotocol reduces protocol communication costs from 33% to 40% and computation times from 25% to 30% in the LAN without compromising security. Benchmarking on the Cora and Pubmed datasets shows that PrivGNN cuts overall communication expenses by at least 30%, highlighting its practical value for privacy-sensitive, large-scale applications in AIoT and CPSS.
- 17 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. PP (15566013) , 1
Heterogeneous Privacy-Preserving Federated Learning for Edge Intelligence
Federated learning (FL) as a distributed machine learning paradigm can be applied to edge intelligence scenarios for collaborative machine learning model building. Unfortunately, existing privacy-preserving FL applied to this scenario still faces three challenges: data heterogeneity, model heterogeneity, and privacy heterogeneity. Despite numerous privacy-preserving FL techniques proposed, they still cannot effectively address these three challenges. To solve this problem, we propose HeteroFed, a heterogeneous privacy-preserving FL framework for edge intelligence. Our HeteroFed contains heterogeneous model construction, dynamic gradient clipping, adaptive noise addition, and deviation-aware model aggregation. Specifically, we first use the heterogeneous model construction mechanism to enable personalized model training for different smart devices. Then, we propose a dynamic gradient clipping mechanism to perform dynamically adjusted gradient clipping on models uploaded by smart devices to limit the magnitude of gradients. Finally, we propose an adaptive noise addition mechanism to customize differential privacy protection for smart device models based on their convergence status. Furthermore, to mitigate the influence of noise perturbations on model performance, we propose a deviation-aware model aggregation mechanism for accurate model aggregation. Theoretical analysis demonstrates that HeteroFed achieves heterogeneous differential privacy. Extensive experiments show that HeteroFed outperforms similar methods, improving global model accuracy by 18%, 15%, 13%, and 18% on the MNIST, Fashion-MNIST, CIFAR-10, and THUCNews datasets, respectively.
- 17 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. PP (15566013) , 1
Heterogeneous Privacy-Preserving Federated Learning for Edge Intelligence
Federated learning (FL) as a distributed machine learning paradigm can be applied to edge intelligence scenarios for collaborative machine learning model building. Unfortunately, existing privacy-preserving FL applied to this scenario still faces three challenges: data heterogeneity, model heterogeneity, and privacy heterogeneity. Despite numerous privacy-preserving FL techniques proposed, they still cannot effectively address these three challenges. To solve this problem, we propose HeteroFed, a heterogeneous privacy-preserving FL framework for edge intelligence. Our HeteroFed contains heterogeneous model construction, dynamic gradient clipping, adaptive noise addition, and deviation-aware model aggregation. Specifically, we first use the heterogeneous model construction mechanism to enable personalized model training for different smart devices. Then, we propose a dynamic gradient clipping mechanism to perform dynamically adjusted gradient clipping on models uploaded by smart devices to limit the magnitude of gradients. Finally, we propose an adaptive noise addition mechanism to customize differential privacy protection for smart device models based on their convergence status. Furthermore, to mitigate the influence of noise perturbations on model performance, we propose a deviation-aware model aggregation mechanism for accurate model aggregation. Theoretical analysis demonstrates that HeteroFed achieves heterogeneous differential privacy. Extensive experiments show that HeteroFed outperforms similar methods, improving global model accuracy by 18%, 15%, 13%, and 18% on the MNIST, Fashion-MNIST, CIFAR-10, and THUCNews datasets, respectively.
- 13 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 72 (2) , 3905-3917
Transferable Adversarial Attacks on 3-D Point Cloud Semantic Segmentation via Diffusion Models in Autonomous Driving
With the rapid advancement of LiDAR-based 3D semantic segmentation, it has provided effective support for comprehensive perception in autonomous driving. However, the vulnerabilities of existing segmentation models have not been fully explored, posing potential risks to the security of autonomous systems. Existing adversarial attacks on point cloud segmentation primarily focus on applying global perturbations to point coordinates, inevitably introducing noticeable outliers and resulting in suboptimal attack performance. Inspired by the remarkable performance of diffusion models in LiDAR scene completion tasks, we propose a novel adversarial attack framework using diffusion models targeting 3D semantic segmentation. First, we model forward and reverse diffusion processes for input point cloud scenes, then introduce targeted perturbations during the reverse diffusion sampling stage. Specifically, we initialize Gaussian noise and add it to partial input point clouds, followed by stepwise denoising for point cloud reconstruction. During each denoising step, we identify the most discrimination-sensitive critical points and apply adversarial gradients exclusively to these selected points for guiding updates. Furthermore, we design a triple-loss function to supervise adversarial point cloud generation, achieving a balance between attack performance and perturbation magnitude. Finally, we conduct comprehensive experiments on two autonomous driving datasets, SemanticKITTI and nuScenes. The experimental results indicate that our method delivers significant attack performance against six mainstream semantic segmentation models, with average relative mIoU drops reaching 61.14% and 51.55% respectively. Moreover, the proposed method successfully transfers to point cloud classification and part segmentation tasks, demonstrating superior attack performance and transferability.
- 13 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 72 (2) , 3905-3917
Transferable Adversarial Attacks on 3-D Point Cloud Semantic Segmentation via Diffusion Models in Autonomous Driving
With the rapid advancement of LiDAR-based 3D semantic segmentation, it has provided effective support for comprehensive perception in autonomous driving. However, the vulnerabilities of existing segmentation models have not been fully explored, posing potential risks to the security of autonomous systems. Existing adversarial attacks on point cloud segmentation primarily focus on applying global perturbations to point coordinates, inevitably introducing noticeable outliers and resulting in suboptimal attack performance. Inspired by the remarkable performance of diffusion models in LiDAR scene completion tasks, we propose a novel adversarial attack framework using diffusion models targeting 3D semantic segmentation. First, we model forward and reverse diffusion processes for input point cloud scenes, then introduce targeted perturbations during the reverse diffusion sampling stage. Specifically, we initialize Gaussian noise and add it to partial input point clouds, followed by stepwise denoising for point cloud reconstruction. During each denoising step, we identify the most discrimination-sensitive critical points and apply adversarial gradients exclusively to these selected points for guiding updates. Furthermore, we design a triple-loss function to supervise adversarial point cloud generation, achieving a balance between attack performance and perturbation magnitude. Finally, we conduct comprehensive experiments on two autonomous driving datasets, SemanticKITTI and nuScenes. The experimental results indicate that our method delivers significant attack performance against six mainstream semantic segmentation models, with average relative mIoU drops reaching 61.14% and 51.55% respectively. Moreover, the proposed method successfully transfers to point cloud classification and part segmentation tasks, demonstrating superior attack performance and transferability.
- 3 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. PP (00189545) , 1-15
LDSAV: Lightweight and Dynamically Scalable Authentication Key Agreement for Vehicle-Cloud Collaboration
With the growth of intelligent transportation systems (ITS), vehicles increasingly rely on multiple Cloud Service Providers (CSPs) for enhanced services. However, the openness and dynamics of vehicle–cloud communication pose greater security and privacy risks than those in traditional Internet of Things (IoT) systems. Existing authentication and key agreement (AKA) protocols face limitations such as centralized trust, single points of failure, and limited support for dynamic collaboration among CSPs. To address these issues, we propose LDSAV, a lightweight and dynamically scalable authentication and key agreement protocol for vehicle–cloud collaboration. LDSAV employs a hierarchical trust architecture consisting of a Trusted Authority (TA) and multiple Auxiliary Trusted Authorities (ATAs), each holding a distinct subkey to enhance key isolation and fault tolerance. By combining polynomial-based key distribution and pseudorandom functions, LDSAV enables efficient CSP joining and leaving operations without relying on the continuous involvement of a trusted third party. Experimental evaluation shows up to 67.6% lower communication overhead compared to representative protocols. Formal analysis under the ROR model proves resistance to major known attacks including man-in-the-middle and replay attacks, ensuring security while maintaining lightweight performance.
- 3 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. PP (00189545) , 1-15
LDSAV: Lightweight and Dynamically Scalable Authentication Key Agreement for Vehicle-Cloud Collaboration
With the growth of intelligent transportation systems (ITS), vehicles increasingly rely on multiple Cloud Service Providers (CSPs) for enhanced services. However, the openness and dynamics of vehicle–cloud communication pose greater security and privacy risks than those in traditional Internet of Things (IoT) systems. Existing authentication and key agreement (AKA) protocols face limitations such as centralized trust, single points of failure, and limited support for dynamic collaboration among CSPs. To address these issues, we propose LDSAV, a lightweight and dynamically scalable authentication and key agreement protocol for vehicle–cloud collaboration. LDSAV employs a hierarchical trust architecture consisting of a Trusted Authority (TA) and multiple Auxiliary Trusted Authorities (ATAs), each holding a distinct subkey to enhance key isolation and fault tolerance. By combining polynomial-based key distribution and pseudorandom functions, LDSAV enables efficient CSP joining and leaving operations without relying on the continuous involvement of a trusted third party. Experimental evaluation shows up to 67.6% lower communication overhead compared to representative protocols. Formal analysis under the ROR model proves resistance to major known attacks including man-in-the-middle and replay attacks, ensuring security while maintaining lightweight performance.
- 31 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 5752-5767
DVA-ACLF: Designated Verifier Asymmetric Anonymous Credential Scheme for Low-Altitude Flight
Low-altitude aerial networks play an increasingly critical role in urban logistics, emergency response, and intelligent airspace management. These networks must ensure reliable identity authentication while addressing privacy, efficiency, and security challenges. Traditional authentication mechanisms—such as PKI-based certificates and remote identification—either overexpose identity data or lack support for flexible attribute disclosure. Moreover, existing anonymous credential (AC) schemes, though offering privacy, often incur high computational and communication costs and exist vulnerable to replay attacks. To address these limitations, we propose DVA-ACLF (Designated Verifier Asymmetric Anonymous Credential Scheme for Low-Altitude Flight), a lightweight credential system tailored for UAVs. DVA-ACLF leverages an efficient MAC-based construction combined with non-interactive zero-knowledge proofs to enable selective attribute disclosure without relying on pairings. It supports designated verification to prevent credential misuse and replay. Experimental results show that DVA-ACLF reduces credential size by 49% (2720 bits vs. 5369 bits in Idemix) and mitigates the linear growth of credential size with respect to attribute count observed in CL and BBS+ schemes. It requires only four single-base and $2(k-l)$ double-base exponentiations on UAVs, where $k$ is the number of selected attributes and $l$ is the number of disclosed attributes—both typically small. These features make DVA-ACLF a strong candidate for secure, efficient, and privacy-preserving authentication in low-altitude flight applications.
- 31 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 5752-5767
DVA-ACLF: Designated Verifier Asymmetric Anonymous Credential Scheme for Low-Altitude Flight
Low-altitude aerial networks play an increasingly critical role in urban logistics, emergency response, and intelligent airspace management. These networks must ensure reliable identity authentication while addressing privacy, efficiency, and security challenges. Traditional authentication mechanisms—such as PKI-based certificates and remote identification—either overexpose identity data or lack support for flexible attribute disclosure. Moreover, existing anonymous credential (AC) schemes, though offering privacy, often incur high computational and communication costs and exist vulnerable to replay attacks. To address these limitations, we propose DVA-ACLF (Designated Verifier Asymmetric Anonymous Credential Scheme for Low-Altitude Flight), a lightweight credential system tailored for UAVs. DVA-ACLF leverages an efficient MAC-based construction combined with non-interactive zero-knowledge proofs to enable selective attribute disclosure without relying on pairings. It supports designated verification to prevent credential misuse and replay. Experimental results show that DVA-ACLF reduces credential size by 49% (2720 bits vs. 5369 bits in Idemix) and mitigates the linear growth of credential size with respect to attribute count observed in CL and BBS+ schemes. It requires only four single-base and $2(k-l)$ double-base exponentiations on UAVs, where $k$ is the number of selected attributes and $l$ is the number of disclosed attributes—both typically small. These features make DVA-ACLF a strong candidate for secure, efficient, and privacy-preserving authentication in low-altitude flight applications.
- 21 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (5) , 6292-6305
PV-STR: An Efficient Pseudonym Verification Scheme With Spatial-Temporal Revocation in IoVs
Pseudonym certificates play a crucial role in providing authorized access in vehicular networks with fine-grained privacy demands. However, the revocation of pseudonym certificates in large-scale, resource-constrained context has posed a significant challenge. The global revocation status is susceptible to disruption by localized anomalous events. Moreover, as the scale of revocation grows, the synchronization process becomes increasingly vulnerable to attacks and incurs high overhead. To decouple the global revocation status from local revocation events, we propose a spatial-temporal pseudonym revocation and verification framework that supports batch pseudonym revocation within resilient revocation cycles. Revoked pseudonyms within the event area are locally filtered, while other pseudonyms are characterized by maintaining a proof to attest their consistent and legitimate status. To improve the efficiency of revocation status updates and mitigate centralization risks, a distributed caching and proof update strategy assisted by edge nodes is presented. Extensive simulations based on real-world large-scale datasets demonstrate that PV-STR scheme significantly reduces the vulnerability window, communication overhead, and memory consumption compared to state-of-the-art approaches.
- 21 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (5) , 6292-6305
PV-STR: An Efficient Pseudonym Verification Scheme With Spatial-Temporal Revocation in IoVs
Pseudonym certificates play a crucial role in providing authorized access in vehicular networks with fine-grained privacy demands. However, the revocation of pseudonym certificates in large-scale, resource-constrained context has posed a significant challenge. The global revocation status is susceptible to disruption by localized anomalous events. Moreover, as the scale of revocation grows, the synchronization process becomes increasingly vulnerable to attacks and incurs high overhead. To decouple the global revocation status from local revocation events, we propose a spatial-temporal pseudonym revocation and verification framework that supports batch pseudonym revocation within resilient revocation cycles. Revoked pseudonyms within the event area are locally filtered, while other pseudonyms are characterized by maintaining a proof to attest their consistent and legitimate status. To improve the efficiency of revocation status updates and mitigate centralization risks, a distributed caching and proof update strategy assisted by edge nodes is presented. Extensive simulations based on real-world large-scale datasets demonstrate that PV-STR scheme significantly reduces the vulnerability window, communication overhead, and memory consumption compared to state-of-the-art approaches.