{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,16]],"date-time":"2025-11-16T05:16:03Z","timestamp":1763270163595,"version":"3.45.0"},"reference-count":26,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T00:00:00Z","timestamp":1763078400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62372266","62472251"],"award-info":[{"award-number":["62372266","62472251"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Revocable Identity-Based Encryption (RIBE) can dynamically revoke users whose secret keys have been compromised, ensuring a system\u2019s backward security. An RIBE scheme with decryption key exposure resistance (DKER) guarantees the confidentiality of ciphertext during any time period where the decryption key remains undisclosed. Existing RIBE schemes with DKER generate O(rlog(N\/r)) ciphertexts for each plaintext message. Redundant ciphertexts impose significant computational burdens on users and substantial communication overhead on the system. To reduce high computation and communication overhead in existing schemes, this paper proposes a dual-key combination trapdoor generation method. Based on the proposed method, an indirect RIBE scheme with DKER is constructed, reducing ciphertext redundancy and obtaining computation and communication efficiency. Firstly, this paper proposes a dual-key combination trapdoor generation mechanism. By constructing an Inhomogeneous Small Integer Solution (ISIS) instance, the Key Generation Center (KGC) generates and distributes short bases to users as their identity keys. Subsequently, based on the constructed ISIS instance, a new inverse ISIS instance is derived. Furthermore, during each time period, KGC generates short bases for all non-revoked users as their time keys. By linearly combining their identity key with the corresponding time key, every non-revoked user can derive a re-randomized decryption key, achieving controlled key derivation. Secondly, based on the proposed method, a Post-Quantum Secure, Lightweight RIBE scheme with DKER (PQS-LRIBE-DKER) is constructed. For every non-revoked user, their identity key and time key serve as their own user secret key and key update, respectively. Controllable key derivation enables indirect revocation of the scheme. By adopting an indirect revocation, the PQS-LRIBE-DKER scheme achieves a single ciphertext per plaintext message, significantly reducing the sender\u2019s computational load and the system\u2019s communication overhead. Finally, under the hardness assumptions of the Learning with Errors (LWE) and ISIS problems, we prove that the proposed scheme achieves selective identity security in the standard model.<\/jats:p>","DOI":"10.3390\/e27111160","type":"journal-article","created":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T16:46:22Z","timestamp":1763138782000},"page":"1160","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Post-Quantum Secure Lightweight Revocable IBE with Decryption Key Exposure Resistance"],"prefix":"10.3390","volume":"27","author":[{"given":"Dandan","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer Science, Qufu Normal University, Rizhao 276800, China"}]},{"given":"Hongwei","family":"Ju","sequence":"additional","affiliation":[{"name":"Experimental Teaching and Equipment Management Center, Qufu Normal University, Rizhao 276800, China"}]},{"given":"Zixuan","family":"Yan","sequence":"additional","affiliation":[{"name":"School of Computer Science, Qufu Normal University, Rizhao 276800, China"}]},{"given":"Shanqiang","family":"Feng","sequence":"additional","affiliation":[{"name":"School of Computer Science, Qufu Normal University, Rizhao 276800, China"}]},{"given":"Fengyin","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science, Qufu Normal University, Rizhao 276800, China"}]}],"member":"1968","published-online":{"date-parts":[[2025,11,14]]},"reference":[{"key":"ref_1","unstructured":"Shamir, A. (1984, January 19\u201322). Identity-Based Cryptosystems and Signature Schemes. Proceedings of the International Cryptology Conference, Santa Barbara, CA, USA."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Boneh, D., and Franklin, M. (2001, January 19\u201323). Identity-Based Encryption from the Weil Pairing. Proceedings of the International Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.1007\/3-540-44647-8_13"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Boldyreva, A., Goyal, V., and Kumar, V. (2008, January 27\u201331). Identity-based encryption with efficient revocation. Proceedings of the ACM Conference on Computer and Communications Security, Alexandria, VA, USA.","DOI":"10.1145\/1455770.1455823"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Chen, J., Lim, H.W., Ling, S., Wang, H., and Nguyen, K. (2012, January 9\u201311). Revocable Identity-Based Encryption from Lattices. Proceedings of the Australasian Conference on Information Security and Privacy, Sydney, Australia.","DOI":"10.1007\/978-3-642-31448-3_29"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Seo, J.H., and Emura, K. (2013, January 26\u201328). Revocable Identity-Based Encryption Revisited: Security Model and Construction. Proceedings of the International Workshop on Public Key Cryptography, Nara, Japan.","DOI":"10.1007\/978-3-642-36362-7_14"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Wang, Q., Huang, H., Li, J., and Yuan, Q. (2023, January 25\u201329). Revocable IBE with En-DKER from Lattices: A Novel Approach for Lattice Basis Delegation. Proceedings of the European Symposium on Research in Computer Security, Hague, The Netherlands.","DOI":"10.1007\/978-3-031-50594-2_4"},{"key":"ref_7","unstructured":"Agrawal, S., Boneh, D., and Boyen, X. (June, January 30). Efficient Lattice (H)IBE in the Standard Model. Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, Nice, France."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Libert, B., Ling, S., Nguyen, K., and Wang, H. (2016, January 4\u20138). Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors. Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, Hanoi, Vietnam.","DOI":"10.1007\/978-3-662-49896-5_1"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Nguyen, K., Wang, H., and Zhang, J. (2016, January 8\u201310). Server-Aided Revocable Identity-Based Encryption from Lattices. Proceedings of the International Conference on Cryptology and Network Security, Milan, Italy.","DOI":"10.1007\/978-3-319-48965-0_7"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Liu, X., Hu, Y., and Jia, H. (2021, January 1\u20133). Revocable Identity-Based Encryption with Server-Aided Ciphertext Evolution from Lattices. Proceedings of the International Conference on Information Security and Cryptology, Seoul, Republic of Korea.","DOI":"10.1007\/978-3-030-88323-2_24"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Liu, X., Hu, Y., and Jia, H. (2021, January 26\u201328). Cloud-Aided Scalable Revocable Identity-Based Encryption with Ciphertext Update from Lattices. Proceedings of the International Conference on Frontiers in Cyber Security, Haikou, China.","DOI":"10.1007\/978-981-19-0523-0_18"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"e7735","DOI":"10.1002\/cpe.7735","article-title":"An efficient revocable identity-based encryption with ciphertext evolution in the cloud-assisted system","volume":"35","author":"Chen","year":"2023","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Huang, J.-J., Chen, G.-Y., and Lo, N.-W. (2024, January 14\u201318). Poster: Post-Quantum Identity-Based Matching Encryption with Revocable Decryption Key. Proceedings of the ACM SIGSAC Conference on Computer and Communications Security, Salt Lake City, UT, USA.","DOI":"10.1145\/3658644.3691397"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Nishimura, T., and Takayasu, A. (2025, January 14\u201316). Efficient Revocable Identity-Based Encryption from Middle-Product LWE. Proceedings of the Australasian Conference on Information Security and Privacy, Wollongong, Australia.","DOI":"10.1007\/978-981-96-9098-5_4"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Takayasu, A., and Watanabe, Y. (2017, January 11\u201313). Lattice-Based Revocable Identity-Based Encryption with Bounded Decryption Key Exposure Resistance. Proceedings of the Australasian Conference on Information Security and Privacy, Auckland, New Zealand.","DOI":"10.1007\/978-3-319-60055-0_10"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Katsumata, S., Matsuda, T., and Takayasu, A. (2019, January 14\u201317). Lattice-Based Revocable (Hierarchical) IBE with Decryption Key Exposure Resistance. Proceedings of the IACR International Workshop on Public Key Cryptography, Beijing, China.","DOI":"10.1007\/978-3-030-17259-6_15"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Huang, H., Li, J., Bi, S., and Yuan, Q. (2025). An efficient lattice-based integrated revocable identity-based encryption. Sci. Rep., 15.","DOI":"10.1038\/s41598-025-01254-1"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Xia, F., Mao, J., Shao, Z., Xu, L., Zhao, R., and Yang, Y. (2021, January 19\u201323). An Authentication Mechanism for IoT Devices Based on Traceable and Revocable Identity-Based Encryption. Proceedings of the International Conference on Artificial Intelligence and Security, virtual.","DOI":"10.1007\/978-3-030-78612-0_44"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Wang, C., Han, Y., Duan, X., and Guo, K. (2021, January 17\u201320). Hierarchical Identity-Based Conditional Proxy Re-encryption Scheme Based RLWE and NTRU Variant. Proceedings of the International Conference of Pioneering Computer Scientists, Engineers and Educators, Taiyuan, China.","DOI":"10.1007\/978-981-16-5943-0_20"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Okano, Y., Tomida, J., Nagai, A., Yoneyama, K., Fujioka, A., and Suzuki, K. (2021, January 1\u20133). Revocable Hierarchical Identity-Based Authenticated Key Exchange. Proceedings of the International Conference on Information Security and Cryptology, Seoul, Republic of Korea.","DOI":"10.1007\/978-3-031-08896-4_1"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"15319","DOI":"10.1109\/JIOT.2025.3527556","article-title":"Revocable-Hierarchical-Identity-Based Inner Product Function Encryption in Smart Healthcare","volume":"12","author":"Zhu","year":"2025","journal-title":"IEEE Internet Things J."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Asharov, G., Jain, A., L\u00f3pez-Alt, A., Tromer, E., Vaikuntanathan, V., and Wichs, D. (2012, January 15\u201319). Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE. Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK.","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Regev, O. (2005, January 22\u201324). On lattices, learning with errors, random linear codes, and cryptography. Proceedings of the ACM Symposium on Theory of Computing, Baltimore, MD, USA.","DOI":"10.1145\/1060590.1060603"},{"key":"ref_24","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 ACM Symposium on Theory of Computing, Victoria, BC, Canada.","DOI":"10.1145\/1374376.1374407"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.tcs.2021.02.024","article-title":"Efficient revocable identity-based encryption with short public parameters","volume":"863","author":"Keita","year":"2021","journal-title":"Theor. Comput. Sci."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Liu, X., and Hu, Y. (2022, January 10\u201312). Simplified Server-Aided Revocable Identity-Based Encryption from Lattices. Proceedings of the International Conference on Provable Security, Chongqing, China.","DOI":"10.1007\/978-3-031-20917-8_6"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/27\/11\/1160\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,16]],"date-time":"2025-11-16T05:12:16Z","timestamp":1763269936000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/27\/11\/1160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,14]]},"references-count":26,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2025,11]]}},"alternative-id":["e27111160"],"URL":"https:\/\/doi.org\/10.3390\/e27111160","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2025,11,14]]}}}