Skip to main content

Generic Constructions of Identity-Based and Certificateless KEMs

Abstract

We extend the concept of key encapsulation to the primitives of identity-based and certificateless encryption. We show that the natural combination of ID-KEMs or CL-KEMs with data encapsulation mechanisms results in encryption schemes that are secure in a strong sense. In addition, we give generic constructions of ID-KEMs and CL-KEMs that are provably secure in the random oracle model.

References

  1. S.S. Al-Riyami. Cryptographic Schemes Based on Elliptic Curve Pairings. Ph.D. Thesis, University of London, 2004.

  2. S.S. Al-Riyami and K.G. Paterson. CBE from CL-PKE: A Generic Construction and Efficient Schemes. In Public Key Cryptography—PKC 2005, LNCS 3386, pp. 398–415. Springer, Berlin, 2005.

    Google Scholar 

  3. S.S. Al-Riyami and K.G. Paterson. Certificateless Public Key Cryptography. In Advances in Cryptology—ASIACRYPT 2003, LNCS 2894, pp. 452–473. Springer, Berlin, 2003.

    Google Scholar 

  4. M. Barbosa and P. Farshim. Efficient Identity-Based Key Encapsulation to Multiple Parties. In Cryptography and Coding 2005, LNCS 3796, pp. 428–441. Springer, Berlin, 2005.

    Chapter  Google Scholar 

  5. M. Bellare, A. Desai, E. Jokipii and P. Rogaway. A Concrete Security Treatment of Symmetric Encryption: Analysis of the DES Modes of Operation. In 38th IEEE Symposium on Foundations of Computer Science—FOCS, pp. 94–403, 1997.

  6. M. Bellare, A. Desai, D. Pointcheval and P. Rogaway. Relations Among Notions of Security for Public Key Encryption Schemes. In Advances in Cryptology—CRYPTO ’98, LNCS 1462, pp. 26–45. Springer, Berlin, 1998.

    Chapter  Google Scholar 

  7. M. Bellare and P. Rogaway. Random Oracles Are Practical: A Paradigm for Designing Efficient Protocols. In 1st ACM Conference on Computer and Communications Security, pp. 62–73. ACM, New York, 1993.

    Chapter  Google Scholar 

  8. D. Boneh and X. Boyen. Efficient Selective-ID Secure IBE without Random Oracles. In Advances in Cryptology—EUROCRYPT 200, LNCS 3027, pp. 223–238. Springer, Berlin, 2004.

    Google Scholar 

  9. D. Boneh and M. Franklin. Identity-Based Encryption from the Weil Pairing. SIAM J. Comput. 32:586–615, 2003.

    MATH  Article  MathSciNet  Google Scholar 

  10. L. Chen and Z. Cheng. Security Proof of Sakai–Kasahara’s IBE Scheme. In Proceedings of Cryptography and Coding 2005, LNCS 3796, pp. 442–459. Springer, Berlin, 2005.

    Chapter  Google Scholar 

  11. R. Cramer and V. Shoup. Design and Analysis of Practical Public-Key Encryption Schemes Secure Against Adaptive Chosen Ciphertext Attack. SIAM J. Comput. 33:167–226, 2003.

    MATH  Article  MathSciNet  Google Scholar 

  12. A. Dent. A Designer’s Guide to KEMs. In Cryptography and Coding, 2003, LNCS 2898, pp. 133–151. Springer, Berlin, 2003.

    Google Scholar 

  13. E. Fujisaki and T. Okamoto. Secure Integration of Asymmetric and Symmetric Encryption Schemes. In Advances in Cryptology—CRYPTO ’99, LNCS 1666, pp. 537–554. Springer, Berlin, 1999.

    Google Scholar 

  14. C. Gentry. Certificate-Based Encryption and the Certificate Revocation Problem. In Advances in Cryptology—EUROCRYPT 2003, LNCS 2656, pp. 272–293. Springer, Berlin, 2003.

    Chapter  Google Scholar 

  15. C. Gentry. Practical Identity-Based Encryption without Random Oracles. In Advances in Cryptology—EUROCRYPT 2006, LNCS 4004, pp. 445–464. Springer, Berlin, 2006.

    Chapter  Google Scholar 

  16. T. Okamoto and D. Pointcheval. The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes. In Public Key Cryptography—PKC 2001, LNCS 1992, pp. 104–118. Springer, Berlin, 2001.

    Chapter  Google Scholar 

  17. D. Pointcheval and T. Okamoto. REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform. In Topics in Cryptography—CT-RSA 2001, LNCS 2020, pp. 159–175. Springer, Berlin, 2001.

    Google Scholar 

  18. V. Shoup. Using Hash Functions as a Hedge against Chosen Ciphertext Attack. In Advances in Cryptology—EUROCRYPT 2000, LNCS 1807, pp. 275–288. Springer, Berlin, 2000.

    Chapter  Google Scholar 

  19. B. Waters. Efficient Identity-Based Encryption without Random Oracles. In Advances in Cryptology—EUROCRYPT 2005, LNCS 3494, pp. 114–127. Springer, Berlin, 2005.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to K. Bentahar.

Additional information

Communicated by Mihir Bellare

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Bentahar, K., Farshim, P., Malone-Lee, J. et al. Generic Constructions of Identity-Based and Certificateless KEMs. J Cryptol 21, 178–199 (2008). https://doi.org/10.1007/s00145-007-9000-z

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00145-007-9000-z

Keywords

  • Encryption Scheme
  • Random Oracle
  • Random Oracle Model
  • Challenge Ciphertext
  • Decryption Oracle