Adaptively secure hierarchical identity-based encryption over lattice

4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Quantum computer is regarded as a threat to the cryptosystem at present. Lattice with a rich mathematics structure gave a choice for building post-quantum secure hierarchical identity-based encryption (HIBE) system. But in the existing works, there are many shortcomings such as large public/private key space and weak security model. To overcome these shortcomings, a method for delegating a short lattice basis is discussed in this paper. It maintains the lattice dimension is constant. This distinct feature is used to construct the secure HIBE. The issued scheme has many advantages over the available, such as short public/private keys, achieving adaptive security. It is fair that our scheme is the first one which achieves both constant size private key space and adaptive security. In addition, we also convert our scheme from an one-bit version to an N-bit version. Based learning with errors (LWE) problem, we prove the security in the standard model.

Cite

CITATION STYLE

APA

Zhang, L., & Wu, Q. (2017). Adaptively secure hierarchical identity-based encryption over lattice. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10394 LNCS, pp. 46–58). Springer Verlag. https://doi.org/10.1007/978-3-319-64701-2_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free