Simple and fast identity-based encryption from module lattices

Module lattices have many advantages over traditional number theory to construct security schemes. Especially, module lattice-based security schemes are potentially able to resist to quantum attacks which can break traditional number theory based ones. In this vein, this paper designed an extremely fast identity-based encryption (for short IBE) scheme from module lattices. Although the security proof has been conducted in the random oracle (for short RO) model, the keys and the ciphertext expansion rate of our scheme are comparatively small. Moreover, the main idea behind the scheme can be easily understood: combining the provably secure NTRU signature of Stehle and Steinfeld [19] with the CPA secure El Gamal-like encryption scheme proposed by Lyubashevsky, Peikert and Regev [15].