Strongly secure certificateless public key encryption without pairing

  • Authors:
  • Yinxia Sun;Futai Zhang;Joonsang Baek

  • Affiliations:
  • School of Mathematics and Computer Science, Nanjing Normal University, Nanjing, P.R. China;School of Mathematics and Computer Science, Nanjing Normal University, Nanjing, P.R. China;Institute for Infocomm Research, Singapore, Singapore

  • Venue:
  • CANS'07 Proceedings of the 6th international conference on Cryptology and network security
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Certificateless Public Key Cryptography (CLPKC) enjoys the advantage of ID-based public key cryptography without suffering from the key escrow problem. In 2005, Baek et al. proposed the first certificateless encryption (CLPKE) scheme that does not depend on pairing. Although it provides high efficiency, one drawback of their scheme is that the security proof only holds for a weaker security model in which the Type I adversary is not allowed to replace the public key associated with the challenge identity. In this paper, we eliminate this limitation and construct a strongly secure CLPKE scheme without pairing. We prove that the proposed scheme is secure against adaptive chosen-ciphertext attack in the random oracle model, provided that the Computational Diffie-Hellman problem is intractable.