General and Efficient Certificateless Public Key Encryption Constructions

  • Zhaohui Cheng
  • Liqun Chen
  • Li Ling
  • Richard Comley
Conference paper

DOI: 10.1007/978-3-540-73489-5_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4575)
Cite this paper as:
Cheng Z., Chen L., Ling L., Comley R. (2007) General and Efficient Certificateless Public Key Encryption Constructions. In: Takagi T., Okamoto T., Okamoto E., Okamoto T. (eds) Pairing-Based Cryptography – Pairing 2007. Pairing 2007. Lecture Notes in Computer Science, vol 4575. Springer, Berlin, Heidelberg

Abstract

In 2003, Al-Riyami and Paterson introduced a new public key encryption paradigm called Certificateless Public Key Encryption (CL-PKE), which like Identity-Based Encryption (IBE) is certificatefree, and meanwhile which unlike IBE but similar to certificate-based encryption is key-escrow-free. In this paper, based on a heuristic observation on some existing IBE schemes and PKE schemes, we propose a general approach to build a CL-PKE solution, which makes use of a simple combination of an IBE scheme, a Diffie-Hellman type key establishment algorithm and a secure hash-function. Following this approach we construct two efficient concrete CL-PKE schemes and formally analyse their security in the random oracle model.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Zhaohui Cheng
    • 1
  • Liqun Chen
    • 2
  • Li Ling
    • 3
  • Richard Comley
    • 1
  1. 1.School of Computing Science, Middlesex University, LondonUK
  2. 2.Hewlett-Packard Laboratories, BristolUK
  3. 3.Department of Communication Science and Engineering, Fudan University, ShanghaiChina

Personalised recommendations