Skip to main content

An Efficient and Provably Secure Certificate-Based Encryption Scheme

  • Conference paper

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 164))

Abstract

Certificate-based encryption (CBE) is a new asymmetric encryption paradigm which combines traditional public-key encryption and identity-based encryption (IBE) while preserving some of their most attractive features. It provides an efficient implicit certificate mechanism which eliminates the third-party queries and simplifies the certificate revocation problem in the traditional PKI. It also solves the key escrow problem and the key distribution problem inherent in IBE. In this paper, we propose a quite efficient CBE scheme which is chosen-ciphertext secure in the random oracle model. The proposed CBE scheme requires computing only one bilinear pairing and introduces no redundancies in ciphertext. Compared with the existing CBE schemes, our scheme enjoys better performance on both the computation efficiency and the communication bandwidth.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Al-Riyami, S.S., Paterson, K.G.: Certificateless Public Key Cryptography. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 452–473. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Al-Riyami, S.S., Paterson, K.G.: CBE from CL-PKE: A Generic Construction and Efficient Schemes. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 398–415. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient Algorithms for Pairing-based Cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 354–368. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Boneh, D., Boyen, X.: Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 223–238. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  5. Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil Pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Chen, L., Cheng, Z.: Security Proof of Sakai-Kasahara’s Identity-Based Encryption Scheme. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 442–459. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  7. Dodis, Y., Katz, J.: Chosen-Ciphertext Security of Multiple Encryption. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 188–209. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Fujisaki, E., Okamoto, T.: Secure Integration of Asymmetric and Symmetric Encryption Schemes. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 537–554. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  9. Fujisaki, E., Okamoto, T.: How to Enhance the Security of Public-Key Encryption at Minimum Cost. In: Imai, H., Zheng, Y. (eds.) PKC 1999. LNCS, vol. 1560, pp. 53–68. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  10. Galindo, D., Morillo, P., Ràfols, C.: Breaking Yum and Lee Generic Constructions of Certificate-Less and Certificate-Based Encryption Schemes. In: Atzeni, A.S., Lioy, A. (eds.) EuroPKI 2006. LNCS, vol. 4043, pp. 81–91. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  11. Galindo, D., Morillo, P., Ràfols, C.: Improved Certificate-based Encryption in the Standard Model. Journal of Systems and Software 81(7), 1218–1226 (2008)

    Article  Google Scholar 

  12. Gentry, C.: Certificate-based Encryption and the Certificate Revocation Problem. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 272–293. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Gentry, C.: Practical Identity-based Encryption without Random Oracles. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 445–464. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  14. Kang, B.G., Park, J.H.: Is It Possible to Have CBE from CL-PKE? Cryptology ePrint Archive, Report 2005/431 (2005), http://eprint.iacr.org/

  15. Libert, B., Quisquater, J.J.: Identity Based Encryption without Redundancy. In: Ioannidis, J., Keromytis, A.D., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 285–300. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  16. Liu, J.K., Zhou, J.: Efficient Certificate-based Encryption in the Standard Model. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol. 5229, pp. 144–155. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  17. Lu, Y., Li, J.G., Xiao, J.M.: Generic Construction of Certificate-Based Encryption. In: 9th International Conference for Young Computer Scientists, pp. 1518–1594. IEEE CS, New York (2008)

    Google Scholar 

  18. Lu, Y., Li, J.G., Xiao, J.M.: Constructing Efficient Certificate-based Encryption with Paring. Journal of Computers 4(1), 19–26 (2009)

    Article  Google Scholar 

  19. Morillo, P., Ràfols, C.: Certificate-based Encryption without Random Oracles. Cryptology ePrint Archive, Report 2006/12 (2006), http://eprint.iacr.org/

  20. Okamoto, T., Pointcheval, D.: The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol. 1992, pp. 104–111. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  21. Park, J.H., Lee, D.H.: On the Security of Status Certificate-based Encryption Scheme. IEICE Trans. Fundamentals E90-A(1), 303–304 (2007)

    Article  Google Scholar 

  22. Sakai, R., Kasahara, M.: ID Based Cryptosystems with Pairing on Elliptic Curve. Cryptology ePrint Archive, Report 2003/054 (2003), http://eprint.iacr.org/

  23. Waters, B.: Efficient Identity-based Encryption without Random Oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 114–127. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  24. Yum, D.H., Lee, P.J.: Identity-Based Cryptography in Public Key Management. In: Katsikas, S.K., Gritzalis, S., López, J. (eds.) EuroPKI 2004. LNCS, vol. 3093, pp. 71–84. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  25. Yum, D.H., Lee, P.J.: Separable Implicit Certificate Revocation. In: Park, C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol. 3506, pp. 121–136. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lu, Y. (2011). An Efficient and Provably Secure Certificate-Based Encryption Scheme. In: Zhou, Q. (eds) Theoretical and Mathematical Foundations of Computer Science. ICTMF 2011. Communications in Computer and Information Science, vol 164. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24999-0_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24999-0_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24998-3

  • Online ISBN: 978-3-642-24999-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics