Constructing Efficient Certificateless Public Key Encryption with Pairing

Abstract

Certificateless public key cryptography was introduced to overcome the key escrow limitation of the identity-based cryptography. Recently, Yum1 and Lee have proposed a generic series construction model of certificateless public key encryption (CL-PKE). However, this model pays much attention on the generic construction and neglects the properties of the pairings. In this paper we propose a CL-PKE scheme which is based on the nice algebraic properties of the pairing. The scheme breaks through the old series model and works in an efficient parallel model. Our scheme is more efficient on computation and has more compact ciphertext than the existing schemes.