Skip to main content
SpringerLink
Log in

Lattice-based certificateless encryption scheme

  • Research Article
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

Abstract

Certificateless public key cryptography (CL-PKC) can solve the problems of certificate management in a public key infrastructure (PKI) and of key escrows in identity-based public key cryptography (ID-PKC). In CL-PKC, the key generation center (KGC) does not know the private keys of all users, and their public keys need not be certificated by certification authority (CA). At present, however, most certificateless encryption schemes are based on large integer factorization and discrete logarithms that are not secure in a quantum environment and the computation complexity is high. To solve these problems, we propose a new certificate-less encryption scheme based on lattices, more precisely, using the hardness of the learning with errors (LWE) problem. Compared with schemes based on large integer factorization and discrete logarithms, the most operations are matrixvector multiplication and inner products in our scheme, our approach has lower computation complexity. Our scheme can be proven to be indistinguishability chosen ciphertext attacks (IND-CPA) secure in the random oracle model.

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.

Similar content being viewed by others

References

  1. Al-Riyami S, Paterson K G. Certificateless public key cryptography. Lecture Notes in Computer Science, 2003, 2894: 452–473

    Article  MathSciNet  Google Scholar 

  2. Al-Riyami S, Paterson K G. CBE from CL-PKE: a generic construction and efficient schemes. Lecture Notes in Computer Science, 2005, 3386: 398–415

    Article  MathSciNet  Google Scholar 

  3. Baek J, Safavi-Naini R, Susilo W. Certificateless public key encryption without pairing. Lecture Notes in Computer Science, 2005, 3650: 134–148

    Article  Google Scholar 

  4. Lai J Z, Deng R H, Liu S L, Kou W D. RSA-based certificateless public key encryption. Lecture Notes in Computer Science, 2009, 5451: 24–34

    Article  Google Scholar 

  5. Yum D H, Lee P J. Generic construction of certificateless encryption. Lecture Notes in Computer Science, 2004, 3043: 802–811

    Article  Google Scholar 

  6. Libert B, Quisquater J J. On constructing certificateless cryptosystems from identity based encryption. Lecture Notes in Computer Science, 2006, 3958: 474–490

    Article  MathSciNet  Google Scholar 

  7. Cheng Z H, Chen L Q, Ling L, Comley R. General and efficient certificateless public key encryption constructions. Lecture Notes in Computer Science, 2007, 4575: 83–107

    Article  MathSciNet  Google Scholar 

  8. Dent A W, Libert B, Paerson K G. Certificateless encryption schemes strongly secure in the standard model. Lecture Notes in Computer Science, 2008, 4939: 344–359

    Article  Google Scholar 

  9. Huang Q, Wong D S. Generic certificateless encryption in the standard model. Lecture Notes in Computer Science, 2007, 4752: 278–291

    Article  Google Scholar 

  10. Gentry C, Peikert C, Vaikuntanathan V. Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing. 2008, 197–206

    Google Scholar 

  11. Regev O. On lattices, learning with errors, random linear codes, and cryptography. Journal of ACM, 2009, 56(6): Article No. 34

    Google Scholar 

  12. Lyubashevsky V, Peikert C, Regev O. On ideal lattices and learning with errors over rings. Journal of ACM, 2013, 60(6): Article No. 43

    Google Scholar 

  13. Lindner R, Peikert C. Better key sizes (and attacks) for LWE-based encryption. Lecture Notes in Computer Science, 2011, 6558: 319–339

    Article  MathSciNet  Google Scholar 

  14. Stehlé D, Steinfeld R. Making NTRU as secure as worst-case problems over ideal lattices. Lecture Notes in Computer Science, 2011, 6632: 27–47

    Article  Google Scholar 

  15. Cash D, Hofheinz D, Kiltz E, Peikert C. Bonsai trees, or how to delegate a lattice basis. Lecture Notes in Computer Science, 2010, 6110: 523–552

    Article  MathSciNet  Google Scholar 

  16. Agrawal S, Boneh D, Boyen X. Efficient lattice (H) IBE in the standard model. Lecture Notes in Computer Science, 2010, 6110: 553–572

    Article  MathSciNet  Google Scholar 

  17. Agrawal S, Boneh D, Boyen X. Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE. Lecture Notes in Computer Science, 2010, 6223: 98–115

    Article  MathSciNet  Google Scholar 

  18. Guang Y, Gu C X, Zhu Y F, Zheng Y H, Fei J L. Certificateless fully homomorphic encryption based on LWE problem. Journal of Electronics and Information Technology, 2013, 35(4): 988–993

    Article  Google Scholar 

  19. Gentry C. Fully homomorphic encryption using ideal lattices. In: Proceedings of STOC 2009, 169–178

    Google Scholar 

  20. Gentry C. Toward basing fully homomorphic encryption on worst-case hardness. Lecture Notes in Computer Science, 2010, 6223: 116–137

    Article  MathSciNet  Google Scholar 

  21. Brakerski Z, Vaikuntanathan V. Fully homomorphic encryption from ring-LWE and security for key dependent messages. Lecture Notes in Computer Science, 2011, 6841: 505–524

    Article  MathSciNet  Google Scholar 

  22. Brakerski Z, Vaikuntanathan V. Efficient fully homomorphicencryption from (standard) LWE. In: Proceedings of 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science. 2011, 97–106

    Chapter  Google Scholar 

  23. Zhang G Y. Fuzzy certificateless identity-based encryption protocol from lattice. Applied Mechanics and Materials, 2013, 380: 2262–2266

    Article  Google Scholar 

  24. Lyubashevsky V. Lattice signatures without trapdoors. Lecture Notes in Computer Science, 2012, 7237: 738–755

    Article  MathSciNet  Google Scholar 

  25. Gordon D, Katz J, Vaikuntanathan V. A group signature scheme from lattice assumptions. Lecture Notes in Computer Science, 2010, 6477: 395–412

    Article  MathSciNet  Google Scholar 

  26. Rückert M. Lattice-based blind signatures. Lecture Notes in Computer Science, 2010, 6477: 413–430

    Article  Google Scholar 

  27. Rückert M. Strongly unforgeable signatures and hierarchical identitybased signatures from lattices without random oracles. Lecture Notes in Computer Science, 2010, 6061: 182–200

    Article  Google Scholar 

  28. Micciancio D, Regev O. Worst-case to average-case reductions based on gaussian measures. SIAM Journal on Computing, 2007, 37(1): 267–302

    Article  MathSciNet  MATH  Google Scholar 

  29. Alwen J, Peiker C. Generating shorter bases for hard random lattices. Lecture Notes in Computer Science, 2009, 75–86

    Google Scholar 

  30. Regev O. On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM, 2009, 56(6): Article No. 34

    Google Scholar 

  31. Peikert C. Public-key cryptosystems from the worst-case shortest vector problem. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing. 2009, 333–342

    Google Scholar 

  32. Boneh D, Freeman D. Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures. Lecture Notes in Computer Science, 2011, 6571: 1–16

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory of Integrated Service Networks, Xidian University, Xi’an, 710071, China

    Mingming Jiang, Yupu Hu, Baocang Wang & Qiqi Lai

  2. Security and Privacy Lab, CRDU, Huawei Technologies Co., LTD., Beijing, 100095, China

    Hao Lei

Authors
  1. Mingming Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yupu Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hao Lei
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Baocang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Qiqi Lai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mingming Jiang.

Additional information

Mingming Jiang is a PhD student in Xidian University. He received his MS and BS degrees in cryptography from Huaibei Normal University in 2010 and 2007, respectively. His research interests include public key cryptography based on lattice and provable security.

Yupu Hu is a professor and PhD supervisor in the School of Telecommunications Engineering, Xidian University. He received his PhD in cryptography from Xidian University in 1999, and received his MS and BS degrees in mathematics from Xidian University in 1999 and 1987, respectively. His main research interests include public key cryptography based on lattice and fully homomorphic encryption.

Hao Lei is an associate researcher in Beijing. He received his MS and PhD degrees from the State Key Laboratory of Information Security, Chinese Academy of Sciences. His research focuses on the areas of security and cryptography. Baocang Wang is an associate professor and MS supervisor in the School of Telecommunications Engineering, Xidian University. He received his PhD degree in cryptography from Xidian University in 2006, and received his MS and BS degrees in mathematics from Xidian University in 2004 and 2001, respectively. His main research interests include public key cryptography and wireless network security.

Qiqi Lai is a PhD student in Xidian University. He received his MS degree in cryptography from Xidian University in 2011 and his BS degree in information security from The PLA Information Engineering University in 2008. His research interests include public key cryptography and provable security.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jiang, M., Hu, Y., Lei, H. et al. Lattice-based certificateless encryption scheme. Front. Comput. Sci. 8, 828–836 (2014). https://doi.org/10.1007/s11704-014-3187-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-014-3187-6

Keywords

Search

Navigation