Zhiyuan Sui
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
Zhiyuan Sui has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Yujiao Sun
MIIT Key Laboratory of Mathematical Theory and Computation in Information Security, School of Mathematics and Statistics, Beijing Institute of Technology, Beijing, China
3 shared publications - Hermann de Meer
University of Passau, Passau, Germany
2 shared publications Yaxing Zha
China Communications Information Technology Group Company Ltd., Beijing, China
2 shared publicationsYujiao Sun
MIIT Key Laboratory of Mathematical Theory and Computation in Information Security, School of Mathematics and Statistics, Beijing Institute of Technology, Beijing, China
2 shared publications- Fu Chen
Central University of Finance and Economics
1 shared publication Hermann de Meer
1 shared publication
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (21) , 50626-50635
A Generic Modular Construction of Constant-Pairing Certificateless Aggregate Signatures
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (21) , 50626-50635
A Generic Modular Construction of Constant-Pairing Certificateless Aggregate Signatures
- 6 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (12) , 27747-27756
ECLAS: Efficient Certificateless Aggregate Signature With Minimal Latency in VANETs
Vehicular ad hoc networks (VANETs) are a critical component of modern transportation systems, offering significant benefits in terms of safety, efficiency, and user experience. However, addressing challenges related to security, privacy, and scalability is essential for their successful implementation and widespread adoption. The verification of digital signatures in VANETs is crucial for security and privacy issues, but it can generate significant communication overhead due to certificate management, signature transmissions, and verification computations. This can lead to scalability issues, where the system becomes less efficient and more prone to delays. In this article, we propose an efficient certificateless aggregate signature scheme (ECLAS) to address the above three challenges. The ECLAS scheme is proven to be a secure certificateless signature scheme against chosen-message attacks in the random oracle model. Therefore, the ECLAS scheme eliminates certificate management in the system. Furthermore, the performance comparison shows that the ECLAS scheme achieves the shortest signature size and the most efficient verification cost for traffic-related message transmissions. Consequently, the ECLAS scheme achieves minimal communication latency in VANETs.
- 6 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (12) , 27747-27756
ECLAS: Efficient Certificateless Aggregate Signature With Minimal Latency in VANETs
Vehicular ad hoc networks (VANETs) are a critical component of modern transportation systems, offering significant benefits in terms of safety, efficiency, and user experience. However, addressing challenges related to security, privacy, and scalability is essential for their successful implementation and widespread adoption. The verification of digital signatures in VANETs is crucial for security and privacy issues, but it can generate significant communication overhead due to certificate management, signature transmissions, and verification computations. This can lead to scalability issues, where the system becomes less efficient and more prone to delays. In this article, we propose an efficient certificateless aggregate signature scheme (ECLAS) to address the above three challenges. The ECLAS scheme is proven to be a secure certificateless signature scheme against chosen-message attacks in the random oracle model. Therefore, the ECLAS scheme eliminates certificate management in the system. Furthermore, the performance comparison shows that the ECLAS scheme achieves the shortest signature size and the most efficient verification cost for traffic-related message transmissions. Consequently, the ECLAS scheme achieves minimal communication latency in VANETs.
- 30 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (4) , 2667-2672
FB-ASC+: Improved Fog-Blockchain Assisted Certificateless Aggregate Signcryption Scheme
Smart grids enable two-way communication between control centers and smart meters. However, this capability introduces security and privacy risks and has consequently prompted extensive research. Liu et al. proposed a fog-blockchain-assisted certificateless aggregate signcryption (FB-ASC) scheme to achieve confidentiality and unforgeability in smart grids. Our research demonstrates that their signcryption design achieves neither confidentiality nor unforgeability, and we show that the supporting lemmas in their paper do not hold. Under the same system models, we presented effective attacks on their scheme and consequently proposed the FB-ASC+ scheme that provides provable security guarantees against the aforementioned attacks. Comparison results further illustrate its performance advantages over pairing-based alternatives in typical smart-grid scenarios.
- 30 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (4) , 2667-2672
FB-ASC+: Improved Fog-Blockchain Assisted Certificateless Aggregate Signcryption Scheme
Smart grids enable two-way communication between control centers and smart meters. However, this capability introduces security and privacy risks and has consequently prompted extensive research. Liu et al. proposed a fog-blockchain-assisted certificateless aggregate signcryption (FB-ASC) scheme to achieve confidentiality and unforgeability in smart grids. Our research demonstrates that their signcryption design achieves neither confidentiality nor unforgeability, and we show that the supporting lemmas in their paper do not hold. Under the same system models, we presented effective attacks on their scheme and consequently proposed the FB-ASC+ scheme that provides provable security guarantees against the aforementioned attacks. Comparison results further illustrate its performance advantages over pairing-based alternatives in typical smart-grid scenarios.
- 29 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (14) , 27547-27556
QCSAS: A Quasi-Constant and Synchronized Aggregate Signature Scheme for AMI Networks
Smart grids must safeguard their critical infrastructures against both physical and cyber attacks. Therefore, real-time operation and cybersecurity are two fundamental requirements for smart grid systems. Advanced metering infrastructure (AMI) is a critical part of the smart grid that specifically deals with the measurement, collection, and analysis of electricity usage data. Digital signatures help prevent data tampering and ensure cybersecurity during AMI communications. However, as the number of smart meters and transactions in an AMI network increases, deploying digital signatures can lead to communication delays. This article designs a quasi-constant and synchronized aggregate signature scheme (QCSAS), which can protect usage data without hash functions. The QCSAS scheme simplifies the synchronized aggregate signatures, and is proved secure against chosen message attacks in the random oracle model. The QCSAS scheme incorporates the features of synchronized aggregate signatures, such as the constant aggregate signature size, thereby minimizing the data management system’s storage space. Furthermore, the length of usage data does not exceed 12-bit, in compliance with existing governmental standards. The computational cost of multiplying a 12-bit integer is negligible compared to other cryptographic operations. Thus, the verification cost of the QCSAS scheme remains quasi-constant.
- 29 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (14) , 27547-27556
QCSAS: A Quasi-Constant and Synchronized Aggregate Signature Scheme for AMI Networks
Smart grids must safeguard their critical infrastructures against both physical and cyber attacks. Therefore, real-time operation and cybersecurity are two fundamental requirements for smart grid systems. Advanced metering infrastructure (AMI) is a critical part of the smart grid that specifically deals with the measurement, collection, and analysis of electricity usage data. Digital signatures help prevent data tampering and ensure cybersecurity during AMI communications. However, as the number of smart meters and transactions in an AMI network increases, deploying digital signatures can lead to communication delays. This article designs a quasi-constant and synchronized aggregate signature scheme (QCSAS), which can protect usage data without hash functions. The QCSAS scheme simplifies the synchronized aggregate signatures, and is proved secure against chosen message attacks in the random oracle model. The QCSAS scheme incorporates the features of synchronized aggregate signatures, such as the constant aggregate signature size, thereby minimizing the data management system’s storage space. Furthermore, the length of usage data does not exceed 12-bit, in compliance with existing governmental standards. The computational cost of multiplying a 12-bit integer is negligible compared to other cryptographic operations. Thus, the verification cost of the QCSAS scheme remains quasi-constant.
- 25 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (8) , 15043-15046
Comments on “Lightweight Privacy and Security Computing for Blockchained Federated Learning in IoT”
Federated learning has been used to collaboratively train a decentralized model without sharing confidential model records. However, many security risks are involved in this regard, and scholars have conducted numerous studies on related topics. Fan et al. proposed a scheme to achieve model unforgeability and confidentiality in blockchained federated learning (lightweight privacy blockchained federated-learning (LPBFL) scheme) in the Internet of Things. Our research demonstrates that their scheme is insecure in terms of signature design and that their theorem is invalid. We present an effective attack on their signature algorithm and create a new signature method and a formal security model to provide security guarantee against the mentioned attack. Extensive simulations demonstrate that our signature algorithm does not harm the highly efficient LPBFL scheme.
- 25 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (8) , 15043-15046
Comments on “Lightweight Privacy and Security Computing for Blockchained Federated Learning in IoT”
Federated learning has been used to collaboratively train a decentralized model without sharing confidential model records. However, many security risks are involved in this regard, and scholars have conducted numerous studies on related topics. Fan et al. proposed a scheme to achieve model unforgeability and confidentiality in blockchained federated learning (lightweight privacy blockchained federated-learning (LPBFL) scheme) in the Internet of Things. Our research demonstrates that their scheme is insecure in terms of signature design and that their theorem is invalid. We present an effective attack on their signature algorithm and create a new signature method and a formal security model to provide security guarantee against the mentioned attack. Extensive simulations demonstrate that our signature algorithm does not harm the highly efficient LPBFL scheme.
- 5 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 11 (3) , 2260-2272
BPMS: Blockchain-Based Privacy-Preserving Multi-Keyword Search in Multi-Owner Setting
Searchable encryption (SE) has emerged as a cryptographic primitive that allows data users to search on encrypted data. Most existing SE schemes usually delegate search operations to an intermediary such as a cloud server, which would inevitably result in single-point failure, privacy leakage, and even untrustworthy results. Several blockchain-based SE schemes have been proposed to alleviate these issues; however, they suffer from some issues, such as the support for multi-keyword multi-owner model, query privacy and data storage availability. In this paper, we propose BPMS, blockchain-based privacy-preserving multi-keyword search in multi-owner setting, which supports searching over encrypted data in trustworthy, private and efficient manners. The attribute Bloom filter has been introduced into our BPMS to build indexes, which protects query privacy and improves index generation performance. To guarantee data storage availability, our BPMS leverages the advantages of IPFS (InterPlanetary File System) to store large scale of encrypted data. Security proof and comparative analysis in theory indicate that our BPMS is more secure and efficient. A series of experiments conducted on a real-world dataset further demonstrate that our BPMS is feasible in practice.
- 5 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 11 (3) , 2260-2272
BPMS: Blockchain-Based Privacy-Preserving Multi-Keyword Search in Multi-Owner Setting
Searchable encryption (SE) has emerged as a cryptographic primitive that allows data users to search on encrypted data. Most existing SE schemes usually delegate search operations to an intermediary such as a cloud server, which would inevitably result in single-point failure, privacy leakage, and even untrustworthy results. Several blockchain-based SE schemes have been proposed to alleviate these issues; however, they suffer from some issues, such as the support for multi-keyword multi-owner model, query privacy and data storage availability. In this paper, we propose BPMS, blockchain-based privacy-preserving multi-keyword search in multi-owner setting, which supports searching over encrypted data in trustworthy, private and efficient manners. The attribute Bloom filter has been introduced into our BPMS to build indexes, which protects query privacy and improves index generation performance. To guarantee data storage availability, our BPMS leverages the advantages of IPFS (InterPlanetary File System) to store large scale of encrypted data. Security proof and comparative analysis in theory indicate that our BPMS is more secure and efficient. A series of experiments conducted on a real-world dataset further demonstrate that our BPMS is feasible in practice.
- 7 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 38 (1) , 132-140
An Efficient Signcryption Protocol for Hop-by-Hop Data Aggregations in Smart Grids
- 7 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 38 (1) , 132-140
An Efficient Signcryption Protocol for Hop-by-Hop Data Aggregations in Smart Grids
- 4 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 16 (2) , 842-853
BAP: A Batch and Auditable Privacy Preservation Scheme for Demand Response in Smart Grids
Advancing network technologies allows the setup of two-way communication links between energy providers and consumers. These developing technologies aim to enhance grid reliability and energy efficiency in smart grids. To achieve this goal, energy usage reports from consumers are required to be both trustworthy and confidential. In this paper, we construct a new data aggregation scheme in smart grids based on a homomorphic encryption algorithm. In the constructed scheme, obedient consumers who follow the instruction can prove its ajustment using a range proof protocol. Additionally, we propose a new identity-based signature algorithm in order to ensure authentication and integrity of the constructed scheme. By using this signature algorithm, usage reports are verified in real time. Extensive simulations demonstrate that our scheme outperforms other data aggregation schemes.
- 4 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 16 (2) , 842-853
BAP: A Batch and Auditable Privacy Preservation Scheme for Demand Response in Smart Grids
Advancing network technologies allows the setup of two-way communication links between energy providers and consumers. These developing technologies aim to enhance grid reliability and energy efficiency in smart grids. To achieve this goal, energy usage reports from consumers are required to be both trustworthy and confidential. In this paper, we construct a new data aggregation scheme in smart grids based on a homomorphic encryption algorithm. In the constructed scheme, obedient consumers who follow the instruction can prove its ajustment using a range proof protocol. Additionally, we propose a new identity-based signature algorithm in order to ensure authentication and integrity of the constructed scheme. By using this signature algorithm, usage reports are verified in real time. Extensive simulations demonstrate that our scheme outperforms other data aggregation schemes.