We make concrete the concept of CL-PKC by introducing certificateless public key encryption (CL-PKE), signature and key exchange schemes. We also demonstrate how hierarchical CL-PKC can be supported. The schemes are all derived from pairings on elliptic curves. The lack of certificates and the desire to prove the schemes secure in the presence of an adversary who has access to the master key requires the careful development of new security models. For reasons of brevity, the focus in this paper is on the security of CL-PKE. We prove that our CL-PKE scheme is secure in a fully adaptive adversarial model, provided that an underlying problem closely related to the Bilinear Diffie-Hellman Problem is hard.
Category / Keywords: public-key cryptography / Publication Info: An extended abstract of this work will appear in the Proceedings of Asiacrypt 2003 Date: received 23 Jun 2003, last revised 21 Oct 2003 Contact author: kenny paterson at rhul ac uk Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation Note: Minor revisions to Sections 1.5 and 5. Version: 20031021:122149 (All versions of this report) Short URL: ia.cr/2003/126 Discussion forum: Show discussion | Start new discussion