Xiaodong Yang
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
Xiaodong Yang has a total of 85 co-authors. Here are the top co-authors by number of shared publications:
- Caifen Wang
College of Big Data and Internet, Shenzhen Technology University, Shenzhen, China
18 shared publications Caifen Wang
College of Big Data and Internet, Shenzhen Technology University, Shenzhen, China
12 shared publications- Meiding Wang
College of Computer Science and Engineering, Northwest Normal University, Lanzhou 730070, China
6 shared publications - Ting Li
College of Computer Science and Engineering, Northwest Normal University, Lanzhou 730070, China
6 shared publications Aijia Chen
Affiliation Department of Computer Science and Engineering, Northwest Normal University, Lanzhou, Gansu, China
5 shared publications- Songyu Li
College of Computer Science and Engineering, Northwest Normal University, Lanzhou, China
5 shared publications
Latest Publications
- 23 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 2478-2491
Decoupled and Privacy-Preserving Key Generation in ABE Under the Minimal Disclosure Principle
Attribute-Based Encryption (ABE) enables fine-grained access control over outsourced data, but its key generation process typically requires users to disclose their complete attribute sets, introducing significant privacy risks. Existing privacy-preserving approaches—such as those based on zero-knowledge proofs or tightly coupled interactive protocols—suffer from limited scalability, high communication costs, and insufficient support for selective attribute disclosure. To address these limitations, we propose a privacy-enhancing key generation protocol guided by the principle of Minimal Disclosure, which ensures that users disclose only the minimally necessary subset of attributes required for authorization. Our protocol decouples attribute verification from key issuance: users first obtain cryptographically verifiable attribute tokens, and later issue blinded key requests over selectively chosen attributes. This design enables selective disclosure, supports reusable attribute credentials, and enhances user autonomy. To improve scalability, we introduce a lightweight batch verification mechanism that reduces computation and communication overhead for the attribute authority. We prove that our protocol achieves the binding and hiding properties under standard cryptographic assumptions, and we formally verify these guarantees in the symbolic model using the ProVerif tool. In addition, we propose two privacy metrics—Attribute Inference Gain (AIG) and Privacy Gain (PG)—alongside an entropy-based analysis to quantify resistance against attribute inference attacks. Experimental results show that our scheme effectively mitigates inference leakage while offering substantial efficiency gains compared to existing schemes.
- 23 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 2478-2491
Decoupled and Privacy-Preserving Key Generation in ABE Under the Minimal Disclosure Principle
Attribute-Based Encryption (ABE) enables fine-grained access control over outsourced data, but its key generation process typically requires users to disclose their complete attribute sets, introducing significant privacy risks. Existing privacy-preserving approaches—such as those based on zero-knowledge proofs or tightly coupled interactive protocols—suffer from limited scalability, high communication costs, and insufficient support for selective attribute disclosure. To address these limitations, we propose a privacy-enhancing key generation protocol guided by the principle of Minimal Disclosure, which ensures that users disclose only the minimally necessary subset of attributes required for authorization. Our protocol decouples attribute verification from key issuance: users first obtain cryptographically verifiable attribute tokens, and later issue blinded key requests over selectively chosen attributes. This design enables selective disclosure, supports reusable attribute credentials, and enhances user autonomy. To improve scalability, we introduce a lightweight batch verification mechanism that reduces computation and communication overhead for the attribute authority. We prove that our protocol achieves the binding and hiding properties under standard cryptographic assumptions, and we formally verify these guarantees in the symbolic model using the ProVerif tool. In addition, we propose two privacy metrics—Attribute Inference Gain (AIG) and Privacy Gain (PG)—alongside an entropy-based analysis to quantify resistance against attribute inference attacks. Experimental results show that our scheme effectively mitigates inference leakage while offering substantial efficiency gains compared to existing schemes.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 26 (15) , 1
A Leakage-Resilient and Auditable Multi-Authority CP-ABE Scheme for Regulated IIOT Systems
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 26 (15) , 1
A Leakage-Resilient and Auditable Multi-Authority CP-ABE Scheme for Regulated IIOT Systems
- 16 July 2025
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 18 (5) , 1-13
Efficient and mutual heterogeneous signcryption schemes for VANETs
- 16 July 2025
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 18 (5) , 1-13
Efficient and mutual heterogeneous signcryption schemes for VANETs
- Open Access
- 27 September 2024
- Published by Springer Nature in Research Square
A Verifiable Privacy-Preserving Data Aggregation Scheme with Illegal Data Detection for Infectious Disease Surveillance Systems
With various infectious diseases spreading globally, Infectious Disease Surveillance (IDS) plays a crucial role in stopping the spread of infectious diseases. Data aggregation techniques are commonly used to avoid user privacy leakage caused by infectious disease surveillance data transmission. However, none of the currently proposed data aggregation schemes simultaneously consider security issues such as untrustworthy aggregation nodes, illegal signature localization and identity anonymization. To address the above issues, this scheme proposes verifiable data security communication scheme with illegal data detection for infectious disease surveillance systems (VDSCS-IDS). Specifically, we use homomorphic encryption and signature techniques with batch verification to ensure the confidentiality and integrity of data. Then, VDSCS-IDS utilizes a pseudonym mechanism to prevent user identity disclosure. In addition, we can efficiently perform illegal signature localization, which improves the robustness of secure message interactions. We use a commitment mechanism to solve the problem of untrustworthy third-party aggregation nodes. Particularly noteworthy is the scheme's ability to perform diverse data statistics. Security analysis shows that the scheme achieves the desired security performance. Detailed performance analysis proves that the scheme is feasible with excellent computational and communication performance and can be applied to IDS securely and efficiently.
- 27 September 2024
- Published by Springer Nature in Research Square
Open AccessA Verifiable Privacy-Preserving Data Aggregation Scheme with Illegal Data Detection for Infectious Disease Surveillance Systems
With various infectious diseases spreading globally, Infectious Disease Surveillance (IDS) plays a crucial role in stopping the spread of infectious diseases. Data aggregation techniques are commonly used to avoid user privacy leakage caused by infectious disease surveillance data transmission. However, none of the currently proposed data aggregation schemes simultaneously consider security issues such as untrustworthy aggregation nodes, illegal signature localization and identity anonymization. To address the above issues, this scheme proposes verifiable data security communication scheme with illegal data detection for infectious disease surveillance systems (VDSCS-IDS). Specifically, we use homomorphic encryption and signature techniques with batch verification to ensure the confidentiality and integrity of data. Then, VDSCS-IDS utilizes a pseudonym mechanism to prevent user identity disclosure. In addition, we can efficiently perform illegal signature localization, which improves the robustness of secure message interactions. We use a commitment mechanism to solve the problem of untrustworthy third-party aggregation nodes. Particularly noteworthy is the scheme's ability to perform diverse data statistics. Security analysis shows that the scheme achieves the desired security performance. Detailed performance analysis proves that the scheme is feasible with excellent computational and communication performance and can be applied to IDS securely and efficiently.
- 25 July 2024
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 17 (5) , 3459-3475
Proxy re-signature scheme with cryptographic reverse firewall for medical data security
- 25 July 2024
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 17 (5) , 3459-3475
Proxy re-signature scheme with cryptographic reverse firewall for medical data security
- 6 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (9) , 12256-12268
Efficient and Security-Enhanced Certificateless Aggregate Signature-Based Authentication Scheme With Conditional Privacy Preservation for VANETs
Vehicular ad-hoc networks (VANETs) are integral to the evolution of intelligent transportation systems, offering substantial benefits in managing traffic flow, issuing warnings for potential accidents, and delivering information services to drivers. To ensure the authenticity and integrity of data exchanged within VANETs, numerous authentication schemes based on certificateless aggregate signature (CLAS) have been developed. However, state-of-the-art solutions often fail to be applicable in real-world VANETs due to security weaknesses and operational inefficiencies. Recently, Zhu et al. proposed an efficient CLAS-based authentication scheme with conditional privacy preservation (CPP) for VANETs (IEEE Transactions on Intelligent Transportation Systems, DOI: 10.1109/TITS.2023.3275077). Unfortunately, our analysis reveals that Zhu et al.’s scheme is incapable of withstanding coalition attacks from malicious RSUs and vehicles as well as public-key replacement attacks from dishonest vehicles. To facilitate secure communication in VANETs, we present a security-enhanced, pairing-free and energy-efficient CLAS-based authentication scheme with CPP for VANETs. This scheme has been rigorously proven to be secure against Type I, Type II and Type III attackers. Distinguished from other comparable schemes, our construction significantly reduces communication overhead and energy consumption while simultaneously fortifying security.
- 6 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (9) , 12256-12268
Efficient and Security-Enhanced Certificateless Aggregate Signature-Based Authentication Scheme With Conditional Privacy Preservation for VANETs
Vehicular ad-hoc networks (VANETs) are integral to the evolution of intelligent transportation systems, offering substantial benefits in managing traffic flow, issuing warnings for potential accidents, and delivering information services to drivers. To ensure the authenticity and integrity of data exchanged within VANETs, numerous authentication schemes based on certificateless aggregate signature (CLAS) have been developed. However, state-of-the-art solutions often fail to be applicable in real-world VANETs due to security weaknesses and operational inefficiencies. Recently, Zhu et al. proposed an efficient CLAS-based authentication scheme with conditional privacy preservation (CPP) for VANETs (IEEE Transactions on Intelligent Transportation Systems, DOI: 10.1109/TITS.2023.3275077). Unfortunately, our analysis reveals that Zhu et al.’s scheme is incapable of withstanding coalition attacks from malicious RSUs and vehicles as well as public-key replacement attacks from dishonest vehicles. To facilitate secure communication in VANETs, we present a security-enhanced, pairing-free and energy-efficient CLAS-based authentication scheme with CPP for VANETs. This scheme has been rigorously proven to be secure against Type I, Type II and Type III attackers. Distinguished from other comparable schemes, our construction significantly reduces communication overhead and energy consumption while simultaneously fortifying security.
- 11 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (8) , 14178-14191
Heterogeneous Signcryption Scheme From PKI to IBC With Multi-Ciphertext Equality Test in Internet of Vehicles
With the arrival of the era of self-driving technology, 5G, and IoT technology, self-driving car Internet technology is gradually changing the way people travel. The existing signcryption scheme test scheme with equality can only compare two ciphertexts, which is not suitable for the complex network of Internet of vehicles. To address this challenge, we propose the heterogeneous signcryption scheme from public key infrastructure (PKI) to identity-based cryptosystem (IBC) with multi-ciphertext equality test in the Internet of vehicles (HSCPI-MET). This scheme enables to communicate from PKI cryptosystem to IBC cryptosystem in Internet of vehicles, at the same time excuting the equality test of multi-ciphertext. Our scheme protects inter-vehicle communication data from being illegally accessed, tampered, or forged by malicious vehicles. The proposed scheme satisfies confidentiality and unforgeability under the stochastic predictor model for the computational Diffie–Hellman assumption and the IDH assumption. In addition, we conduct a rigorous experimental evaluation of the scheme to prove that it is secure and effective in practical applications.
- 11 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (8) , 14178-14191
Heterogeneous Signcryption Scheme From PKI to IBC With Multi-Ciphertext Equality Test in Internet of Vehicles
With the arrival of the era of self-driving technology, 5G, and IoT technology, self-driving car Internet technology is gradually changing the way people travel. The existing signcryption scheme test scheme with equality can only compare two ciphertexts, which is not suitable for the complex network of Internet of vehicles. To address this challenge, we propose the heterogeneous signcryption scheme from public key infrastructure (PKI) to identity-based cryptosystem (IBC) with multi-ciphertext equality test in the Internet of vehicles (HSCPI-MET). This scheme enables to communicate from PKI cryptosystem to IBC cryptosystem in Internet of vehicles, at the same time excuting the equality test of multi-ciphertext. Our scheme protects inter-vehicle communication data from being illegally accessed, tampered, or forged by malicious vehicles. The proposed scheme satisfies confidentiality and unforgeability under the stochastic predictor model for the computational Diffie–Hellman assumption and the IDH assumption. In addition, we conduct a rigorous experimental evaluation of the scheme to prove that it is secure and effective in practical applications.
- 2 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 20 (2) , 1884-1894
Cryptanalysis and Improvement of a Blockchain-Based Certificateless Signature for IIoT Devices
With the rapid development of the IIoT, security and privacy issues have become increasingly prominent when the data from IIoT devices are shared across public networks. Very recently, Wang et al. presented a blockchain-based CLS scheme for IIoT devices in order to achieve secure and lightweight communication (IEEE Transactions on Industrial Informatics, DOI: 10.1109/TII.2021.3084753). Wang et al. claimed that their CLS scheme is secure under the assumption of the elliptic curve discrete logarithm problem. Unfortunately, by providing two attack methods to analyze the security of Wang et al.’s CLS scheme, we find that it is insecure against universal forgery attacks. Without knowing any information about the target user's private key, the two categories of attackers can successfully forge the valid signature of any message. Hence, Wang et al.’s CLS scheme fails to achieve the claimed security goals. To fix the security flaws, we propose an enhanced blockchain-based and pairing-free CLS scheme, and prove its security in the random oracle model. Furthermore, the analysis results demonstrate that our revised scheme has higher security while keeping the performance of the original scheme.
- 2 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 20 (2) , 1884-1894
Cryptanalysis and Improvement of a Blockchain-Based Certificateless Signature for IIoT Devices
With the rapid development of the IIoT, security and privacy issues have become increasingly prominent when the data from IIoT devices are shared across public networks. Very recently, Wang et al. presented a blockchain-based CLS scheme for IIoT devices in order to achieve secure and lightweight communication (IEEE Transactions on Industrial Informatics, DOI: 10.1109/TII.2021.3084753). Wang et al. claimed that their CLS scheme is secure under the assumption of the elliptic curve discrete logarithm problem. Unfortunately, by providing two attack methods to analyze the security of Wang et al.’s CLS scheme, we find that it is insecure against universal forgery attacks. Without knowing any information about the target user's private key, the two categories of attackers can successfully forge the valid signature of any message. Hence, Wang et al.’s CLS scheme fails to achieve the claimed security goals. To fix the security flaws, we propose an enhanced blockchain-based and pairing-free CLS scheme, and prove its security in the random oracle model. Furthermore, the analysis results demonstrate that our revised scheme has higher security while keeping the performance of the original scheme.
- 30 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (12) , 10881-10892
Improved Security of a Pairing-Free Certificateless Aggregate Signature in Healthcare Wireless Medical Sensor Networks
Recently, Zhan et al. presented a pairing-free certificateless aggregation signature scheme (ZH-CLAS) to address security issues in healthcare wireless medical sensor networks (HWMSNs) and proved that their scheme is secure against adaptive chosen message attacks. In this article, we analyze the security of the ZH-CLAS scheme by utilizing two types of concrete attacks. Unfortunately, we demonstrate that their scheme cannot withstand public key replacement attacks and is not secure against coalition attacks from malicious sensor nodes. To solve these security challenges, we further improve the security of the ZH-CLAS scheme. Our enhanced scheme has a fixed-length aggregate signature, which efficiently minimizes the transmission bandwidth. Additionally, our scheme outperforms related pairing-free certificateless aggregate signature schemes in terms of security and communication performance.
- 30 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (12) , 10881-10892
Improved Security of a Pairing-Free Certificateless Aggregate Signature in Healthcare Wireless Medical Sensor Networks
Recently, Zhan et al. presented a pairing-free certificateless aggregation signature scheme (ZH-CLAS) to address security issues in healthcare wireless medical sensor networks (HWMSNs) and proved that their scheme is secure against adaptive chosen message attacks. In this article, we analyze the security of the ZH-CLAS scheme by utilizing two types of concrete attacks. Unfortunately, we demonstrate that their scheme cannot withstand public key replacement attacks and is not secure against coalition attacks from malicious sensor nodes. To solve these security challenges, we further improve the security of the ZH-CLAS scheme. Our enhanced scheme has a fixed-length aggregate signature, which efficiently minimizes the transmission bandwidth. Additionally, our scheme outperforms related pairing-free certificateless aggregate signature schemes in terms of security and communication performance.