CBE from CL-PKE: A Generic Construction and Efficient Schemes
We present a new Certificateless Public Key Encryption (CL-PKE) scheme whose security is proven to rest on the hardness of the Bilinear Diffie-Hellman Problem (BDHP) and that is more efficient than the original scheme of Al-Riyami and Paterson. We then give an analysis of Gentry’s Certificate Based Encryption (CBE) concept, repairing a number of problems with the original definition and security model for CBE. We provide a generic conversion showing that a secure CBE scheme can be constructed from any secure CL-PKE scheme. We apply this result to our new efficient CL-PKE scheme to obtain a CBE scheme that improves on the original scheme of Gentry.
KeywordsCertificateless Public Key Encryption CL-PKE Certificate based Encryption CBE pairings
- 1.Al-Riyami, S.S.: Cryptographic schemes based on elliptic curve pairings, Ph.D. thesis, University of London (2004)Google Scholar
- 3.Al-Riyami, S.S., Paterson, K.G.: Certificateless public key cryptography. Cryptology ePrint Archive, Report 2003/126 (2003), http://eprint.iacr.org/
- 6.Fujisaki, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 537–554. Springer, Heidelberg (1999)Google Scholar