New Provable Security CL-PKE Encryption Scheme in the Standard Model
Yang Yong · Dianzi Ke-ji Daxue xuebao · 2010
A certificateless public key encryption(CL-PKE) algorithm is presented.The proposed CL-PKE algorithm is based on the nature BDHP difficulty assumption and therefore avoids paring computation on elliptic curves,which is the most expensive operation in the encryption algorithm.In CL-PKE algorithm,the selective-ID model is applied instead of the random oracle model.The security and efficiency of the algorithm can be improved compared with some other CL-PKE schemes.