Efficient Identity-Based Encryption from Lattice

Abstract

At present, most of the identity based encryption (IBE) schemes from the lattice originate from the results of Gentry et.al., and regard each identity as a bit string with equal length and then map a matrix to every bit of identity string. Consequently, they are considerably less efficient. In our paper, we construct an IBE which is efficient from standard learning with errors problem and handles identities as a chunk for performance. In the standard model, our paper gives a proof which our IBE is IND-sID-CCA secure. Mean-while, we also show which our IBE construction is also IND-ID-CCA secure via the technique i.e., imposing additional restrictions on the identities, presented by Boyen and Boneh.