Identity-Based Encryption on RSA Without Pairings and Key Escrow  

作　　者：ZHU Yan WANG Shanbiao MA Di FENG Rongquan 

机构地区：[1]School of Computer and Communication Engineering, University of Science and Technology Beijing [2]School of Mathematical Sciences, Peking University [3]Department of Computer and Information Science, University of Michigan-Dearborn

出　　处：《Chinese Journal of Electronics》2014年第4期842-850,共9页电子学报（英文版）

基　　金：supported by the National Natural Science Foundation of China(No.61170264,No.61370187);the National Basic Research Program of China(973 Program)(No.2013CB329606)

摘　　要：We propose a new construction of identitybased 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 MII-INPwE 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 pairingfriendly elliptic-curve based IBE scheme.We propose a new construction of identitybased 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(MIHNPw E), which can be seen as a generalization of the modular inversion hidden number problem. We give an analysis on the hardness of MIHNPw E by lattice techniques. In our construction, we generate each user's partial private key in the form of an MIHNPw E instance. The hardness of MIHNPw E 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 pairingfriendly elliptic-curve based IBE scheme.

关 键 词：Identity-based encryption Key escrow Hidden number problem with error. 

分 类 号：TN918.4[电子电信—通信与信息系统]