Chenbin Zhao
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
Chenbin Zhao has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Jing Chen
Wuhan University
7 shared publications - Kun He
Wuhan University
6 shared publications - Ruiying Du
Wuhan University
6 shared publications - Feng Wang
Fujian University of Technology
3 shared publications - Jiguo Li
Fujian Normal University
3 shared publications - Li Xu
College of Computer and Cyber Security, Fujian Provincial Key Laboratory of Network Security and Cryptology, Fujian Normal University, Fuzhou, China
3 shared publications
Latest Publications
- 2 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. PP (15455971) , 1-15
An Anonymous Multi-Authority Key-Policy Attribute-Based Encryption Scheme With Expressive Keyword Search
Existing attribute-based searchable encryption schemes have advanced the ability to perform fine-grained keyword retrieval over encrypted data; however, they still suffer from two fundamental limitations. First, most existing constructions rely on a single trusted authority, which not only results in excessive computational burden on the centralized entity but also limits the scalability of key management in distributed environments. Second, many schemes reveal sensitive attribute or policy information in ciphertexts or search tokens, causing privacy leakage and enabling inference attacks from untrusted servers. These shortcomings highlight the need for a decentralized and privacy-preserving searchable encryption framework capable of supporting expressive queries without exposing access structures or user attributes. To overcome these limitations, we first design an anonymous Multi-Authority Key-Policy Attribute-Based Encryption (MA-KPABE) scheme. Our construction conceals the access policies embedded in users' secret keys and attribute embedded in the ciphertext, thereby limiting information leakage during key generation. Building upon this foundation, we further extend MA-KPABE into a Multi-Authority Attribute-Based Searchable Encryption (MA-ASE) scheme that integrates expressive keyword search capabilities while preserving keyword privacy. The resulting system enables decentralized key management, privacy-preserving access control, and secure expressive search within a unified cryptographic framework. We formally prove that the proposed schemes satisfy IND-CPA, anonymity, and IND-CKA security. Comprehensive performance evaluations demonstrate that the distributed architecture significantly reduces authority-side computational load and achieves practical efficiency for large-scale encrypted retrieval scenarios.
- 2 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. PP (15455971) , 1-15
An Anonymous Multi-Authority Key-Policy Attribute-Based Encryption Scheme With Expressive Keyword Search
Existing attribute-based searchable encryption schemes have advanced the ability to perform fine-grained keyword retrieval over encrypted data; however, they still suffer from two fundamental limitations. First, most existing constructions rely on a single trusted authority, which not only results in excessive computational burden on the centralized entity but also limits the scalability of key management in distributed environments. Second, many schemes reveal sensitive attribute or policy information in ciphertexts or search tokens, causing privacy leakage and enabling inference attacks from untrusted servers. These shortcomings highlight the need for a decentralized and privacy-preserving searchable encryption framework capable of supporting expressive queries without exposing access structures or user attributes. To overcome these limitations, we first design an anonymous Multi-Authority Key-Policy Attribute-Based Encryption (MA-KPABE) scheme. Our construction conceals the access policies embedded in users' secret keys and attribute embedded in the ciphertext, thereby limiting information leakage during key generation. Building upon this foundation, we further extend MA-KPABE into a Multi-Authority Attribute-Based Searchable Encryption (MA-ASE) scheme that integrates expressive keyword search capabilities while preserving keyword privacy. The resulting system enables decentralized key management, privacy-preserving access control, and secure expressive search within a unified cryptographic framework. We formally prove that the proposed schemes satisfy IND-CPA, anonymity, and IND-CKA security. Comprehensive performance evaluations demonstrate that the distributed architecture significantly reduces authority-side computational load and achieves practical efficiency for large-scale encrypted retrieval scenarios.
- 9 March 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 317
A large-language-model-guided progressive error-correction framework for structured process modeling
- 9 March 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 317
A large-language-model-guided progressive error-correction framework for structured process modeling
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21, 7032-7047
SHRD: A Scalable Scheme for Hierarchical File Sharing With Rank-Aware Dissemination
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21, 7032-7047
SHRD: A Scalable Scheme for Hierarchical File Sharing With Rank-Aware Dissemination
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (5) , 1-15
Secure and Verifiable Optional-Dimension Data Aggregation for Efficient WBAN Deployment
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (5) , 1-15
Secure and Verifiable Optional-Dimension Data Aggregation for Efficient WBAN Deployment
- 15 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (2) , 4208-4220
Fully Private Shortest Path Computation With Single-Round Interaction
In real-world scenarios, computing the shortest path between given source and destination is widely prevalent, such as seeking the optimal route in a road network for navigation. However, in traditional non-private solutions, the user discloses its location information to the server in order to obtain the targeted shortest path, giving rise to a significant privacy leakage problem. Existing private shortest path computation schemes either provide limited privacy guarantees or require multiple interactions between the user and the server. In this paper, we introduce a fully private shortest path computation scheme, named Srchpa. This scheme ensures full privacy for both the location information provided by the user and the routing information held by the server. Furthermore, we propose a locally iterative computation method, achieving single-round interaction between the user and the server to obtain the targeted shortest path. Finally, we present the formal security analyses and comprehensive experiment evaluations. The security analyses demonstrate that our scheme achieves full privacy even if the server is malicious. The experiment evaluation results show that our scheme has lower computation, communication and storage costs on the user side, thus is practical for the lightweight user with limited resources.
- 15 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (2) , 4208-4220
Fully Private Shortest Path Computation With Single-Round Interaction
In real-world scenarios, computing the shortest path between given source and destination is widely prevalent, such as seeking the optimal route in a road network for navigation. However, in traditional non-private solutions, the user discloses its location information to the server in order to obtain the targeted shortest path, giving rise to a significant privacy leakage problem. Existing private shortest path computation schemes either provide limited privacy guarantees or require multiple interactions between the user and the server. In this paper, we introduce a fully private shortest path computation scheme, named Srchpa. This scheme ensures full privacy for both the location information provided by the user and the routing information held by the server. Furthermore, we propose a locally iterative computation method, achieving single-round interaction between the user and the server to obtain the targeted shortest path. Finally, we present the formal security analyses and comprehensive experiment evaluations. The security analyses demonstrate that our scheme achieves full privacy even if the server is malicious. The experiment evaluation results show that our scheme has lower computation, communication and storage costs on the user side, thus is practical for the lightweight user with limited resources.
- 17 October 2025
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 95
FM-DPDP: Fine-grained Multicopy Dynamic Provable Data Possession with flexible storage
- 17 October 2025
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 95
FM-DPDP: Fine-grained Multicopy Dynamic Provable Data Possession with flexible storage
- 8 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 9492-9506
Lightweight Dynamic Conjunctive Keyword Searchable Encryption With Result Pattern Hiding
With the rapid growth of cloud storage technology, the demand for efficient and secure search of outsourced encrypted data has become increasingly critical. However, existing conjunctive keyword dynamic searchable encryption schemes often expose the Keyword Pair Result Pattern (KPRP) during index matching, compromising privacy. Additionally, frequent index updates require expensive group exponentiations, leading to high client-side overhead. To tackle these challenges, we propose LRP-HDSE, a lightweight dynamic conjunctive keyword searchable encryption scheme that hides KPRP while minimizing client computation costs. To enhance privacy, we introduce the Vector Hidden Subset Predicate Encryption (VH-SPE) mechanism, which enables the server to implicitly detect cross-tag in the membership matching index, effectively mitigating KPRP leakage. For improved efficiency, the scheme designs a lightweight membership matching index structure, LSet, based on low-cost multiset hash operations, reducing reliance on costly exponentiations and lowering client overhead. Our security analysis confirms that LRP-HDSE provides robust KPRP hiding along with forward and backward security in dynamic environments. Asymptotic analysis, along with experiment evaluations on two real-world datasets, show that our scheme offers superior client-side computational efficiency compared to existing approaches, making it both practical and effective.
- 8 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 9492-9506
Lightweight Dynamic Conjunctive Keyword Searchable Encryption With Result Pattern Hiding
With the rapid growth of cloud storage technology, the demand for efficient and secure search of outsourced encrypted data has become increasingly critical. However, existing conjunctive keyword dynamic searchable encryption schemes often expose the Keyword Pair Result Pattern (KPRP) during index matching, compromising privacy. Additionally, frequent index updates require expensive group exponentiations, leading to high client-side overhead. To tackle these challenges, we propose LRP-HDSE, a lightweight dynamic conjunctive keyword searchable encryption scheme that hides KPRP while minimizing client computation costs. To enhance privacy, we introduce the Vector Hidden Subset Predicate Encryption (VH-SPE) mechanism, which enables the server to implicitly detect cross-tag in the membership matching index, effectively mitigating KPRP leakage. For improved efficiency, the scheme designs a lightweight membership matching index structure, LSet, based on low-cost multiset hash operations, reducing reliance on costly exponentiations and lowering client overhead. Our security analysis confirms that LRP-HDSE provides robust KPRP hiding along with forward and backward security in dynamic environments. Asymptotic analysis, along with experiment evaluations on two real-world datasets, show that our scheme offers superior client-side computational efficiency compared to existing approaches, making it both practical and effective.
- 21 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 24 (12) , 13633-13647
EP-GSPR: An Efficient Privacy-Preserving Graph Shortest Path Retrieval Scheme
The continuous development of mobile terminal applications, online maps, and other navigation services have become widely used, simultaneously giving rise to significant security risks. To address the issues of privacy leakage and low efficiency in traditional graph shortest path retrieval schemes, an efficient privacy-preserving graph shortest path retrieval scheme is proposed, called EP-GSPR. Specifically, this scheme addresses the privacy security problems in the existing graph shortest path retrieval solutions by ensuring the bilateral privacy protection of the user’s query location and the database privacy of the cloud server. Throughout the retrieval process, the cloud server cannot obtain the user’s location information, and the user cannot access any database information other than the retrieval results. To overcome the performance bottlenecks in existing schemes, a progressive iterative retrieval framework is designed as the fundamental modular, called Pirf, achieving sub-linear retrieval costs and low storage overhead on the cloud server side. Finally, the security analyses demonstrate the EP-GSPR scheme achieves the bilateral privacy-preserving in terms of user and server sides. The comprehensive experiment evaluations also state the efficiency and practicality of the proposed scheme.
- 21 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 24 (12) , 13633-13647
EP-GSPR: An Efficient Privacy-Preserving Graph Shortest Path Retrieval Scheme
The continuous development of mobile terminal applications, online maps, and other navigation services have become widely used, simultaneously giving rise to significant security risks. To address the issues of privacy leakage and low efficiency in traditional graph shortest path retrieval schemes, an efficient privacy-preserving graph shortest path retrieval scheme is proposed, called EP-GSPR. Specifically, this scheme addresses the privacy security problems in the existing graph shortest path retrieval solutions by ensuring the bilateral privacy protection of the user’s query location and the database privacy of the cloud server. Throughout the retrieval process, the cloud server cannot obtain the user’s location information, and the user cannot access any database information other than the retrieval results. To overcome the performance bottlenecks in existing schemes, a progressive iterative retrieval framework is designed as the fundamental modular, called Pirf, achieving sub-linear retrieval costs and low storage overhead on the cloud server side. Finally, the security analyses demonstrate the EP-GSPR scheme achieves the bilateral privacy-preserving in terms of user and server sides. The comprehensive experiment evaluations also state the efficiency and practicality of the proposed scheme.
- 3 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. 74 (4) , 5119-5132
Practical Multiuser Dynamic Searchable Symmetric Encryption With Collusion Resistance
As data sharing becomes more prevalent, there is growing interest in multiuser dynamic searchable symmetric encryption (MU-DSSE). It enables multiple authorized users to search the encrypted database while safeguarding data privacy. However, most existing schemes are inefficient due to complex computation operations and unaffordable storage burdens. In addition, some are susceptible to collusion attacks between cloud server and compromised users, leading to the leakage of search privacy from other legitimate users. To overcome these challenges, we propose a practical MU-DSSE scheme featuring an unlinkable key derivation mechanism to thwart collusion attacks. Moreover, the MU-DSSE scheme ensures both forward and backward securities in the dynamic setting. To enhance efficiency, we introduce an innovative identity-based key encapsulation mechanism for distributing authorization information to multiple users, significantly optimizing computation and storage costs on user sides and the data owner. Furthermore, we provide the formal security proof and performance analyses. The experimental results demonstrate that MU-DSSE incurs the constant-size storage cost on user sides and the data owner, and outperforms the existing schemes in practice.
- 3 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. 74 (4) , 5119-5132
Practical Multiuser Dynamic Searchable Symmetric Encryption With Collusion Resistance
As data sharing becomes more prevalent, there is growing interest in multiuser dynamic searchable symmetric encryption (MU-DSSE). It enables multiple authorized users to search the encrypted database while safeguarding data privacy. However, most existing schemes are inefficient due to complex computation operations and unaffordable storage burdens. In addition, some are susceptible to collusion attacks between cloud server and compromised users, leading to the leakage of search privacy from other legitimate users. To overcome these challenges, we propose a practical MU-DSSE scheme featuring an unlinkable key derivation mechanism to thwart collusion attacks. Moreover, the MU-DSSE scheme ensures both forward and backward securities in the dynamic setting. To enhance efficiency, we introduce an innovative identity-based key encapsulation mechanism for distributing authorization information to multiple users, significantly optimizing computation and storage costs on user sides and the data owner. Furthermore, we provide the formal security proof and performance analyses. The experimental results demonstrate that MU-DSSE incurs the constant-size storage cost on user sides and the data owner, and outperforms the existing schemes in practice.
- 27 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (13) , 23933-23945
Reversible Data Hiding With Secret Encrypted Image Sharing and Adaptive Coding
To ensure the security of image information and facilitate efficient management in the cloud, the utilization of reversible data hiding in encrypted images (RDHEIs) has emerged as pivotal. However, most existing RDHEI schemes suffer from lower security and limited embedding capacity. To tackle these challenges, we propose a reversible data hiding (RDH) with secret encrypted image sharing and adaptive coding scheme. Specifically, in the encryption phase, we introduce an improved secret sharing (SS) encryption method based on the Chinese remainder theorem for polynomials (CRTPs). This method not only improves the security of encrypted images but also vacates a larger room for embedding. In the embedding phase, we introduce an adaptive coding embedding approach using xor preservation (XORP) and huffman coding, which provides high embedding capacity. Experimental results and security analysis demonstrate that our proposed encryption method achieves optimal values in security indicators for encrypted images, such as information entropy, histograms, number of pixels change rate and unified average changing intensity. The proposed embedding method is superior to some state-of-the-art schemes in terms of embedding capacity. Furthermore, in datasets BOSSBase and BOWS2, the average embedding rates of the proposed embedding approach can reach 2.1745 bits per pixel (bpp) and 2.0656 bpp, respectively.
- 27 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (13) , 23933-23945
Reversible Data Hiding With Secret Encrypted Image Sharing and Adaptive Coding
To ensure the security of image information and facilitate efficient management in the cloud, the utilization of reversible data hiding in encrypted images (RDHEIs) has emerged as pivotal. However, most existing RDHEI schemes suffer from lower security and limited embedding capacity. To tackle these challenges, we propose a reversible data hiding (RDH) with secret encrypted image sharing and adaptive coding scheme. Specifically, in the encryption phase, we introduce an improved secret sharing (SS) encryption method based on the Chinese remainder theorem for polynomials (CRTPs). This method not only improves the security of encrypted images but also vacates a larger room for embedding. In the embedding phase, we introduce an adaptive coding embedding approach using xor preservation (XORP) and huffman coding, which provides high embedding capacity. Experimental results and security analysis demonstrate that our proposed encryption method achieves optimal values in security indicators for encrypted images, such as information entropy, histograms, number of pixels change rate and unified average changing intensity. The proposed embedding method is superior to some state-of-the-art schemes in terms of embedding capacity. Furthermore, in datasets BOSSBase and BOWS2, the average embedding rates of the proposed embedding approach can reach 2.1745 bits per pixel (bpp) and 2.0656 bpp, respectively.