Identity-Based Encryption on RSA Without Pairings and Key Escrow

作     者：Yan Zhu Shanbiao Wang Di Ma Rongquan Feng 

作者机构：School of Computer and Communication Engineering University of Science and Technology Beijing Beijing China School of Mathematical Sciences Peking University Beijing China Department of Computer and Information Science University of Michigan-Dearborn Michigan USA 

出 版 物：《Chinese Journal of Electronics》 

年 卷 期：2025年第23卷第4期

页      面：842-850页

基　　金：National Natural Science Foundation of China National Basic Research Program of China (973 Program) 

主　　题：Resistance Identity-based encryption Prototypes Lattices Computational efficiency Cryptography 

摘      要：We propose a new construction of identity-based encryption without key escrow over the tradition RSA cryptosystems. The security of our scheme follows from the decisional Diffie-Hellman assumption and the difficulty of Modular inversion hidden number problem with error (MIHNPwE), which can be seen as a generalization of the modular inversion hidden number problem. We give an analysis on the hardness of MIHNPwE by lattice techniques. In our construction, we generate each user s partial private key in the form of an MIHNPwE instance. The hardness of MIHNPwE provides our scheme with resistance against key-collusion attacks from any number of traitors. Our prototype implementation of the proposed scheme shows that it can be more computation efficient and easy-to-implementation than the influential pairing-friendly elliptic-curve based IBE scheme.