Jianhua Chen
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
Jianhua Chen has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Yulei Chen
School of Mathematics and Statistics, Zhoukou Normal University, Zhoukou, China
6 shared publications - Debiao He
Wuhan University
5 shared publications - Mingping Qi
School of Cybersecurity, Northwestern Polytechnical University, Xian, China
4 shared publications - Cong Peng
Wuhan University
3 shared publications - Dongwei Guo
Nanjing University of Science and Technology
2 shared publications - Haorui Du
The School of Mathematics and Statistics, Wuhan University, Wuhan, 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) , 43481-43496
LcASS: Efficient Lattice-Based Certificateless Aggregation Signature Scheme With Blockchain for VANETs
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (18) , 43481-43496
LcASS: Efficient Lattice-Based Certificateless Aggregation Signature Scheme With Blockchain for VANETs
- 30 April 2025
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (6) , 1-25
A provably secure certificateless online/offline signature scheme for internet of things
- 30 April 2025
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (6) , 1-25
A provably secure certificateless online/offline signature scheme for internet of things
- 12 August 2023
- Published by Springer Nature in Frontiers of Computer Science
- Vol. 18 (1) , 1-15
Non-interactive SM2 threshold signature scheme with identifiable abort
- 12 August 2023
- Published by Springer Nature in Frontiers of Computer Science
- Vol. 18 (1) , 1-15
Non-interactive SM2 threshold signature scheme with identifiable abort
- Open Access
- 15 October 2022
- Published by Wiley in Security and Communication Networks
- Vol. 2022, 1-15
A Lightweight Blockchain-based Public-Key Authenticated Encryption with Multi-Keyword Search for Cloud Computing
Cloud computing can provide users with sufficient computing resources, storage, and bandwidth to meet their needs. Data security and privacy protection are among the new threats faced by users. Searchable encryption is the combination of search technology and encryption technology. Searchable encryption can upload the user’s data to the cloud server after special encryption, and can realize the function of retrieving according to keywords. Comparatively to symmetric searchable encryption (SSE), public key searchable encryption (PEKS) simplifies key management greatly. However, most existing public key authenticated encryption with keyword search (PAEKS) schemes are based bilinear pairing, making them computationally expensive. Apart from this, complex retrieval requirements and the integrity of the results had not been considered. To address these problems, we propose a blockchain-based PAEKS schemes supporting multi-keyword queries and integrity verification. In addition, we provide security proofs for the PAEKS scheme under the decisional oracle Diffie-Hellman (DODH) assumption. This scheme a scheme that requires less storage and computational power than other schemes of the same kind.
- 15 October 2022
- Published by Wiley in Security and Communication Networks
- Vol. 2022, 1-15
Open AccessA Lightweight Blockchain-based Public-Key Authenticated Encryption with Multi-Keyword Search for Cloud Computing
Cloud computing can provide users with sufficient computing resources, storage, and bandwidth to meet their needs. Data security and privacy protection are among the new threats faced by users. Searchable encryption is the combination of search technology and encryption technology. Searchable encryption can upload the user’s data to the cloud server after special encryption, and can realize the function of retrieving according to keywords. Comparatively to symmetric searchable encryption (SSE), public key searchable encryption (PEKS) simplifies key management greatly. However, most existing public key authenticated encryption with keyword search (PAEKS) schemes are based bilinear pairing, making them computationally expensive. Apart from this, complex retrieval requirements and the integrity of the results had not been considered. To address these problems, we propose a blockchain-based PAEKS schemes supporting multi-keyword queries and integrity verification. In addition, we provide security proofs for the PAEKS scheme under the decisional oracle Diffie-Hellman (DODH) assumption. This scheme a scheme that requires less storage and computational power than other schemes of the same kind.
- 12 October 2022
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 82 (11) , 16009-16032
A biometrics-based mutual authentication and key agreement protocol for TMIS using elliptic curve cryptography
Telecare Medicine Information System (TMIS) refers to a medical model that uses communication and information technology to realize multiple medical functions such as remote disease diagnosis, treatment, and health care. Because TMIS is carried out on an insecure public Internet, a large number of mutual authentication and key agreement protocols for TMIS have been proposed to protect the privacy of patients. Recently, Ostad-Sharif et al. proposed a novel anonymous authentication and key agreement scheme for TMIS. In this work, we will demonstrate that Ostad-Sharif et al.’s scheme exists the problems of strong authentication and inefficient password change, and it cannot resist the off-line password guessing attack. To overcome the weaknesses found in Ostad-Sharif et al.’s scheme, we propose a biometrics-based mutual authentication and key agreement protocol for TMIS, making full use of the advantages of one-way hash function and elliptic curve cryptosystem (ECC). The security of the proposed scheme is formally proved under the widely used random oracle model (ROM), and various known malicious attack resistances also are presented by the heuristic discussion. Compared with the existing related schemes, the computation cost and communication overhead of our scheme are reduced by 74.5% and 27.3% respectively.
- 12 October 2022
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 82 (11) , 16009-16032
A biometrics-based mutual authentication and key agreement protocol for TMIS using elliptic curve cryptography
Telecare Medicine Information System (TMIS) refers to a medical model that uses communication and information technology to realize multiple medical functions such as remote disease diagnosis, treatment, and health care. Because TMIS is carried out on an insecure public Internet, a large number of mutual authentication and key agreement protocols for TMIS have been proposed to protect the privacy of patients. Recently, Ostad-Sharif et al. proposed a novel anonymous authentication and key agreement scheme for TMIS. In this work, we will demonstrate that Ostad-Sharif et al.’s scheme exists the problems of strong authentication and inefficient password change, and it cannot resist the off-line password guessing attack. To overcome the weaknesses found in Ostad-Sharif et al.’s scheme, we propose a biometrics-based mutual authentication and key agreement protocol for TMIS, making full use of the advantages of one-way hash function and elliptic curve cryptosystem (ECC). The security of the proposed scheme is formally proved under the widely used random oracle model (ROM), and various known malicious attack resistances also are presented by the heuristic discussion. Compared with the existing related schemes, the computation cost and communication overhead of our scheme are reduced by 74.5% and 27.3% respectively.
- 1 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 17 (2) , 2101-2112
Isoga: An Isogeny-Based Quantum-Resist Searchable Encryption Scheme Against Keyword Guessing Attacks
Driven by cloud computing technologies, public-key encryption with keyword search (PEKS) is becoming a common practice from aspects of the Industrial Internet of Things, smart healthcare, vehicular social networks, and so on. However, a dozen years of PEKS development is accompanied by some security and privacy issues in the encrypted data search and access processes. The keyword guessing attack is a typical user privacy threat model, that is, an adversary could guess the user’s retrieval keyword given a search trapdoor. On the other hand, the emergence of quantum computers make traditional PEKS schemes no longer secure. Although scholars put forward some postquantum secure PEKS schemes, these schemes are based on lattice cryptography with a larger key size. To the best of our knowledge, there is no quantum-resist PEKS scheme established on elliptic curve cryptography. This article utilizes PEKS with designated tester primitive and quantum resistance of isogeny. Then, we put forward a postquantum searchable encryption scheme named Isoga, which fights against keyword guessing attacks. We prove Isoga’s searchable ciphertext security and trapdoor indistinguishability under isogeny-related difficult assumptions. Performance evaluation indicates that the Isoga scheme is more practical in the quantum environment, considering seven schemes’ security properties, communication cost, and computing overload among.
- 1 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 17 (2) , 2101-2112
Isoga: An Isogeny-Based Quantum-Resist Searchable Encryption Scheme Against Keyword Guessing Attacks
Driven by cloud computing technologies, public-key encryption with keyword search (PEKS) is becoming a common practice from aspects of the Industrial Internet of Things, smart healthcare, vehicular social networks, and so on. However, a dozen years of PEKS development is accompanied by some security and privacy issues in the encrypted data search and access processes. The keyword guessing attack is a typical user privacy threat model, that is, an adversary could guess the user’s retrieval keyword given a search trapdoor. On the other hand, the emergence of quantum computers make traditional PEKS schemes no longer secure. Although scholars put forward some postquantum secure PEKS schemes, these schemes are based on lattice cryptography with a larger key size. To the best of our knowledge, there is no quantum-resist PEKS scheme established on elliptic curve cryptography. This article utilizes PEKS with designated tester primitive and quantum resistance of isogeny. Then, we put forward a postquantum searchable encryption scheme named Isoga, which fights against keyword guessing attacks. We prove Isoga’s searchable ciphertext security and trapdoor indistinguishability under isogeny-related difficult assumptions. Performance evaluation indicates that the Isoga scheme is more practical in the quantum environment, considering seven schemes’ security properties, communication cost, and computing overload among.
- 12 March 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 78 (10) , 12815-12833
Provably secure post-quantum authenticated key exchange from supersingular isogenies
- 12 March 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 78 (10) , 12815-12833
Provably secure post-quantum authenticated key exchange from supersingular isogenies
- 25 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 18 (9) , 6424-6434
SAKE*: A Symmetric Authenticated Key Exchange Protocol With Perfect Forward Secrecy for Industrial Internet of Things
Security in the Industrial Internet of Things (IIoT) is vital as there are some cases where IIoT devices collect sensory information for crucial social production and life. Thus, designing secure and efficient communication channels is always a research hotspot. However, end devices have memory, computation, and power-supplying capacities limitations. Moreover, perfect forward secrecy (PFS), which means that long-term key exposure still discloses previous session keys, is a critical security property for authentication and key exchange (AKE). This article proposes an AKE protocol named SAKE* for the IIoT environment, where two types of keys (i.e., a master key and an evolution key) guarantee PFS. In addition, the SAKE* protocol merely uses concatenation, XOR, and hash-function operations to achieve lightweight authentication, key exchange, and message integrity. We also compare the SAKE* protocol with seven current and IoT-related authentication protocols regarding security properties and performance. Comparison results indicate that the SAKE* protocol consumes the least computation resource and third-least communication cost among eight AKE protocols while equipping 12 security properties.
- 25 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 18 (9) , 6424-6434
SAKE*: A Symmetric Authenticated Key Exchange Protocol With Perfect Forward Secrecy for Industrial Internet of Things
Security in the Industrial Internet of Things (IIoT) is vital as there are some cases where IIoT devices collect sensory information for crucial social production and life. Thus, designing secure and efficient communication channels is always a research hotspot. However, end devices have memory, computation, and power-supplying capacities limitations. Moreover, perfect forward secrecy (PFS), which means that long-term key exposure still discloses previous session keys, is a critical security property for authentication and key exchange (AKE). This article proposes an AKE protocol named SAKE* for the IIoT environment, where two types of keys (i.e., a master key and an evolution key) guarantee PFS. In addition, the SAKE* protocol merely uses concatenation, XOR, and hash-function operations to achieve lightweight authentication, key exchange, and message integrity. We also compare the SAKE* protocol with seven current and IoT-related authentication protocols regarding security properties and performance. Comparison results indicate that the SAKE* protocol consumes the least computation resource and third-least communication cost among eight AKE protocols while equipping 12 security properties.
- Open Access
- 1 January 2022
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2022 (1)
A Lightweight Authenticated Searchable Encryption without Bilinear Pairing for Cloud Computing
Outsourcing data to cloud services is a good solution for users with limited computing resources. Privacy and confidentiality of data is jeopardized when data is transferred and shared in the cloud. The development of searchable cryptography offers the possibility to solve these problems. Symmetric searchable encryption (SSE) is popular among researchers because it is efficient and secure. SSE often requires the data sender and data receiver to use the same key to generate key ciphertext and trapdoor, which will obviously cause the problem of key management. Searchable encryption based on public key can simplify the key management problem. A public key encryption scheme with keyword search (PEKS) allows multiple senders to encrypt keywords under the receiver’s public key. It is vulnerable to keyword guessing attacks (KGA) due to the small size of the keywords. The proposal of public key authenticated encryption with keyword search (PAEKS) is mainly to resist inside keyword guessing attacks. The previous security models do not involve the indistinguishability of the same keywords (w0 × × = w1), which brings the user’s search pattern easy to leak. The essential reason is that the trapdoor generation algorithm is deterministic. At the same time, most of the existing schemes use bilinear pair design, which greatly reduces the efficiency of the scheme. To address these problems, the paper introduces an improved PAEKS model. We design a lightweight public key authentication encryption scheme based on the Diffie‐Hellman protocol. Then, we prove the ciphertext indistinguishability security and trapdoor indistinguishability security of the scheme in the improved security model. Finally, the paper demonstrates its comparable security and computational efficiency by comparing it with previous PAEKS schemes. Meanwhile, we conduct an experimental evaluation based on the cryptographic library. Experimental results show that the computational overhead of our scheme compared with the ciphertext generation algorithm, trapdoor generation algorithm and test algorithm of other schemes Our scheme reduces 274, 158 and 60 times, respectively.
- 1 January 2022
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2022 (1)
Open AccessA Lightweight Authenticated Searchable Encryption without Bilinear Pairing for Cloud Computing
Outsourcing data to cloud services is a good solution for users with limited computing resources. Privacy and confidentiality of data is jeopardized when data is transferred and shared in the cloud. The development of searchable cryptography offers the possibility to solve these problems. Symmetric searchable encryption (SSE) is popular among researchers because it is efficient and secure. SSE often requires the data sender and data receiver to use the same key to generate key ciphertext and trapdoor, which will obviously cause the problem of key management. Searchable encryption based on public key can simplify the key management problem. A public key encryption scheme with keyword search (PEKS) allows multiple senders to encrypt keywords under the receiver’s public key. It is vulnerable to keyword guessing attacks (KGA) due to the small size of the keywords. The proposal of public key authenticated encryption with keyword search (PAEKS) is mainly to resist inside keyword guessing attacks. The previous security models do not involve the indistinguishability of the same keywords (w0 × × = w1), which brings the user’s search pattern easy to leak. The essential reason is that the trapdoor generation algorithm is deterministic. At the same time, most of the existing schemes use bilinear pair design, which greatly reduces the efficiency of the scheme. To address these problems, the paper introduces an improved PAEKS model. We design a lightweight public key authentication encryption scheme based on the Diffie‐Hellman protocol. Then, we prove the ciphertext indistinguishability security and trapdoor indistinguishability security of the scheme in the improved security model. Finally, the paper demonstrates its comparable security and computational efficiency by comparing it with previous PAEKS schemes. Meanwhile, we conduct an experimental evaluation based on the cryptographic library. Experimental results show that the computational overhead of our scheme compared with the ciphertext generation algorithm, trapdoor generation algorithm and test algorithm of other schemes Our scheme reduces 274, 158 and 60 times, respectively.
- Open Access
- 1 January 2022
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 7 (9) , 17123-17132
An efficient relaxed shift-splitting preconditioner for a class of complex symmetric indefinite linear systems
In this work, by introducing a scalar matrix $ \alpha I $, we transform the complex symmetric indefinite linear systems $ (W+i T)x = b $ into a block two-by-two complex equations equivalently, and propose an efficient relaxed shift-splitting (ERSS) preconditioner. By adopting the relaxation technique, the ERSS preconditioner is not only a computational advantage but also closer to the original two-by-two of complex coefficient matrix. The eigenvalue distributions of the preconditioned matrix are analysed. An efficient and practical formula for computing the parameter value $ \alpha $ is also derived by computing the Frobenius norm of symmetric indefinite matrix $ T $. Numerical examples on a few model problems are illustrated to verify the performances of the ERSS preconditioner.- 1 January 2022
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 7 (9) , 17123-17132
Open AccessAn efficient relaxed shift-splitting preconditioner for a class of complex symmetric indefinite linear systems
In this work, by introducing a scalar matrix $ \alpha I $, we transform the complex symmetric indefinite linear systems $ (W+i T)x = b $ into a block two-by-two complex equations equivalently, and propose an efficient relaxed shift-splitting (ERSS) preconditioner. By adopting the relaxation technique, the ERSS preconditioner is not only a computational advantage but also closer to the original two-by-two of complex coefficient matrix. The eigenvalue distributions of the preconditioned matrix are analysed. An efficient and practical formula for computing the parameter value $ \alpha $ is also derived by computing the Frobenius norm of symmetric indefinite matrix $ T $. Numerical examples on a few model problems are illustrated to verify the performances of the ERSS preconditioner.