Juntao Gao
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
Juntao Gao has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
Xuelian Li
9 shared publications- Xuelian Li
School of Mathematics and Statistics, XiDian University, Xi’an, China
7 shared publications - Baocang Wang
The State Key Laboratory of Integrated Service Networks, Xidian University, Xi’an 710071, China
5 shared publications Haiyong Yu
State Key Laboratory of Integrated Services Networks, Xidian University, Xi’an, China
3 shared publications- Hui Li
School of Mathematics and Statistics, XiDian University, Xi’an, China
2 shared publications - Li Xuelian
School of Mathematics and Statistics, XiDian University, Xi’an, China
2 shared publications
Latest Publications
- Open Access
- 11 March 2024
- Published by Elsevier in Journal of Information and Intelligence
- Vol. 2 (3) , 236-252
A new lattice-based partially blind signature with more complete proof
- 11 March 2024
- Published by Elsevier in Journal of Information and Intelligence
- Vol. 2 (3) , 236-252
Open AccessA new lattice-based partially blind signature with more complete proof
- Open Access
- 24 January 2024
- Published by Springer Nature in Research Square
Quantum Nested Search for Lattice Enumeration
Lattice-based cryptographic regimes are the most promising quantum-resistant cryptographic algorithms, whose security depends on the difficulty of the SVP. Enumeration algorithms are the most basic and hopeful algorithms instantiated for solving SVPs, and are often used in public key cryptanalysis or as subroutines of lattice reduction algorithms. In this paper, we show how to speed up enumeration with the idea of nested search: if N is the number of nodes in the enumeration tree and T is the time required to process a node, our quantum enumeration can find the shortest vector on the lattice in time \(\sqrt{T\cdot N}\) . This is applied to the two most efficient types of enumeration: cylinder pruning as well as discrete pruning. The core idea of the algorithm is to reduce the size of the search space by transforming the original problem into a constraint-satisfiable problem, using the pruning conditions of the above two enumerations as constraints, and embedding the search for all possible solutions at the next level of the enumeration tree into the space of partially satisfied solutions at the previous level. Next, we accelerate this process using a quantum search algorithm. Compared to the work of bib24, we further reduce the time complexity of the algorithm with multiplication factor $\sqrt{T} $ by the quantum nested search algorithm.- 24 January 2024
- Published by Springer Nature in Research Square
Open AccessQuantum Nested Search for Lattice Enumeration
Lattice-based cryptographic regimes are the most promising quantum-resistant cryptographic algorithms, whose security depends on the difficulty of the SVP. Enumeration algorithms are the most basic and hopeful algorithms instantiated for solving SVPs, and are often used in public key cryptanalysis or as subroutines of lattice reduction algorithms. In this paper, we show how to speed up enumeration with the idea of nested search: if N is the number of nodes in the enumeration tree and T is the time required to process a node, our quantum enumeration can find the shortest vector on the lattice in time \(\sqrt{T\cdot N}\) . This is applied to the two most efficient types of enumeration: cylinder pruning as well as discrete pruning. The core idea of the algorithm is to reduce the size of the search space by transforming the original problem into a constraint-satisfiable problem, using the pruning conditions of the above two enumerations as constraints, and embedding the search for all possible solutions at the next level of the enumeration tree into the space of partially satisfied solutions at the previous level. Next, we accelerate this process using a quantum search algorithm. Compared to the work of bib24, we further reduce the time complexity of the algorithm with multiplication factor $\sqrt{T} $ by the quantum nested search algorithm. - 15 December 2023
- Published by Springer Nature in Quantum Information Processing
- Vol. 22 (12) , 1-35
A polynomial system for bit-based division property solving by quantum algorithm
- 15 December 2023
- Published by Springer Nature in Quantum Information Processing
- Vol. 22 (12) , 1-35
A polynomial system for bit-based division property solving by quantum algorithm
- Open Access
- 7 August 2023
- Published by Institution of Engineering and Technology (IET) in IET Blockchain
- Vol. 4 (1) , 1-17
Optimized byzantine fault tolerant algorithm for improving performance and security with trust values
Blockchain is considered to be a promising technology due to its decentralization, open, and non tamperation. Nevertheless, the current blockchain system cannot replace traditional financial institutions because its performance and security indicators in the consensus algorithm are not perfect. As one of the emerging capacity expansion technologies, sharding technology improves throughput by grouping users and processing transactions in parallel. This paper proposes an improved Byzantine Fault Tolerance algorithm TV‐BRAFT. TV‐BRAFT calculates a trust value for each user through an incentive mechanism. The sharding scheme based on the trust value is adopted to reduce the probability of malicious nodes being allocated to the same partition, thus improving the security of the system. In the consensus, the system selects users with qualified trust values to form a verification group to supervise the consensus process and avoid submitting error transactions to the blockchain. In order to prove that the TV‐BRAFT can resist Byzantine attacks, a recursive formula is used to prove the security of sharding and the security of consensus within one shard. Finally, the simulation results show that the TV‐BRAFT not only guarantees the fairness of incentives but is also better than the Raft and PBFT algorithms in efficiency and throughput.
- 7 August 2023
- Published by Institution of Engineering and Technology (IET) in IET Blockchain
- Vol. 4 (1) , 1-17
Open AccessOptimized byzantine fault tolerant algorithm for improving performance and security with trust values
Blockchain is considered to be a promising technology due to its decentralization, open, and non tamperation. Nevertheless, the current blockchain system cannot replace traditional financial institutions because its performance and security indicators in the consensus algorithm are not perfect. As one of the emerging capacity expansion technologies, sharding technology improves throughput by grouping users and processing transactions in parallel. This paper proposes an improved Byzantine Fault Tolerance algorithm TV‐BRAFT. TV‐BRAFT calculates a trust value for each user through an incentive mechanism. The sharding scheme based on the trust value is adopted to reduce the probability of malicious nodes being allocated to the same partition, thus improving the security of the system. In the consensus, the system selects users with qualified trust values to form a verification group to supervise the consensus process and avoid submitting error transactions to the blockchain. In order to prove that the TV‐BRAFT can resist Byzantine attacks, a recursive formula is used to prove the security of sharding and the security of consensus within one shard. Finally, the simulation results show that the TV‐BRAFT not only guarantees the fairness of incentives but is also better than the Raft and PBFT algorithms in efficiency and throughput.
- 3 June 2023
- Published by Springer Nature in Quantum Information Processing
- Vol. 22 (6) , 1-31
Allocating rotational cryptanalysis-based preimage attack on 4-round Keccak-224 for quantum setting
- 3 June 2023
- Published by Springer Nature in Quantum Information Processing
- Vol. 22 (6) , 1-31
Allocating rotational cryptanalysis-based preimage attack on 4-round Keccak-224 for quantum setting
- Open Access
- 11 March 2023
- Published by Springer Nature in Journal of Cloud Computing
- Vol. 12 (1) , 1-15
Efficient lattice-based revocable attribute-based encryption against decryption key exposure for cloud file sharing
Cloud file sharing (CFS) has become one of the important tools for enterprises to reduce technology operating costs and improve their competitiveness. Due to the untrustworthy cloud service provider, access control and security issues for sensitive data have been key problems to be addressed. Current solutions to these issues are largely related to the traditional public key cryptography, access control encryption or attribute-based encryption based on the bilinear mapping. The rapid technological advances in quantum algorithms and quantum computers make us consider the transition from the tradtional cryptographic primitives to the post-quantum counterparts. In response to these problems, we propose a lattice-based Ciphertext-Policy Attribute-Based Encryption(CP-ABE) scheme, which is designed based on the ring learing with error problem, so it is more efficient than that designed based on the learing with error problem. In our scheme, the indirect revocation and binary tree-based data structure are introduced to achieve efficient user revocation and dynamic management of user groups. At the same time, in order to further improve the efficiency of the scheme and realize file sharing across enterprises, the scheme also allows multiple authorities to jointly set up system parameters and manage distribute keys. Furthermore, by re-randomizing the user’s private key and update key, we achieve decryption key exposure resistance(DKER) in the scheme. We provide a formal security model and a series of security experiments, which show that our scheme is secure under chosen-plaintext attacks. Experimental simulations and evaluation analyses demonstrate the high efficiency and practicality of our scheme.
- 11 March 2023
- Published by Springer Nature in Journal of Cloud Computing
- Vol. 12 (1) , 1-15
Open AccessEfficient lattice-based revocable attribute-based encryption against decryption key exposure for cloud file sharing
Cloud file sharing (CFS) has become one of the important tools for enterprises to reduce technology operating costs and improve their competitiveness. Due to the untrustworthy cloud service provider, access control and security issues for sensitive data have been key problems to be addressed. Current solutions to these issues are largely related to the traditional public key cryptography, access control encryption or attribute-based encryption based on the bilinear mapping. The rapid technological advances in quantum algorithms and quantum computers make us consider the transition from the tradtional cryptographic primitives to the post-quantum counterparts. In response to these problems, we propose a lattice-based Ciphertext-Policy Attribute-Based Encryption(CP-ABE) scheme, which is designed based on the ring learing with error problem, so it is more efficient than that designed based on the learing with error problem. In our scheme, the indirect revocation and binary tree-based data structure are introduced to achieve efficient user revocation and dynamic management of user groups. At the same time, in order to further improve the efficiency of the scheme and realize file sharing across enterprises, the scheme also allows multiple authorities to jointly set up system parameters and manage distribute keys. Furthermore, by re-randomizing the user’s private key and update key, we achieve decryption key exposure resistance(DKER) in the scheme. We provide a formal security model and a series of security experiments, which show that our scheme is secure under chosen-plaintext attacks. Experimental simulations and evaluation analyses demonstrate the high efficiency and practicality of our scheme.
- 9 March 2023
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 74
Privacy preserving via multi-key homomorphic encryption in cloud computing
- 9 March 2023
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 74
Privacy preserving via multi-key homomorphic encryption in cloud computing
- 29 September 2022
- Published by Springer Nature
- p. 342-357
Multi-hop Multi-key Homomorphic Encryption with Less Noise Under CRS Model
- 29 September 2022
- Published by Springer Nature
- p. 342-357
Multi-hop Multi-key Homomorphic Encryption with Less Noise Under CRS Model
- 1 January 2022
- Published by Elsevier in Ad Hoc Networks
- Vol. 124
A secure and efficient certificateless signature scheme for Internet of Things
- 1 January 2022
- Published by Elsevier in Ad Hoc Networks
- Vol. 124
A secure and efficient certificateless signature scheme for Internet of Things
- 15 October 2021
- Published by Springer Nature in Quantum Information Processing
- Vol. 20 (10) , 1-22
Quantum security of Grain-128/Grain-128a stream cipher against HHL algorithm
- 15 October 2021
- Published by Springer Nature in Quantum Information Processing
- Vol. 20 (10) , 1-22
Quantum security of Grain-128/Grain-128a stream cipher against HHL algorithm