Chenhao Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Chenhao Wang has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Yang Ming
School of Information Engineering, Changan University, Xian, China
23 shared publications - Hang Liu
School of Information Engineering, Changan University, Xian, China
21 shared publications - Yi Zhao
School of Information Engineering, Changan University, Xian, China
10 shared publications - Jie Feng
Xidian University
5 shared publications Yutong Deng
Chang’an University
5 shared publications- Rongxing Lu
Faculty of Computer Science, University of New Brunswick, Fredericton, NB, Canada
4 shared publications
Latest Publications
- 27 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. PP (15455971) , 1-18
PVCA: Privacy-Preserving and Verifiable Cross-System Authorization for Platoon Communications in VANETs
Vehicle platoon, an increasingly significant technology in vehicular ad hoc networks (VANETs), effectively reduces energy consumption and environmental pollution, mitigates traffic congestion, and enhances road capacity and traffic safety. Collaborative communication between platoons is available to promote the reliability of data dissemination, ameliorate driving strategies, and further strengthen traffic efficiency. Nevertheless, existing efforts for secure multi-platoon data dissemination still face the following issues: (i) lack of a direct authorization strategy for platoons working on different systems; (ii) no effective mechanism to protect vehicle privacy during platoon communications; (iii) absence of a practical verification approach for cross-system ciphertext transformation. This paper builds a privacy-preserving and verifiable cross-system authorization (PVCA) scheme to mitigate the above issues. Specifically, we first put forth the optimized anonymous identity-based broadcast encryption (IBBE) and policy-hiding attribute-based encryption (ABE) protocols to adapt platoon communications while protecting identity and attribute privacy. After that, the authorized token bridging the proposed protocols is designed to enable ciphertexts of IBBE format to be transformed into new ciphertexts of ABE format, enabling flexible authorization. Furthermore, inspired by the Fujisaki-Okamoto transformation, we devise an efficient zero knowledge proof of knowledge protocol, making our PVCA achieve verifiability and fairness. Rigorous security proof and analysis demonstrate that our PVCA is not only secure against chosen plaintext attacks and collusion attacks, but also satisfies the necessary security requirements. We implement a prototype of PVCA (on a desktop computer and Raspberry Pi) and provide a simulation utilizing NS-2 to validate its feasibility for platoon communications in VANETs. The results indicate that, compared to the state-of-the-art ciphertext transformation solutions, PVCA reduces the running time for original ciphertext generation, transformation, and decryption by at least 91.57%, 49.87%, and 50%, respectively, while compressing the original ciphertext and authorization token sizes by over 78.07% and 15.20%.
- 27 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. PP (15455971) , 1-18
PVCA: Privacy-Preserving and Verifiable Cross-System Authorization for Platoon Communications in VANETs
Vehicle platoon, an increasingly significant technology in vehicular ad hoc networks (VANETs), effectively reduces energy consumption and environmental pollution, mitigates traffic congestion, and enhances road capacity and traffic safety. Collaborative communication between platoons is available to promote the reliability of data dissemination, ameliorate driving strategies, and further strengthen traffic efficiency. Nevertheless, existing efforts for secure multi-platoon data dissemination still face the following issues: (i) lack of a direct authorization strategy for platoons working on different systems; (ii) no effective mechanism to protect vehicle privacy during platoon communications; (iii) absence of a practical verification approach for cross-system ciphertext transformation. This paper builds a privacy-preserving and verifiable cross-system authorization (PVCA) scheme to mitigate the above issues. Specifically, we first put forth the optimized anonymous identity-based broadcast encryption (IBBE) and policy-hiding attribute-based encryption (ABE) protocols to adapt platoon communications while protecting identity and attribute privacy. After that, the authorized token bridging the proposed protocols is designed to enable ciphertexts of IBBE format to be transformed into new ciphertexts of ABE format, enabling flexible authorization. Furthermore, inspired by the Fujisaki-Okamoto transformation, we devise an efficient zero knowledge proof of knowledge protocol, making our PVCA achieve verifiability and fairness. Rigorous security proof and analysis demonstrate that our PVCA is not only secure against chosen plaintext attacks and collusion attacks, but also satisfies the necessary security requirements. We implement a prototype of PVCA (on a desktop computer and Raspberry Pi) and provide a simulation utilizing NS-2 to validate its feasibility for platoon communications in VANETs. The results indicate that, compared to the state-of-the-art ciphertext transformation solutions, PVCA reduces the running time for original ciphertext generation, transformation, and decryption by at least 91.57%, 49.87%, and 50%, respectively, while compressing the original ciphertext and authorization token sizes by over 78.07% and 15.20%.
- 23 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (10) , 21856-21870
Storage-Efficient Certificateless Public Auditing Scheme With Data Dynamics in the Cloud
As the sharp growth of cloud storage, a rising quantity of public auditing techniques are employed to check outsourced data integrity. However, existing public auditing schemes have issues with storage efficiency, security, and practicality. During the traditional auditing process, the cloud is required to store all data blocks and corresponding tags, resulting in poor storage space utilization. Besides, public auditing schemes that leverage the public key infrastructure (PKI) encounter certificate management challenges, and identity-based schemes inherently suffer from key escrow vulnerabilities. Furthermore, the demand for data dynamic operations cannot be well implemented in existing schemes. Therefore, this article proposes a storage-efficient certificateless public auditing (SECPA) scheme with data dynamics, which allows any authorized third-party auditor (TPA) to perform integrity checking such that outsourced data will not be tampered with. Meanwhile, an improved locally verifiable technology is designed to optimize the cloud storage resources. In addition, our scheme avoids the certificate management and key escrow problems while supporting the user to conduct data insertion, deletion, and modification. The security analysis demonstrates that SECPA fulfills unforgeability, auditing soundness, data privacy protection, and detectability. The experiment results indicate that our scheme exhibits appropriate performance.
- 23 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (10) , 21856-21870
Storage-Efficient Certificateless Public Auditing Scheme With Data Dynamics in the Cloud
As the sharp growth of cloud storage, a rising quantity of public auditing techniques are employed to check outsourced data integrity. However, existing public auditing schemes have issues with storage efficiency, security, and practicality. During the traditional auditing process, the cloud is required to store all data blocks and corresponding tags, resulting in poor storage space utilization. Besides, public auditing schemes that leverage the public key infrastructure (PKI) encounter certificate management challenges, and identity-based schemes inherently suffer from key escrow vulnerabilities. Furthermore, the demand for data dynamic operations cannot be well implemented in existing schemes. Therefore, this article proposes a storage-efficient certificateless public auditing (SECPA) scheme with data dynamics, which allows any authorized third-party auditor (TPA) to perform integrity checking such that outsourced data will not be tampered with. Meanwhile, an improved locally verifiable technology is designed to optimize the cloud storage resources. In addition, our scheme avoids the certificate management and key escrow problems while supporting the user to conduct data insertion, deletion, and modification. The security analysis demonstrates that SECPA fulfills unforgeability, auditing soundness, data privacy protection, and detectability. The experiment results indicate that our scheme exhibits appropriate performance.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 6864-6877
Blockchain-Aided Authenticated Key Agreement With Message-Dependent Traceability for WBANs
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 6864-6877
Blockchain-Aided Authenticated Key Agreement With Message-Dependent Traceability for WBANs
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (10) , 1-18
Traceable Fine-Grained Data Sharing with Dual Policy Control for VANETs
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (10) , 1-18
Traceable Fine-Grained Data Sharing with Dual Policy Control for VANETs
- 16 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (3) , 4870-4881
Communication-Efficient Conditional Privacy-Preserving Authentication Based on Ring Signature in VANETs
As a critical technology in the era of vehicle interconnection, vehicular ad hoc networks (VANETs) have significantly improved various aspects of transportation, such as traffic efficiency, driving safety, and traveling comfort. With the privacy and security problems in mind, conditional privacy-preserving authentication (CPPA) schemes are introduced. However, existing efforts still have some issues regarding practicality, efficiency, and security. To solve these challenges, this paper constructs a communication-efficient CPPA (CE-CPPA) scheme based on ring signature in VANETs. With the transformation of the signature format and employment of the non-interactive sum argument technique, a logarithmic-size signature is realized by CE-CPPA, improving the communication efficiency. Meanwhile, by devising the concise tag containing information about the event and real signer, CE-CPPA realizes traceability and linkability simultaneously. Furthermore, the certificate management and key escrow problems are eliminated combining with certificateless cryptography. Rigorous security analysis indicates that CE-CPPA not only achieves unforgeability and anonymity but also meets the necessary security requirements. Comprehensive performance evaluation indicates that our CE-CPPA is feasible and efficient enough for VANETs security-related applications.
- 16 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (3) , 4870-4881
Communication-Efficient Conditional Privacy-Preserving Authentication Based on Ring Signature in VANETs
As a critical technology in the era of vehicle interconnection, vehicular ad hoc networks (VANETs) have significantly improved various aspects of transportation, such as traffic efficiency, driving safety, and traveling comfort. With the privacy and security problems in mind, conditional privacy-preserving authentication (CPPA) schemes are introduced. However, existing efforts still have some issues regarding practicality, efficiency, and security. To solve these challenges, this paper constructs a communication-efficient CPPA (CE-CPPA) scheme based on ring signature in VANETs. With the transformation of the signature format and employment of the non-interactive sum argument technique, a logarithmic-size signature is realized by CE-CPPA, improving the communication efficiency. Meanwhile, by devising the concise tag containing information about the event and real signer, CE-CPPA realizes traceability and linkability simultaneously. Furthermore, the certificate management and key escrow problems are eliminated combining with certificateless cryptography. Rigorous security analysis indicates that CE-CPPA not only achieves unforgeability and anonymity but also meets the necessary security requirements. Comprehensive performance evaluation indicates that our CE-CPPA is feasible and efficient enough for VANETs security-related applications.
- 12 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 22 (6) , 5998-6011
Puncturable Registered ABE for Vehicular Social Networks: Enhancing Security and Practicality
As an emerging class of internet of vehicles, vehicular social networks (VSNs) provide passengers, drivers, and vehicles with extensive data sharing services to improve traffic congestion and road safety. However, the insecure transmissions of shared data may disclose sensitive information, such as private data, location, and driving route. Although attribute-based encryption (ABE) is a promising technology to enable secure data sharing, the existing ABE solutions applied to VSNs encounter three-fold deficiencies: (1) the shared data stored in vehicular cloud server would be leaked in the event of key compromise; (2) relying on one or more fully trusted entities to generate keys for vehicles through secure channels; (3) private information leakage and misbehavior of data user vehicles are neglected. Motivated by these challenges, this paper proposes a puncturable registered ABE scheme called PR-ABE for VSNs with enhanced security and practicality. To be specific, our PR-ABE achieves flexible access control and precise data deletion. The former ensures that only registered vehicles with authorized attributes can obtain the shared data. The latter prevents data disclosure when key compromise happens. Meanwhile, PR-ABE enables vehicles to generate keys independently and eliminates the need for any fully trusted authority. In addition, hidden policy and traceability are fulfilled in PR-ABE to protect private information and deal with malicious vehicles, respectively. Finally, the rigorous security proof and performance evaluation demonstrate that PR-ABE is a practical and efficient solution.
- 12 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 22 (6) , 5998-6011
Puncturable Registered ABE for Vehicular Social Networks: Enhancing Security and Practicality
As an emerging class of internet of vehicles, vehicular social networks (VSNs) provide passengers, drivers, and vehicles with extensive data sharing services to improve traffic congestion and road safety. However, the insecure transmissions of shared data may disclose sensitive information, such as private data, location, and driving route. Although attribute-based encryption (ABE) is a promising technology to enable secure data sharing, the existing ABE solutions applied to VSNs encounter three-fold deficiencies: (1) the shared data stored in vehicular cloud server would be leaked in the event of key compromise; (2) relying on one or more fully trusted entities to generate keys for vehicles through secure channels; (3) private information leakage and misbehavior of data user vehicles are neglected. Motivated by these challenges, this paper proposes a puncturable registered ABE scheme called PR-ABE for VSNs with enhanced security and practicality. To be specific, our PR-ABE achieves flexible access control and precise data deletion. The former ensures that only registered vehicles with authorized attributes can obtain the shared data. The latter prevents data disclosure when key compromise happens. Meanwhile, PR-ABE enables vehicles to generate keys independently and eliminates the need for any fully trusted authority. In addition, hidden policy and traceability are fulfilled in PR-ABE to protect private information and deal with malicious vehicles, respectively. Finally, the rigorous security proof and performance evaluation demonstrate that PR-ABE is a practical and efficient solution.
- 29 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (15) , 31986-31997
Registration-Based Bilateral Fine-Grained Access Control in Vehicular Social Networks
Vehicular social networks (VSNs), as an innovative mobile communication system, significantly enhance the driving experience and improve urban traffic management efficiency. To address the privacy issues that arise from the use of public channels in VSNs, fine-grained access control (AC) should be ensured. Nevertheless, existing schemes still face some practical challenges in the aspects of data source identification, key escrow, and dynamic vehicle management. Therefore, this article proposes a registration-based bilateral fine-grained AC scheme (RBF-AC) in VSNs. Specifically, RBF-AC allows service providers (SPs) to select target vehicles and offer tailored services, while allowing vehicles to identify the most suitable SPs based on their needs, and all of which are realized in a fine-grained level. Meanwhile, SPs and vehicles are capable of locally generating their own private and public keys without relying on any fully trusted authority. RBF-AC also keeps high flexibility and enables the vehicles to join, leave and update their attributes in a dynamic manner. Additionally, outsourced verification and decryption are provided to minimize the computation cost for vehicles. We present formal security proofs to validate the security of RFB-AC. The performance evaluation illustrates the practical applicability of RBF-AC in VSNs.
- 29 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (15) , 31986-31997
Registration-Based Bilateral Fine-Grained Access Control in Vehicular Social Networks
Vehicular social networks (VSNs), as an innovative mobile communication system, significantly enhance the driving experience and improve urban traffic management efficiency. To address the privacy issues that arise from the use of public channels in VSNs, fine-grained access control (AC) should be ensured. Nevertheless, existing schemes still face some practical challenges in the aspects of data source identification, key escrow, and dynamic vehicle management. Therefore, this article proposes a registration-based bilateral fine-grained AC scheme (RBF-AC) in VSNs. Specifically, RBF-AC allows service providers (SPs) to select target vehicles and offer tailored services, while allowing vehicles to identify the most suitable SPs based on their needs, and all of which are realized in a fine-grained level. Meanwhile, SPs and vehicles are capable of locally generating their own private and public keys without relying on any fully trusted authority. RBF-AC also keeps high flexibility and enables the vehicles to join, leave and update their attributes in a dynamic manner. Additionally, outsourced verification and decryption are provided to minimize the computation cost for vehicles. We present formal security proofs to validate the security of RFB-AC. The performance evaluation illustrates the practical applicability of RBF-AC in VSNs.