Gao Liu
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
Gao Liu has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Yining Liu
Wenzhou University of Technology
6 shared publications - Ning Wang
Chongqing University
5 shared publications - Hao Li
College of Computer Science, Chongqing University, Chongqing, China
4 shared publications - Tao Xiang
Chongqing University, Chongqing, China
4 shared publications - Junqing Le
College of Computer Science, Chongqing University, Chongqing, P. R. China
3 shared publications - Jingxue Chen
College of Cryptology and Cyber Science, Nankai University, Tianjin, China
2 shared publications
Latest Publications
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (18) , 42080-42092
Energy Depletion Attack for LoRa-Based Wireless Sensor Network
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (18) , 42080-42092
Energy Depletion Attack for LoRa-Based Wireless Sensor Network
- 2 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (2) , 1729-1743
Fully Anonymous Broadcast Signcryption for Secure Health Data Transmission in WBANs
To support comprehensive and personalized healthcare delivery, sensitive personal health data must often be transmitted from wearable devices to multiple designated specialists via wireless body area networks. Although existing identity-based broadcast signcryption schemes provide secure one-to-many transmission, they typically fail to preserve recipient anonymity. In particular, each recipient is usually required to know the identities of all other recipients to unsigncrypt the message, which undermines privacy and enables inference attacks, especially problematic in telemedicine applications. In this paper, we propose a novel broadcast signcryption scheme that simultaneously achieves recipient anonymity, sender anonymity, and resilience to physical attacks, which are not realized in prior work. Our key innovation lies in an anonymity-preserving unsigncryption mechanism based on inner product, which enables each recipient to independently verify and decrypt the broadcast message without knowledge of others’ identities. In addition, we incorporate a physical unclonable function with a fuzzy extractor to resist physical attacks in the presence of noise. Furthermore, a comprehensive security analysis demonstrates that our scheme satisfies essential security properties, including authentication, integrity, confidentiality, and full anonymity. It is resilient against common attacks such as impersonation, modification, replay, and man-in-the-middle attacks. Finally, performance evaluations confirm the practical feasibility of our scheme.
- 2 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (2) , 1729-1743
Fully Anonymous Broadcast Signcryption for Secure Health Data Transmission in WBANs
To support comprehensive and personalized healthcare delivery, sensitive personal health data must often be transmitted from wearable devices to multiple designated specialists via wireless body area networks. Although existing identity-based broadcast signcryption schemes provide secure one-to-many transmission, they typically fail to preserve recipient anonymity. In particular, each recipient is usually required to know the identities of all other recipients to unsigncrypt the message, which undermines privacy and enables inference attacks, especially problematic in telemedicine applications. In this paper, we propose a novel broadcast signcryption scheme that simultaneously achieves recipient anonymity, sender anonymity, and resilience to physical attacks, which are not realized in prior work. Our key innovation lies in an anonymity-preserving unsigncryption mechanism based on inner product, which enables each recipient to independently verify and decrypt the broadcast message without knowledge of others’ identities. In addition, we incorporate a physical unclonable function with a fuzzy extractor to resist physical attacks in the presence of noise. Furthermore, a comprehensive security analysis demonstrates that our scheme satisfies essential security properties, including authentication, integrity, confidentiality, and full anonymity. It is resilient against common attacks such as impersonation, modification, replay, and man-in-the-middle attacks. Finally, performance evaluations confirm the practical feasibility of our scheme.
- 7 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26 (6) , 8109-8124
LWAKA: Lightweight Anonymous Authenticated Key Agreement for VANETs
Authenticated key agreement (AKA) between vehicles and road side units (RSUs) is crucial in vehicular ad-hoc networks (VANETs). However, existing solutions still suffer from high overheads of AKA and lack a mechanism to balance privacy strength and system efficiency. In this paper, we present a lightweight anonymous authenticated key agreement (LWAKA) scheme for VANETs, supporting lightweight anonymous authentication and key agreement between vehicles and RSUs simultaneously. In particular, vehicles’ authentication information is synchronized to target RSUs in advance for accelerating authentication, and lightweight cryptographic operations (i.e., hash function, hash-based message authentication, physical unclonable function, fuzzy extractor and symmetric encryption) are employed to ensure the high efficiency of AKA in terms of computation and communication overheads. The system efficiency and privacy are balanced through modeling the relationship between the frequency of pseudonym updates and the unlinkability of the vehicles’ new and old pseudonyms. Security analysis shows that LWAKA not only achieves anonymity, conditional privacy, pseudonym unlinkability, key escrow freeness, and physical security, but also resists against most known attacks. Comparative experimental results demonstrate that LWAKA outperforms existing schemes in terms of lightweight design.
- 7 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26 (6) , 8109-8124
LWAKA: Lightweight Anonymous Authenticated Key Agreement for VANETs
Authenticated key agreement (AKA) between vehicles and road side units (RSUs) is crucial in vehicular ad-hoc networks (VANETs). However, existing solutions still suffer from high overheads of AKA and lack a mechanism to balance privacy strength and system efficiency. In this paper, we present a lightweight anonymous authenticated key agreement (LWAKA) scheme for VANETs, supporting lightweight anonymous authentication and key agreement between vehicles and RSUs simultaneously. In particular, vehicles’ authentication information is synchronized to target RSUs in advance for accelerating authentication, and lightweight cryptographic operations (i.e., hash function, hash-based message authentication, physical unclonable function, fuzzy extractor and symmetric encryption) are employed to ensure the high efficiency of AKA in terms of computation and communication overheads. The system efficiency and privacy are balanced through modeling the relationship between the frequency of pseudonym updates and the unlinkability of the vehicles’ new and old pseudonyms. Security analysis shows that LWAKA not only achieves anonymity, conditional privacy, pseudonym unlinkability, key escrow freeness, and physical security, but also resists against most known attacks. Comparative experimental results demonstrate that LWAKA outperforms existing schemes in terms of lightweight design.
- 24 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 22 (3) , 2806-2822
PECHA: Privacy-Preserving and Efficient Cross-Domain Handover Authentication for Heterogeneous Networks
The sixth-generation (6 G) mobile communication networks are perceived as large-scale heterogeneous networks. With their increased heterogenization and densification, it is crucial to guarantee the security and efficiency of user equipment's handovers between networks. However, existing cross-domain handover authentication schemes cannot ensure handover authentication efficiency and cannot balance privacy and system efficiency, which thus cannot be directly applied in heterogeneous networks. In this paper, we present PECHA, a privacy-preserving and efficient cross-domain handover authentication scheme for heterogeneous networks, which enables anonymous authentication on user equipment (UE) through the collision property of chameleon hash functions. PECHA ensures authentication efficiency by employing the interplanetary file system and blockchain to synchronize UE's authentication information to target networks in advance. The privacy and system efficiency are balanced by modeling the unlinkability of UE's new and old chameleon hash values and determining the update frequency of UE chameleon hash value. PECHA also achieves correctness, mutual authentication and key agreement, anonymity, unlinkability, conditional privacy, forward/backward secrecy, robustness, known randomness secrecy, key escrow freeness and rapid response, and resists against spoofing attacks, replay attacks and man-in-the-middle attacks. Comprehensive performance analysis, evaluation and comparisons show that PECHA is efficient with respect to both computation and communication.
- 24 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 22 (3) , 2806-2822
PECHA: Privacy-Preserving and Efficient Cross-Domain Handover Authentication for Heterogeneous Networks
The sixth-generation (6 G) mobile communication networks are perceived as large-scale heterogeneous networks. With their increased heterogenization and densification, it is crucial to guarantee the security and efficiency of user equipment's handovers between networks. However, existing cross-domain handover authentication schemes cannot ensure handover authentication efficiency and cannot balance privacy and system efficiency, which thus cannot be directly applied in heterogeneous networks. In this paper, we present PECHA, a privacy-preserving and efficient cross-domain handover authentication scheme for heterogeneous networks, which enables anonymous authentication on user equipment (UE) through the collision property of chameleon hash functions. PECHA ensures authentication efficiency by employing the interplanetary file system and blockchain to synchronize UE's authentication information to target networks in advance. The privacy and system efficiency are balanced by modeling the unlinkability of UE's new and old chameleon hash values and determining the update frequency of UE chameleon hash value. PECHA also achieves correctness, mutual authentication and key agreement, anonymity, unlinkability, conditional privacy, forward/backward secrecy, robustness, known randomness secrecy, key escrow freeness and rapid response, and resists against spoofing attacks, replay attacks and man-in-the-middle attacks. Comprehensive performance analysis, evaluation and comparisons show that PECHA is efficient with respect to both computation and communication.
- 24 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (3) , 4698-4712
LRCPA: Lattice-Based Robust and Conditional Privacy-Preserving Authentication for VANETs
Quantum-resistant authentication becomes crucial for securing vehicular ad-hoc networks (VANETs). However, existing solutions fail to support pseudonym unlinkability, and lacks a mechanism to ensure public verification of tracing and avoid malicious accusations against innocent vehicles for ensuring tracing robustness. In this paper, we propose a lattice-based robust and conditional privacy-preserving authentication (LRCPA) scheme for VANETs, which enables anonymous authentication on vehicles and adopts the small integer solution problem to withstand quantum attacks. Specially, obfuscated expiration dates are set for vehicles' credentials and pseudonyms to guarantee the unlinkability of new and old pseudonyms. The public verification of tracing is ensured by adopting vehicles' commitments or signatures on their real identities and pseudonyms as the proof of tracing, and tracing robustness is provided by employing vehicles' credentials issued by a central authority as the proof of malicious accusations or framing behaviors by the corrupted authority during tracing. LRCPA not only achieves message authentication and integrity, non-repudiation, anonymity, conditional privacy, unlinkability, key escrow freedom, public verification of tracing, and tracing robustness, but also effectively withstands most known attacks. Comprehensive performance analysis and evaluation show the potential usability of LRCPA.
- 24 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (3) , 4698-4712
LRCPA: Lattice-Based Robust and Conditional Privacy-Preserving Authentication for VANETs
Quantum-resistant authentication becomes crucial for securing vehicular ad-hoc networks (VANETs). However, existing solutions fail to support pseudonym unlinkability, and lacks a mechanism to ensure public verification of tracing and avoid malicious accusations against innocent vehicles for ensuring tracing robustness. In this paper, we propose a lattice-based robust and conditional privacy-preserving authentication (LRCPA) scheme for VANETs, which enables anonymous authentication on vehicles and adopts the small integer solution problem to withstand quantum attacks. Specially, obfuscated expiration dates are set for vehicles' credentials and pseudonyms to guarantee the unlinkability of new and old pseudonyms. The public verification of tracing is ensured by adopting vehicles' commitments or signatures on their real identities and pseudonyms as the proof of tracing, and tracing robustness is provided by employing vehicles' credentials issued by a central authority as the proof of malicious accusations or framing behaviors by the corrupted authority during tracing. LRCPA not only achieves message authentication and integrity, non-repudiation, anonymity, conditional privacy, unlinkability, key escrow freedom, public verification of tracing, and tracing robustness, but also effectively withstands most known attacks. Comprehensive performance analysis and evaluation show the potential usability of LRCPA.
- 29 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 21 (5) , 4784-4800
DeGKM: Decentralized Group Key Management for Content Push in Integrated Networks
Group-based content push can be widely applied in integrated networks, where group key management is crucial for the push's security. Existing group key management methods mainly include symmetric group key agreement, broadcast encryption, asymmetric group key agreement, and attribute-based encryption. However, most of them do not consider user equipment (UE) identity privacy and unlinkability, cannot support flexibility and efficiency due to each UE maintaining group keys, and lack the trustworthiness of UE and group key management, which hinders the widespread adoption of group-based content push in trustless environments like integrated networks. In this paper, we investigate a novel decentralized group key management (DeGKM) scheme for group-based content push in integrated networks, where different operators manage pseudonyms and group keys across domains in a decentralized manner. In particular, our scheme adopts verifiable shuffling to establish a unified and trustworthy inter-domain pseudonym management approach that can preserve UE identity privacy and pseudonym unlinkability without relying on a trusted third party, and introduces a unified inter-domain group key management method based on Chinese remainder theorem and blockchain that significantly guarantees the flexibility, efficiency and trustworthiness. We formally prove the security of DeGKM and show its efficiency through simulations and comparisons with related works.
- 29 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 21 (5) , 4784-4800
DeGKM: Decentralized Group Key Management for Content Push in Integrated Networks
Group-based content push can be widely applied in integrated networks, where group key management is crucial for the push's security. Existing group key management methods mainly include symmetric group key agreement, broadcast encryption, asymmetric group key agreement, and attribute-based encryption. However, most of them do not consider user equipment (UE) identity privacy and unlinkability, cannot support flexibility and efficiency due to each UE maintaining group keys, and lack the trustworthiness of UE and group key management, which hinders the widespread adoption of group-based content push in trustless environments like integrated networks. In this paper, we investigate a novel decentralized group key management (DeGKM) scheme for group-based content push in integrated networks, where different operators manage pseudonyms and group keys across domains in a decentralized manner. In particular, our scheme adopts verifiable shuffling to establish a unified and trustworthy inter-domain pseudonym management approach that can preserve UE identity privacy and pseudonym unlinkability without relying on a trusted third party, and introduces a unified inter-domain group key management method based on Chinese remainder theorem and blockchain that significantly guarantees the flexibility, efficiency and trustworthiness. We formally prove the security of DeGKM and show its efficiency through simulations and comparisons with related works.
- 17 February 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computing
- Vol. 9 (4) , 2170-2174
Lightweight Privacy-Preserving Raw Data Publishing Scheme
Data publishing or data sharing is an important part of analyzing network environments and improving the Quality of Service (QoS) in the Internet of Things (IoT). In order to incentives data providers (i.e., IoT end-users) to contribute their data, privacy requirement is necessary when data is collected and published. In traditional privacy preservation techniques, such as k-anonymity, data aggregation and differential privacy, data is modified, aggregated, or added noise, the utility of the published data are reduced. Privacy-preserving raw data publishing is a more valuable solution, and n-source anonymity based raw data collection is most promising by delinking raw data and their sources. In this paper, a lightweight raw data collection scheme for publishing is proposed, in which the rawness and the unlinkability of published data are all really guaranteed with Shamir's secret sharing, and shuffling algorithm. Moreover, it is lightweight and practical for the IoT environment by the performance evaluation.
- 17 February 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computing
- Vol. 9 (4) , 2170-2174
Lightweight Privacy-Preserving Raw Data Publishing Scheme
Data publishing or data sharing is an important part of analyzing network environments and improving the Quality of Service (QoS) in the Internet of Things (IoT). In order to incentives data providers (i.e., IoT end-users) to contribute their data, privacy requirement is necessary when data is collected and published. In traditional privacy preservation techniques, such as k-anonymity, data aggregation and differential privacy, data is modified, aggregated, or added noise, the utility of the published data are reduced. Privacy-preserving raw data publishing is a more valuable solution, and n-source anonymity based raw data collection is most promising by delinking raw data and their sources. In this paper, a lightweight raw data collection scheme for publishing is proposed, in which the rawness and the unlinkability of published data are all really guaranteed with Shamir's secret sharing, and shuffling algorithm. Moreover, it is lightweight and practical for the IoT environment by the performance evaluation.