Jing Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jing Zhao has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Hao Yuan
Faculty of Communication and Electronic Engineering, Qiqihar University, Qiqihar, China
1 shared publication - Meitong Zhou
Faculty of Communication and Electronic Engineering, Qiqihar University, Qiqihar 161000, China
1 shared publication - Qi Yuan
College of Telecommunication and Electronic Engineering, Qiqihar University, Qiqihar 161006, China
1 shared publication - Shuo Zhao
Network Information Center, Qiqihar University, Qiqihar 161006, China
1 shared publication - Yanchun Wang
School of Communication and Electronic Engineering, Qiqihar University, Qiqihar, People’s Republic of China
1 shared publication - Yue Shao
State Grid Information Communication Branch, Beijing 100032, China
1 shared publication
Latest Publications
- Open Access
Distributed Identity Authentication with Lenstra–Lenstra–Lovász Algorithm–Ciphertext Policy Attribute-Based Encryption from Lattices: An Efficient Approach Based on Ring Learning with Errors Problem
In recent years, research on attribute-based encryption (ABE) has expanded into the quantum domain. Because a traditional single authority can cause the potential single point of failure, an improved lattice-based quantum-resistant identity authentication and policy attribute encryption scheme is proposed, in which the generation of random values is optimized by adjusting parameters in the Gaussian sampling algorithm to improve overall performance. Additionally, in the key generation phase, attributes are processed according to their shared nature, which reduces the computational overhead of the authorization authority. In the decryption phase, the basis transformation of the Lenstra–Lenstra–Lovász (LLL) lattice reduction algorithm is utilized to rapidly convert shared matrices into the shortest vector form, which can reduce the computational cost of linear space checks. The experimental results demonstrate that the proposed method not only improves efficiency but also enhances security compared with related schemes.
Open AccessDistributed Identity Authentication with Lenstra–Lenstra–Lovász Algorithm–Ciphertext Policy Attribute-Based Encryption from Lattices: An Efficient Approach Based on Ring Learning with Errors Problem
In recent years, research on attribute-based encryption (ABE) has expanded into the quantum domain. Because a traditional single authority can cause the potential single point of failure, an improved lattice-based quantum-resistant identity authentication and policy attribute encryption scheme is proposed, in which the generation of random values is optimized by adjusting parameters in the Gaussian sampling algorithm to improve overall performance. Additionally, in the key generation phase, attributes are processed according to their shared nature, which reduces the computational overhead of the authorization authority. In the decryption phase, the basis transformation of the Lenstra–Lenstra–Lovász (LLL) lattice reduction algorithm is utilized to rapidly convert shared matrices into the shortest vector form, which can reduce the computational cost of linear space checks. The experimental results demonstrate that the proposed method not only improves efficiency but also enhances security compared with related schemes.