Full secure identity-based encryption scheme with short public key size over lattices in the standard model

Abstract

An efficient identity-based encryption (IBE) scheme over lattice is proposed in this paper. Under the hardness of the learning with errors (LWE) problem, the proposed scheme is semantic secure against adaptive chosen identity and chosen plaintext attack in the standard model. To improve the efficiency of the lattice-based IBE scheme, unlike the identity string is encoded into a matrix by a group of public matrices in several known constructions, the identity string of l bits is encoded into a vector with the help of $l+1$ vectors in this paper. With the help of this idea, we achieve the private key extraction of IBE scheme at the same lattice. Then, the public key of the proposed scheme only consists of one $n\times m$ matrix and $l+1$ vectors, compared with that the public keys of the known lattice-based IBE schemes all consist as a group of $n\times m$ matrices. Hence, the public key size of this scheme is shorter than that of the known constructions.

Keywords:

• identity-based encryption
• lattice
• learning with errors problem
• pre-image sampling function
• the standard model

2010 AMS Subject Classifications:

• 68P25
• 94A60
• 03G10
• H.2.0
• H.2.7

Acknowledgments

The authors thank the anonymous referees for their helpful comments. This work was supported by the National Natural Science Foundation of China (Grant No. 61303198, 61173151, 61472470, 61100229) and Natural Science Foundation of Shandong Province (No. ZR2013FQ031). This work was also supported by the Doctor Foundation of Shandong Jianzhu University.

Disclosure statement

No potential conflict of interest was reported by the authors.