Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE

By Shweta Agrawal, Dan Boneh, and Xavier Boyen.

In Advances in Cryptology (CRYPTO 2010), volume 6223 of Lecture Notes in Computer Science, pages 98-115. Springer, 2010.

Abstract

We propose an efficient basis delegation mechanism for hard integer lattices, that has the advantage of keeping the lattice dimension unchanged upon delegation. Building on this result, we construct two efficient hierarchical identity-based encryption or HIBE schemes (with and without random oracles) that are significantly more compact than earlier lattice-based constructions, and prove their security from classic lattice hardness assumptions.

Material

- published paper (PS) (PDF) (also accessible from the publisher) © IACR
- full version (PS) (PDF)
- presentation slides (HTML)

Reference

@InProceedings{Agrawal+Boneh+Boyen:CRYPTO-2010:lattice,
  author = {Shweta Agrawal and Dan Boneh and Xavier Boyen},
  title = {Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE},
  booktitle = {Advances in Cryptology---CRYPTO 2010},
  series = {Lecture Notes in Computer Science},
  volume = {6223},
  pages = {98--115},
  publisher = {Berlin: Springer-Verlag},
  year = {2010},
  note = {Available at \url{http://www.cs.stanford.edu/~xb/crypto10/}}
}
      


Unless indicated otherwise, these documents are Copyright © Xavier Boyen; all rights reserved in all countries.
Back to Xavier's homepage