On the Power of Hierarchical Identity-Based Encryption
On the Power of Hierarchical Identity-Based Encryption
复制标题
论基于身份的分层加密的威力
DOI：
--
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
Ameer Mohammed
中科院分区：
文献类型：
--
作者：
Mohammad Mahmoody;Ameer Mohammed
我们证明了具有任意多项式阶数的基于身份的分层加密HIBE的抗碰撞哈希函数CRH不存在完全的黑盒构造。据我们所知，这是证明HIBE的第一个限制。作为推论，我们得到了一系列与HIBE或CRH无关的分离，但它们本身就很有趣。也就是说，我们表明，不能以黑盒方式使用IBE和cca安全公钥加密等原语来构造完全同态加密或任何以黑盒方式暗示CRH的原语。
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. To the best of our knowledge this is the first limitation proved for HIBE. As a corollary, we obtain a series of separations that are not directly about HIBE or CRH but are interesting on their own right. Namely, we show that primitives such as IBE and CCA-secure public-key encryption cannot be used in a black-box way to construct fully homomorphic encryption or any primitive that implies CRH in a black-box way.
Our proof relies on the reconstruction paradigm of Gennaro and Trevisan FOCS 2000 and Haitner eti¾?al. FOCS 2007 and extends their techniques for one-way and trapdoor permutations to the setting of HIBE. A main technical challenge in the proof of our separation stems from the adaptivity of the HIBE adversary who is allowed to obtain keys for different identities before she selects the attacked identity. Our main technical contribution is to develop compression/reconstruction techniques that can be achieved relative to such adaptive attackers.