CBE from CL-PKE: a generic construction and efficient schemes

  • Authors:
  • Sattam S. Al-Riyami;Kenneth G. Paterson

  • Affiliations:
  • Information Security Group, Royal Holloway, University of London, Egham, Surrey, United Kingdom;Information Security Group, Royal Holloway, University of London, Egham, Surrey, United Kingdom

  • Venue:
  • PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.