Identity-Based Online/Offline Encryption Scheme from LWE
-
Published:2024-09-04
Issue:9
Volume:15
Page:539
-
ISSN:2078-2489
-
Container-title:Information
-
language:en
-
Short-container-title:Information
Author:
Zuo Binger1, Li Jiguo12, Zhang Yichen1, Shen Jian3
Affiliation:
1. College of Computer and Cyber Security, Fujian Normal University, Fuzhou 350117, China 2. Fujian Provincial Key Laboratory of Network Security and Cryptology, Fuzhou 350117, China 3. School of Information Science and Engineering, Zhejiang Sci-Tech University, Hangzhou 310018, China
Abstract
With quantum computers, the quantum resistance of cryptographic systems has gradually attracted attention. To overcome the shortcoming of existing identity-based encryption (IBE) schemes in resisting quantum attacks, we introduce an IBE scheme based on learning with errors (LWE). In addition, devices with limited computing power are becoming increasingly common in practice, making it increasingly important to improve the efficiency of online computation of encryption algorithms. The classic solution is to directly improve the efficiency of the Gaussian sampling algorithm, thereby increasing the overall efficiency of the scheme. However, our scheme combines the efficient Gaussian sampling algorithm, G-trapdoor, with online/offline method to further improve the online encryption efficiency of the encryption algorithm. Our scheme completes partial computation before knowing the message and receiver’s identity, and once the message and receiver’s identity are obtained, the online part encryption can be efficiently completed. We construct an identity-based online/offline encryption (IBOOE) scheme from LWE with G-trapdoor, improve the efficiency of online encryption while achieving quantum resistant security. We prove the scheme’s security under the standard model for chosen-plaintext attack (CPA). By comparing with relevant schemes in terms of experiments and analysis, our scheme has improved efficiency by 65% to 80% compared to the classical LWE IBE scheme (increasing with LWE security parameters), and by 60% to 70% compared to the recent IBE scheme from LWE. This greatly improves the efficiency of online computing for low-power encryption devices while ensuring security.
Funder
National Natural Science Foundation of China
Reference31 articles.
1. Gentry, C., Peikert, C., and Vaikuntanathan, V. (2008, January 17–20). Trapdoors for Hard Lattices and New Cryptographic Constructions. Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, Victoria, BC, Canada. 2. Bonsai Trees, or How to Delegate a Lattice Basis;Cash;J. Cryptol.,2012 3. Efficient Lattice (H)IBE in the Standard Model;Agrawal;Advances in Cryptology–EUROCRYPT 2010, Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, France, 30 May–3 June 2010,2010 4. Zhang, Y., Liu, Y., Guo, Y., Zheng, S., and Wang, L. (2020). Adaptively Secure Efficient (H)IBE over Ideal Lattice with Short Parameters. Entropy, 22. 5. On Lattices, Learning with Errors, Random Linear Codes, and Cryptography;Regev;J. ACM (JACM),2009
|
|