Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)

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 identitybased 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.

• Type: Conference
• Year: 2006
• Where: CRYPTO
• Authors: Xavier Boyen, Brent Waters
• Keywords: CRYPTO 2006, Cryptology, Hierarchical Key Delegation, Linear Complexity Assumption, Standard Model