ABSTRACT
With the support of the random oracle model, numerous efficient and natural constructions have been proposed with provable security in the field of certificateless public-key encryption (CL-PKC). We begin by describing the first certificateless encryption (CLE) scheme invented by Al-Riyami and Paterson [17] in their seminar work based on bilinear pairing. We then introduce Zhang and Zhang’s [138] pairing-based certificateless signature (CLS) scheme, which is more efficient than the other existing CLS schemes secure against a super type I/II adversary. Finally, we focus on the construction of certificateless authenticated key agreement (CL-AKA) by formalizing the security model of two-party CL-AKA and describing an efficient and practical pairing-based CL-AKA protocol [21], where each party only needs to perform one pairing operation and five multiplications to share a session key.
