{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T17:31:28Z","timestamp":1778866288201,"version":"3.51.4"},"reference-count":31,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T00:00:00Z","timestamp":1725408000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Natural Science Foundation of China","award":["62072104"],"award-info":[{"award-number":["62072104"]}]},{"name":"National Natural Science Foundation of China","award":["U21A20465"],"award-info":[{"award-number":["U21A20465"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>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\u2019s identity, and once the message and receiver\u2019s 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\u2019s 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.<\/jats:p>","DOI":"10.3390\/info15090539","type":"journal-article","created":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T08:46:22Z","timestamp":1725439582000},"page":"539","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Identity-Based Online\/Offline Encryption Scheme from LWE"],"prefix":"10.3390","volume":"15","author":[{"given":"Binger","family":"Zuo","sequence":"first","affiliation":[{"name":"College of Computer and Cyber Security, Fujian Normal University, Fuzhou 350117, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiguo","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer and Cyber Security, Fujian Normal University, Fuzhou 350117, China"},{"name":"Fujian Provincial Key Laboratory of Network Security and Cryptology, Fuzhou 350117, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yichen","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Computer and Cyber Security, Fujian Normal University, Fuzhou 350117, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Shen","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, Zhejiang Sci-Tech University, Hangzhou 310018, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2024,9,4]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., and Vaikuntanathan, V. (2008, January 17\u201320). Trapdoors for Hard Lattices and New Cryptographic Constructions. Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, Victoria, BC, Canada.","DOI":"10.1145\/1374376.1374407"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1007\/s00145-011-9105-2","article-title":"Bonsai Trees, or How to Delegate a Lattice Basis","volume":"25","author":"Cash","year":"2012","journal-title":"J. Cryptol."},{"key":"ref_3","first-page":"553","article-title":"Efficient Lattice (H)IBE in the Standard Model","volume":"Volume 6110","author":"Agrawal","year":"2010","journal-title":"Advances in Cryptology\u2013EUROCRYPT 2010, Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, France, 30 May\u20133 June 2010"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.3390\/e22111247"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1568318.1568324","article-title":"On Lattices, Learning with Errors, Random Linear Codes, and Cryptography","volume":"56","author":"Regev","year":"2009","journal-title":"J. ACM (JACM)"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1550014","DOI":"10.1142\/S0219749915500148","article-title":"Secure Identity-based Encryption in the Quantum Random Oracle Model","volume":"13","author":"Zhandry","year":"2015","journal-title":"Int. J. Quantum Inf."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s00145-020-09371-y","article-title":"Tighter Security Proofs for GPV-IBE in the Quantum Random Oracle Model","volume":"34","author":"Katsumata","year":"2021","journal-title":"J. Cryptol."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Gao, W., Yang, L., Zhang, D., and Liu, X. (2022). Quantum Identity-based Encryption from the Learning with Errors Problem. Cryptography, 6.","DOI":"10.3390\/cryptography6010009"},{"key":"ref_9","unstructured":"Dutta, P., Susilo, W., Duong, D.H., Baek, J., and Roy, P.S. (2020). Lattice-based Unidirectional IBPRE Secure in Standard Model. arXiv."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/s12652-021-02911-9","article-title":"IB-VPRE: Adaptively Secure Identity-based Proxy Re-encryption Scheme from LWE with Re-encryption Verifiability","volume":"13","author":"Wu","year":"2022","journal-title":"J. Ambient. Intell. Humaniz. Comput."},{"key":"ref_11","first-page":"73","article-title":"Generic Construction of Server-aided Revocable Hierarchical Identity-based Encryption","volume":"12612","author":"Liu","year":"2020","journal-title":"Int. Conf. Inf. Secur. Cryptol."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1066","DOI":"10.1093\/comjnl\/bxv128","article-title":"A Leakage-Resilient CCA-Secure Identity-Based Encryption Scheme","volume":"59","author":"Li","year":"2016","journal-title":"Comput. J."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1016","DOI":"10.1002\/sec.1396","article-title":"Provably Secure Identity-based Encryption Resilient to Post-challenge Continuous Auxiliary Input Leakage","volume":"9","author":"Li","year":"2016","journal-title":"Secur. Commun. Netw."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ins.2017.11.008","article-title":"Identity-based Broadcast Encryption with Continuous Leakage Resilience","volume":"429","author":"Li","year":"2018","journal-title":"Inf. Sci."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"6849761","DOI":"10.1155\/2022\/6849761","article-title":"Hierarchical Identity-Based Online\/Offline Encryption Scheme with Leakage Resilience","volume":"2022","author":"Yu","year":"2022","journal-title":"Secur. Commun. Netw."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-3-030-90456-2_6","article-title":"Ring-based Identity Based Encryption\u2013Asymptotically Shorter MPK and Tighter Security","volume":"Volume 13044","author":"Abla","year":"2021","journal-title":"Theory of Cryptography: 19th International Conference, TCC, Raleigh, NC, USA, 8\u201311 November 2021"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Fan, J., Lu, X., and Au, M.H. (2023, January 5\u20137). Adaptively Secure Identity-Based Encryption from Middle-Product Learning with Errors. Proceedings of the Australasian Conference on Information Security and Privacy, Brisbane, QLD, Australia.","DOI":"10.1007\/978-3-031-35486-1_15"},{"key":"ref_18","first-page":"498","article-title":"New Lattice Two-Stage Sampling Technique and Its Applications to Functional Encryption \u2013 Stronger Security and Smaller Ciphertexts","volume":"Volume 12696","author":"Lai","year":"2021","journal-title":"Advances in Cryptology\u2014EUROCRYPT 2021, Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, 17\u201321 October 2021"},{"key":"ref_19","first-page":"65","article-title":"Instantiating Treeless Signature Schemes","volume":"2013","author":"Weiden","year":"2013","journal-title":"Cryptol. ePrint Arch."},{"key":"ref_20","first-page":"738","article-title":"Lattice Signatures without Trapdoors","volume":"Volume 7237","author":"Lyubashevsky","year":"2012","journal-title":"Advances in Cryptology\u2014EUROCRYPT 2012, Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, 15\u201319 April 2012"},{"key":"ref_21","first-page":"700","article-title":"Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller","volume":"Volume 7237","author":"Micciancio","year":"2012","journal-title":"Advances in Cryptology\u2014EUROCRYPT 2012, Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, 15\u201319 April 2012"},{"key":"ref_22","first-page":"455","article-title":"Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time","volume":"Volume 10402","author":"Micciancio","year":"2017","journal-title":"Advances in Cryptology\u2013CRYPTO 2017, Proceedings of the 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, 20\u201324 August 2017"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1186\/s42400-022-00113-0","article-title":"Generic, Efficient and Isochronous Gaussian Sampling over the Integers","volume":"5","author":"Sun","year":"2022","journal-title":"Cybersecurity"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/978-3-540-85230-8_22","article-title":"Identity-based Online\/Offline Encryption","volume":"5143","author":"Guo","year":"2008","journal-title":"Financ. Cryptogr. Data Secur."},{"key":"ref_25","first-page":"177","article-title":"On the Amortized Complexity of Zero-Knowledge Protocols","volume":"Volume 5677","author":"Cramer","year":"2009","journal-title":"Advances in Cryptology, Proceedings of the Annual International Cryptology Conference 2009, Santa Barbara, CA, USA, 16\u201320 August 2009"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2710016","article-title":"Sampling Exactly from the Normal Distribution","volume":"42","author":"Karney","year":"2016","journal-title":"Acm Trans. Math. Softw. (TOMS)"},{"key":"ref_27","first-page":"3","article-title":"Approximate Trapdoors for Lattices and Smaller Hash-and-sign Signatures","volume":"Volume 11923","author":"Chen","year":"2019","journal-title":"Advances in Cryptology\u2013ASIACRYPT 2019, Proceedings of the 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, 8\u201312 December 2019"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"10441","DOI":"10.1109\/JIOT.2023.3325996","article-title":"Efficient Revocable Attribute-based Encryption with Verifiable Data Integrity","volume":"11","author":"Chen","year":"2024","journal-title":"IEEE Internet Things J."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/TC.2020.3043950","article-title":"Efficient CP-ABE Scheme with Shared Decryption in Cloud Storage","volume":"71","author":"Chen","year":"2022","journal-title":"IEEE Trans. Comput."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1109\/TCC.2020.2975184","article-title":"Attribute Based Encryption with Privacy Protection and Accountability for CloudIoT","volume":"10","author":"Li","year":"2022","journal-title":"IEEE Trans. Cloud Comput."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.ins.2022.03.081","article-title":"Key Escrow-free Attribute Based Encryption with User Revocation","volume":"600","author":"Zhang","year":"2022","journal-title":"Inf. Sci."}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/15\/9\/539\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T15:48:32Z","timestamp":1760111312000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/15\/9\/539"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,4]]},"references-count":31,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2024,9]]}},"alternative-id":["info15090539"],"URL":"https:\/\/doi.org\/10.3390\/info15090539","relation":{},"ISSN":["2078-2489"],"issn-type":[{"value":"2078-2489","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,4]]}}}