Team for Research in
Ubiquitous Secure Technology

Citation
D. Boneh, E.-J. Goh, X. Boyen. "• Hierarchical Identity Based Encryption with Constant Size Ciphertext". Eurocrypt, 440-456, 2005.

Abstract
We present a Hierarchical Identity Based Encryption (HIBE) system where the ciphertext consists of just three group elements and decryption requires only two bilinear map computations, independent of the hierarchy depth. Encryption is as efficient as in other HIBE systems. We prove that the scheme is selective-ID secure in the standard model and fully secure in the random oracle model. Our system has a number of applications: it gives a very efficient forward secure encryption system (where ciphertexts are short), it converts the NNL broadcast encryption system into an efficient public key broadcast system, and it provides an efficient mechanism for encrypting to the future. The system also supports limited delegation where users can be given restricted private keys that only allow delegation to certain descendants. Sublinear size private keys can also be achieved at the expense of some ciphertext expansion.

Electronic downloads

• http://crypto.stanford.edu/~dabo/papers/shibe.pdf

• HTML

  D. Boneh, E.-J. Goh, X. Boyen. <a
  href="http://www.truststc.org/pubs/606.html"
  >•	Hierarchical Identity Based Encryption
  with Constant Size Ciphertext</a>, Eurocrypt, 440-456,
  2005.

• Plain text

  D. Boneh, E.-J. Goh, X. Boyen.
  "•	Hierarchical Identity Based Encryption
  with Constant Size Ciphertext". Eurocrypt, 440-456,
  2005.

• BibTeX

  @inproceedings{BonehGohBoyen05_HierarchicalIdentityBasedEncryptionWithConstantSize,
      author = {D. Boneh and E.-J. Goh and X. Boyen},
      title = {•	Hierarchical Identity Based Encryption with
                Constant Size Ciphertext},
      booktitle = {Eurocrypt},
      pages = {440-456},
      year = {2005},
      abstract = {We present a Hierarchical Identity Based
                Encryption (HIBE) system where the ciphertext
                consists of just three group elements and
                decryption requires only two bilinear map
                computations, independent of the hierarchy depth.
                Encryption is as efficient as in other HIBE
                systems. We prove that the scheme is selective-ID
                secure in the standard model and fully secure in
                the random oracle model. Our system has a number
                of applications: it gives a very efficient forward
                secure encryption system (where ciphertexts are
                short), it converts the NNL broadcast encryption
                system into an efficient public key broadcast
                system, and it provides an efficient mechanism for
                encrypting to the future. The system also supports
                limited delegation where users can be given
                restricted private keys that only allow delegation
                to certain descendants. Sublinear size private
                keys can also be achieved at the expense of some
                ciphertext expansion.},
      URL = {http://www.truststc.org/pubs/606.html}
  }
  

Posted by Jessica Gamble on 16 Mar 2009.
For additional information, see the Publications FAQ or contact webmaster at www truststc org.