You are looking at a specific version 20060608:225710 of this paper. See the latest version.

Paper 2006/085

Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)

Xavier Boyen and Brent Waters

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.

Metadata
Available format(s)
PDF PS
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
Linear assumptionbilinear mapsstandard model
Contact author(s)
xb @ boyen org
History
2006-06-08: revised
2006-03-06: received
See all versions
Short URL
https://ia.cr/2006/085
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.