Yi Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yi Zhao has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Chenhao Wang
School of Information Engineering, Changan University, Xian, China
10 shared publications - Yang Ming
School of Information Engineering, Changan University, Xian, China
10 shared publications - Hang Liu
School of Information Engineering, Changan University, Xian, China
9 shared publications - Bo Yang
School of Computer Science, Shaanxi Normal University, Xi’an 710119, China
2 shared publications - Songnian Zhang
State Key Laboratory of Integrated Services Networks, Xidian University, Xian, China
2 shared publications Bo Yang
1 shared publication
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%.
- 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
- 17 October 2025
- Published by Elsevier in Computer Standards & Interfaces
- Vol. 96
BcFCKA:Blockchain-based Fair and continuous key agreement for DIDComm in Self-Sovereign Identity
- 17 October 2025
- Published by Elsevier in Computer Standards & Interfaces
- Vol. 96
BcFCKA:Blockchain-based Fair and continuous key agreement for DIDComm in Self-Sovereign Identity
- 27 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 1237-1250
Security-Enhanced Data Transmission With Fine-Grained and Flexible Revocation for DTWNs
Benefitting from digital twin (DT) that utilizes a virtual model of the physical object (PO) to provide predictions and control decisions, the diverse properties of wireless networks are fulfilled. Nevertheless, the open wireless channels and key leakage of compromised entities (including DT and PO) lead to serious security issues, highlighting the need for secure data transmission schemes. Furthermore, it is infeasible to directly utilize the existing works and cryptographic primitives for DT-empowered wireless networks (DTWNs) because there lacks a solution to comprehensively capture the security requirements, and the critical characteristics for protecting historical data cannot be met. Therefore, this paper proposes a security-enhanced data transmission scheme with fine-grained and flexible revocation by customizing a novel cryptographic primitive named forward-secure puncturable signed encryption (FS-PSE). Our scheme is capable of enabling confidential data dissemination/acquisition between the physical and virtual space while ensuring authentication of the real-time information and feedback results. In addition, three revocation modes are defined, based on which the entities can flexibly revoke any one of the decryption-&-signature, decryption, and signature capability in a fine-grained approach, thereby providing security protections for the historically transmitted data even though the entity is compromised. Additionally, our scheme is instantiated with a concrete FS-PSE construction and extended to support outsourced computing for further improving the efficiency. Finally, the formal security proof and performance evaluation demonstrate the security and practicality of our scheme.
- 27 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 1237-1250
Security-Enhanced Data Transmission With Fine-Grained and Flexible Revocation for DTWNs
Benefitting from digital twin (DT) that utilizes a virtual model of the physical object (PO) to provide predictions and control decisions, the diverse properties of wireless networks are fulfilled. Nevertheless, the open wireless channels and key leakage of compromised entities (including DT and PO) lead to serious security issues, highlighting the need for secure data transmission schemes. Furthermore, it is infeasible to directly utilize the existing works and cryptographic primitives for DT-empowered wireless networks (DTWNs) because there lacks a solution to comprehensively capture the security requirements, and the critical characteristics for protecting historical data cannot be met. Therefore, this paper proposes a security-enhanced data transmission scheme with fine-grained and flexible revocation by customizing a novel cryptographic primitive named forward-secure puncturable signed encryption (FS-PSE). Our scheme is capable of enabling confidential data dissemination/acquisition between the physical and virtual space while ensuring authentication of the real-time information and feedback results. In addition, three revocation modes are defined, based on which the entities can flexibly revoke any one of the decryption-&-signature, decryption, and signature capability in a fine-grained approach, thereby providing security protections for the historically transmitted data even though the entity is compromised. Additionally, our scheme is instantiated with a concrete FS-PSE construction and extended to support outsourced computing for further improving the efficiency. Finally, the formal security proof and performance evaluation demonstrate the security and practicality of our scheme.
- 7 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 9582-9597
Flexible Selective Data Sharing With Fine-Grained Erasure in VANETs
Vehicular ad hoc networks (VANETs), an increasingly significant technology in intelligent transportation systems, achieve information sharing and intelligent traffic flow control and road condition prediction through data sharing between vehicles and other devices, enhancing traffic efficiency and driving safety. Nevertheless, there are still challenges to data sharing with respect to efficiency, flexibility, and security. In this paper, we build a flexible selective data sharing with fine-grained erasure (FSDS-FE) scheme in VANETs by introducing the novel cryptographic primitive called puncturable identity-based fine-grained proxy re-encryption and employing identity-based signature. In FSDS-FE, with the support for ciphertext transformation, the vehicles are able to flexibly share the outsourced traffic data with others. Different sharing content can be customized for various entities through fine-grained re-encryption to protect sensitive information. Furthermore, the outsourced traffic data could be erased in a fine-grained way by the vehicles. In order to optimize the efficiency and practicality of FSDS-FE, we construct an improved FSDS-FE scheme by designing a novel puncturable identity-based fine-grained broadcast proxy re-encryption with verifiable outsourced decryption scheme. Rigorous security analysis demonstrates that FSDS-FE can achieve the desired security requirements. The comprehensive performance evaluation shows that our schemes are efficient and practical enough in VANETs.
- 7 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 9582-9597
Flexible Selective Data Sharing With Fine-Grained Erasure in VANETs
Vehicular ad hoc networks (VANETs), an increasingly significant technology in intelligent transportation systems, achieve information sharing and intelligent traffic flow control and road condition prediction through data sharing between vehicles and other devices, enhancing traffic efficiency and driving safety. Nevertheless, there are still challenges to data sharing with respect to efficiency, flexibility, and security. In this paper, we build a flexible selective data sharing with fine-grained erasure (FSDS-FE) scheme in VANETs by introducing the novel cryptographic primitive called puncturable identity-based fine-grained proxy re-encryption and employing identity-based signature. In FSDS-FE, with the support for ciphertext transformation, the vehicles are able to flexibly share the outsourced traffic data with others. Different sharing content can be customized for various entities through fine-grained re-encryption to protect sensitive information. Furthermore, the outsourced traffic data could be erased in a fine-grained way by the vehicles. In order to optimize the efficiency and practicality of FSDS-FE, we construct an improved FSDS-FE scheme by designing a novel puncturable identity-based fine-grained broadcast proxy re-encryption with verifiable outsourced decryption scheme. Rigorous security analysis demonstrates that FSDS-FE can achieve the desired security requirements. The comprehensive performance evaluation shows that our schemes are efficient and practical enough in VANETs.
- 30 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 17 (6) , 4281-4295
Server-Assisted Data Sharing System Supporting Conjunctive Keyword Search for Vehicular Social Networks
Vehicular social networks (VSNs), as the convergence of social networks and vehicular ad hoc networks, have brought many useful services to vehicle communication by collecting and sharing data between vehicles. In order to efficiently share data and satisfy the growing requirement of privacy protection, data owners typically encrypt and outsource the data to the cloud. Nevertheless, encryption undoubtedly reduces the availability of shared data, e.g., keyword search. Although a number of schemes supporting keyword search of shared data have been put forward, they still have issues with respect to security, functionality, and efficiency. In this paper, a server-assisted data sharing (SADS) system with support for conjunctive keyword search is presented. Specifically, to resist online keyword guessing attack, we devise an advanced keyword derivation mechanism to derive the keyword set, in which the conception of verifiable parallel oblivious unpredictable function is proposed to check whether the assisted server honestly responds to the derived keyword request. Moreover, the computation and communication costs of keyword trapdoor in SADS are constant. Concurrently, SADS achieves the anonymous data sharing and traceability of malicious vehicle data owner. The security of SADS is formally proved and analyzed. Performance evaluation also shows that our system is efficient and practical.
- 30 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 17 (6) , 4281-4295
Server-Assisted Data Sharing System Supporting Conjunctive Keyword Search for Vehicular Social Networks
Vehicular social networks (VSNs), as the convergence of social networks and vehicular ad hoc networks, have brought many useful services to vehicle communication by collecting and sharing data between vehicles. In order to efficiently share data and satisfy the growing requirement of privacy protection, data owners typically encrypt and outsource the data to the cloud. Nevertheless, encryption undoubtedly reduces the availability of shared data, e.g., keyword search. Although a number of schemes supporting keyword search of shared data have been put forward, they still have issues with respect to security, functionality, and efficiency. In this paper, a server-assisted data sharing (SADS) system with support for conjunctive keyword search is presented. Specifically, to resist online keyword guessing attack, we devise an advanced keyword derivation mechanism to derive the keyword set, in which the conception of verifiable parallel oblivious unpredictable function is proposed to check whether the assisted server honestly responds to the derived keyword request. Moreover, the computation and communication costs of keyword trapdoor in SADS are constant. Concurrently, SADS achieves the anonymous data sharing and traceability of malicious vehicle data owner. The security of SADS is formally proved and analyzed. Performance evaluation also shows that our system is efficient and practical.
- 8 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 21 (6) , 5308-5310
Comments on “Enabling Verifiable Privacy-Preserving Multi-Type Data Aggregation in Smart Grids”
Most recently, Zhang et al presented a verifiable data aggregation scheme for smart grids in IEEE Transactions on Dependable and Secure Computing (doi: 10.1109/TDSC.2021.3124546). The authors claim that the privacy of the user's electricity data is preserved, and the control center can check whether the aggregator honestly computes the aggregated ciphertext. However, we indicate that Zhang et al's scheme fails to provide the properties of data privacy and aggregate correctness guarantee. Specifically, by offering concrete attacks, we illustrate that the adversary who has the ability to obtain the decryption key of control center can decrypt any user's ciphertext to get the detailed electricity data, and a misbehaved aggregator will not be detected when it does have some malicious behavior.
- 8 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 21 (6) , 5308-5310
Comments on “Enabling Verifiable Privacy-Preserving Multi-Type Data Aggregation in Smart Grids”
Most recently, Zhang et al presented a verifiable data aggregation scheme for smart grids in IEEE Transactions on Dependable and Secure Computing (doi: 10.1109/TDSC.2021.3124546). The authors claim that the privacy of the user's electricity data is preserved, and the control center can check whether the aggregator honestly computes the aggregated ciphertext. However, we indicate that Zhang et al's scheme fails to provide the properties of data privacy and aggregate correctness guarantee. Specifically, by offering concrete attacks, we illustrate that the adversary who has the ability to obtain the decryption key of control center can decrypt any user's ciphertext to get the detailed electricity data, and a misbehaved aggregator will not be detected when it does have some malicious behavior.
- 26 February 2024
- Published by Springer Nature
- p. 320-339
Identity-Based Proxy Re-encryption Based on SM9
- 26 February 2024
- Published by Springer Nature
- p. 320-339
Identity-Based Proxy Re-encryption Based on SM9