Efficient Lattice (H)IBE in the Standard Model

  • Shweta Agrawal
  • Dan Boneh
  • Xavier Boyen
Conference paper

DOI: 10.1007/978-3-642-13190-5_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6110)
Cite this paper as:
Agrawal S., Boneh D., Boyen X. (2010) Efficient Lattice (H)IBE in the Standard Model. In: Gilbert H. (eds) Advances in Cryptology – EUROCRYPT 2010. EUROCRYPT 2010. Lecture Notes in Computer Science, vol 6110. Springer, Berlin, Heidelberg

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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Shweta Agrawal
    • 1
  • Dan Boneh
    • 2
  • Xavier Boyen
    • 3
  1. 1.University of Texas, Austin 
  2. 2.Stanford University 
  3. 3.Université de LiègeBelgium

Personalised recommendations