Full secure identity-based encryption scheme over lattices for wireless sensor networks in the standard model

Abstract

This paper proposes a lattice-based identity-based encryption scheme which can be used in wireless sensor networks to achieve secure communication. More precisely, a known lattice-based chosen plain-text secure encryption scheme and the bonsai trees primitive are used to design an identity-based encryption (IBE) scheme in this paper. To reduce the public key size of the proposed IBE scheme, a public matrices chosen rule is used in this paper which reduces the public key size of proposed scheme to be close to half of that of a known lattice-based scheme. Under the hardness of the decision variant of the learning with errors (LWE) problem, we prove that the proposed IBE scheme is indistinguishable against the adaptive chosen identities and chosen-plaintext attack in the standard model. Moreover, the message-to-ciphtertext expanse factor of this scheme is also controlled efficiently which is nearly closed to that of Gentry's scheme. Due to the quantum intractability of the LWE problem on which the scheme is based, the proposed IBE scheme is secure even in quantum-era.