Cryptology ePrint Archive: Report 2015/815

On the Power of Hierarchical Identity-Based Encryption

Mohammad Mahmoody and Ameer Mohammed

Abstract: We prove that there is no fully black-box construction of collision-resistant hash functions (CRH) from hierarchical identity-based encryption (HIBE) with arbitrary polynomial number of identity levels. As a corollary we obtain a series of separations showing that none of the primitives implied by HIBE in a black-box way (e.g., IBE, CCA-secure public-key encryption) can be used in a black-box way to construct fully homomorphic encryption or any other primitive that is known to imply CRH in a black-box way. To the best of our knowledge, this is the first limitation proved for the power of HIBE.

Our proof relies on the reconstruction paradigm of Gennaro and Trevisan (FOCS 2000) and Haitner et al (FOCS 2007) and extends their techniques for one-way and trapdoor permutations to the setting of HIBE. A technical challenge for our separation of HIBE stems from the adaptivity of the adversary who is allowed to obtain keys for different identities before she selects the attacked identity. Our main technical contribution is to show how to achieve compression/reconstruction in the presence of such adaptive adversaries.

Category / Keywords: Foundations, Hierarchical Identity-based Encryption, Collision Resistant Hashing, Homomorphic Encryption, Black-Box Separations.

Date: received 16 Aug 2015, last revised 14 Sep 2015

Contact author: mahmoody at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20150914:073505 (All versions of this report)

Short URL: ia.cr/2015/815

Discussion forum: Show discussion | Start new discussion