Abstract
We construct an efficient identity based encryption system based on the standard learning with errors (LWE) problem. Our security proof holds in the standard model. The key step in the construction is a family of lattices for which there are two distinct trapdoors for finding short vectors. One trapdoor enables the real system to generate short vectors in all lattices in the family. The other trapdoor enables the simulator to generate short vectors for all lattices in the family except for one. We extend this basic technique to an adaptively-secure IBE and a Hierarchical IBE. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Agrawal, S., Boneh, D., & Boyen, X. (2010). Efficient lattice (H)IBE in the standard model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6110 LNCS, pp. 553–572). https://doi.org/10.1007/978-3-642-13190-5_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
