Skip to main content
SpringerLink
Log in

Lattice-based certificateless public-key encryption in the standard model

  • Regular Contribution
  • Published:
International Journal of Information Security Aims and scope Submit manuscript

Abstract

The notion of certificateless public-key encryption (CL-PKE) was introduced by Al-Riyami and Paterson in 2003 that avoids the drawbacks of both traditional PKI-based public-key encryption (i.e., establishing public-key infrastructure) and identity-based encryption (i.e., key escrow). So CL-PKE like identity-based encryption is certificate-free, and unlike identity-based encryption is key escrow-free. In this paper, we introduce simple and efficient CCA-secure CL-PKE based on (hierarchical) identity-based encryption. Our construction has both theoretical and practical interests. First, our generic transformation gives a new way of constructing CCA-secure CL-PKE. Second, instantiating our transformation using lattice-based primitives results in a more efficient CCA-secure CL-PKE than its counterpart introduced by Dent in 2008.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Agrawal, S., Boneh, D., Boyen, X.: Efficient lattice (H)IBE in the standard model. In: Proceedings of Eurocrypt’10, vol. 6110 of, Lecture Notes in Computer Science, pp. 553–572 (2010)

  2. Al-Riyami, S.S.: Cryptographic schemes based on elliptic curve pairings. PhD thesis, Royal Holloway, University of London (2004). http://www.isg.rhul.ac.uk/kp/sattthesis.pdf

  3. Al-Riyami, S.S., Paterson, K.: Certificateless public-key cryptography. In: Laih, C.-S. (ed.) Advances in Cryptology–ASIACRYPT 2003, vol. 2894, pp. 452–473. Springer, Berlin, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Au, M.H., Mu, Y., Chen, J., Wong, D.S., Liu, J.K., Yang, G.: Malicious KGC attacks in certificateless cryptography. In: Proceedings of the 2nd ACM Symposium on Information, Computer and Communications Security, ASIACCS ’07, pp. 302–311. ACM (2007)

  5. Baek, J., Safavi-Naini, R., Susilo, W.: Certificateless public-key encryption without pairing. In: Information Security Conference/Information Security Workshop, vol. 3650 of Lecture Notes in Computer Science, pp. 134–148. Springer (2005)

  6. Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schemes. In: Krawczyk, H. (ed.) Advances in Cryptology–CRYPTO 98, pp. 26–46. Springer, Berlin (1998)

  7. Boneh, D. Freeman, D.M.: Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures. In: Proceedings of the 14th International Conference on Practice and Theory in Public-Key Cryptography Conference on Public-Key Cryptography, PKC’11, pp. 1–16. Springer, Berlin, Heidelberg (2011)

  8. Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. SIAM J. Comput. 32, 586–615 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  9. Boneh, D., Boyen, X.: Efficient selective-ID secure identity-based encryption without random oracles. In: Cachin, C., Camenisch, J. (eds.) Advances in Cryptology–EUROCRYPT 2004, vol. 3027, pp. 223–238. Springer, Berlin, Heidelberg (2004)

    Chapter  Google Scholar 

  10. Boneh, D., Katz, J.: Improved efficiency for CCA-secure cryptosystems built using identity-based encryption. In: Menezes, A. (ed.) Topics in Cryptology—CT-RSA 2005, vol. 3376, pp. 87–103. Springer, Berlin, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Boyen, X., Waters, B.: Anonymous hierarchical identity-based encryption (without random oracles). In: Dwork, C. (ed.) Advances in Cryptology—CRYPTO 2006, vol. 4117, pp. 290–307. Springer, Berlin, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Canetti, R., Halevi, S., Katz, J.: A forward-secure public-key encryption scheme. In: Biham, E. (ed.) Advances in Cryptology—EUROCRYPT 2003, vol. 2656, pp. 646–646. Springer, Berlin, Heidelberg (2003)

    Google Scholar 

  13. Canetti, R., Halevi, S., Katz, J.: Chosen-ciphertext security from identity-based encryption. In: Cachin, C., Camenisch, J. (eds.) Advances in Cryptology—EUROCRYPT 2004, vol. 3027, pp. 207–222. Springer, Berlin, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Carter, L., Wegman, M.N.: Universal classes of hash functions. J. Comput. Syst. Sci. 18(2), 143–154 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  15. Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: Gilbert, H. (ed.) Advances in Cryptology—EUROCRYPT 2010, vol. 6110, pp. 523–552. Springer, Berlin (2010)

    Chapter  Google Scholar 

  16. Choi, K.Y., Park, J.H., Hwang, J.Y., Lee, D.H.: Efficient certificateless signature schemes. In: Applied Cryptography and Network Security: 5th International Conference, ACNS 2007, Zhuhai, China, June 5–8, 2007: Proceedings, p. 443. Springer, New York (2007)

  17. Dent, A.: A survey of certificateless encryption schemes and security models. Int. J. Inf. Secur. 7(5), 349–377 (2008)

    Google Scholar 

  18. Dent, A., Libert, B., Paterson, K.: Certificateless encryption schemes strongly secure in the standard model. In: Cramer, R. (ed.) Public-Key Cryptography—PKC 2008, vol. 4939, pp. 344–359. Springer, Berlin, Heidelberg (2008)

    Chapter  Google Scholar 

  19. Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644–654 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  20. Dodis, Y., Katz, J.: Chosen-ciphertext security of multiple encryption. In: Kilian, J. (ed.) Theory of Cryptography, vol. 3378, pp. 188–209. Springer, Berlin, Heidelberg (2005)

    Chapter  Google Scholar 

  21. Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography. SIAM J. Comput. 30(2), 391–437 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  22. Horwitz, J., Lynn, B.: Toward hierarchical identity-based encryption. In: Knudsen, L. (ed.) Advances in Cryptology—EUROCRYPT 2002, vol. 2332, pp. 466–481. Springer, Berlin, Heidelberg (2002)

    Chapter  Google Scholar 

  23. Kawachi, A., Tanaka, K., Xagawa, K.: Concurrently secure identification schemes based on the worst-case hardness of lattice problems. In: Pieprzyk, J. (ed.) Advances in Cryptology—ASIACRYPT 2008, vol. 5350, pp. 372–389. Springer, Berlin, Heidelberg (2008)

    Chapter  Google Scholar 

  24. Lai, J., Kou, W.: Self-generated-certificate public-key encryption without pairing. In: Okamoto, T., Wang, X. (eds.) Lecture Notes in Computer Science, pp. 476–489. Springer, Heidelberg (2007)

    Google Scholar 

  25. Libert, B., Quisquater, J.-J.: On constructing certificateless cryptosystems from identity based encryption. In: Proceedings of the 9th International Conference on Theory and Practice of Public-Key Cryptography, PKC’06, pp. 474–490. Springer, Berlin, Heidelberg (2006)

  26. Park, J.H., Choi, K.Y., Hwang, J.Y., Lee, D.H.: Certificateless public-key encryption in the selective-id security model. In: Proceedings of the First International Conference on Pairing-Based Cryptography, Pairing’07, pp. 60–82. Springer, Berlin, Heidelberg (2007)

  27. Rackoff, C., Simon, D.: Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Feigenbaum, J. (ed.) Advances in Cryptology—CRYPTO ’91, vol. 576, pp. 433–444. Springer, Berlin, Heidelberg (1992)

    Google Scholar 

  28. Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakley, G., Chaum, D. (eds.) Advances in Cryptology, vol. 196, pp. 47–53. Springer, Berlin, Heidelberg (1985)

    Chapter  Google Scholar 

  29. Sun, Y., Zhang, F., Baek, J.: Strongly secure certificateless public-key encryption without pairing. In: Proceedings of the 6th International Conference on Cryptology and Network Security, CANS’07, pp. 194–208. Springer, Berlin, Heidelberg (2007)

  30. Yum, D.H., Lee, P.J.: Generic construction of certificateless encryption. In: ICCSA (1), vol. 3043 of Lecture Notes in Computer Science, pp. 802–811. Springer (2004)

Download references

Acknowledgments

We thank the anonymous reviewers for their helpful and constructive comments. Reza Sepahi was supported by a Macquarie University MQRES scholarship. Ron Steinfeld and Josef Pieprzyk were supported by ARC Discovery Grant DP0987734. Ron Steinfeld was also supported by an Australian Research Fellowship (ARF) from the Australian Research Council (ARC), and ARC Discovery Grant DP110100628.

Author information

Authors and Affiliations

  1. Computing Department, Faculty of Science, Macquarie University, Sydney, NSW, Australia

    Reza Sepahi, Ron Steinfeld & Josef Pieprzyk

Authors
  1. Reza Sepahi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ron Steinfeld
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Josef Pieprzyk
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Reza Sepahi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sepahi, R., Steinfeld, R. & Pieprzyk, J. Lattice-based certificateless public-key encryption in the standard model. Int. J. Inf. Secur. 13, 315–333 (2014). https://doi.org/10.1007/s10207-013-0215-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10207-013-0215-8

Keywords

Search

Navigation