Security Proof of Sakai-Kasahara’s Identity-Based Encryption Scheme

  • Liqun Chen
  • Zhaohui Cheng
Conference paper

DOI: 10.1007/11586821_29

Volume 3796 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Chen L., Cheng Z. (2005) Security Proof of Sakai-Kasahara’s Identity-Based Encryption Scheme. In: Smart N.P. (eds) Cryptography and Coding. Cryptography and Coding 2005. Lecture Notes in Computer Science, vol 3796. Springer, Berlin, Heidelberg

Abstract

Identity-based encryption (IBE) is a special asymmetric encryption method where a public encryption key can be an arbitrary identifier and the corresponding private decryption key is created by binding the identifier with a system’s master secret. In 2003 Sakai and Kasahara proposed a new IBE scheme, which has the potential to improve performance. However, to our best knowledge, the security of their scheme has not been properly investigated. This work is intended to build confidence in the security of the Sakai-Kasahara IBE scheme. In this paper, we first present an efficient IBE scheme that employs a simple version of the Sakai-Kasahara scheme and the Fujisaki-Okamoto transformation, which we refer to as SK-IBE. We then prove that SK-IBE has chosen ciphertext security in the random oracle model based on a reasonably well-explored hardness assumption.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Liqun Chen
    • 1
  • Zhaohui Cheng
    • 2
  1. 1.Hewlett-Packard LaboratoriesBristolUK
  2. 2.School of Computing ScienceMiddlesex UniversityLondonUK