Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)

By Xavier Boyen and Brent Waters.

In Advances in Cryptology (CRYPTO 2006), volume 4117 of Lecture Notes in Computer Science, pages 290-307. Springer, 2006.

Abstract

We present an identity-based cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the mild Decision Linear complexity assumption in bilinear groups. The system is efficient and practical, with small ciphertexts of size linear in the depth of the hierarchy. Applications include search on encrypted data, fully private communication, etc.

Our results resolve two open problems pertaining to anonymous identity-based encryption, our scheme being the first to offer provable anonymity in the standard model, in addition to being the first to realize fully anonymous HIBE at all levels in the hierarchy.

Material

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

Reference

@InProceedings{Boyen+Waters:CRYPTO-2006:anonymoushibe,
  author = {Xavier Boyen and Brent Waters},
  title = {Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)},
  booktitle = {Advances in Cryptology---CRYPTO 2006},
  series = {Lecture Notes in Computer Science},
  volume = {4117},
  pages = {290--307},
  publisher = {Berlin: Springer-Verlag},
  year = {2006},
  note = {Available at \url{http://www.cs.stanford.edu/~xb/crypto06a/}}
}
      


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