A Survey on Identity-Based Encryption from Lattices

Abstract

Lattice-based cryptography is one of the most important topics in the area of cryptography, because of its (asymptotic) efficiency, post-quantum security, and expressiveness. In this survey, we provide an overview of lattice-based identity-based encryption (IBE), which is also an important topic in the area. In more details, we first introduce dual Regev public key encryption. Then, we change it to obtain Gentry–Peikert–Vaikuntanathan IBE, which is secure in the random oracle model. We then provide a framework for capturing constructions in the standard model. Then, by instantiating the framework, we show that we can capture the Cash–Hofheinz–Kiltz–Peikert and Agrawal–Boneh–Boyen scheme. Finally, we mention several recent works aiming at reducing parameters or tight security reductions.