首页> 外文会议>Applied cryptography and network security >How to Construct Interval Encryption from Binary Tree Encryption
【24h】

How to Construct Interval Encryption from Binary Tree Encryption

机译:如何从二叉树加密中构造时间间隔加密

获取原文
获取原文并翻译 | 示例

摘要

In a broadcast encryption system with a total of n users, each user is assigned with a unique index i e [l,n]. An encryptor can choose a receiver set S c [l,n] freely and encrypt a message for the recipients in S such that only those receivers can open the message. The transmission overload of most previous broadcast encryption systems grows in line with the number of revoked users r and thus they are suitable for the scenario where the target receiver set is large when r ? n holds. Some other recently proposed constructions for arbitrary receiver set require a unreasonably large user storage and long decryption time. On the other hand, it is observed that, in a practical broadcast encryption system, the receiver set can be regarded as a collection of k natural intervals, where the interval number k should be much less than r for most cases. This observation motivates us to introduce a novel type of encryption, called interval encryption, which could realize a more efficient broadcast encryption. To achieve this, we first present a generic way to transform a binary tree encryption scheme into interval encryption. One concrete instantiation of this method based on the hierarchical identity based encryption scheme by Boneh et al. only requires a O(k) transmission cost and O(log n) private storage consumption, while the decryption is dominated by O(log n) group operations. With detailed performance analysis, we demonstrate that the proposed interval encryption strategy has the superiority on improved efficiency and thus is expected to serve as a more efficient solution in more cases than the traditional systems in practice. Interestingly, our methodology can also be employed to transform a fully secure hierarchical identity based encryption scheme proposed by Lewko and Waters into an adaptively secure interval encryption scheme with a O(k) transmission cost and O(log n) private storage consumption. Finally, we also discuss several other promising applications of interval encryption.
机译:在总共有n个用户的广播加密系统中,每个用户都分配有唯一索引i e [1,n]。加密者可以自由选择接收者集S c [l,n],并为S中的接收者加密消息,以便只有那些接收者才能打开消息。大多数先前的广播加密系统的传输过载与被撤销的用户r的数量成正比,因此它们适合于当r≥r时目标接收器集很大的情况。 n成立。最近针对任意接收器集提出的其他一些构造要求不合理的大用户存储和长解密时间。另一方面,可以观察到,在实际的广播加密系统中,可以将接收器集视为k个自然间隔的集合,其中在大多数情况下,间隔数k应该远小于r。这种观察促使我们引入一种新型的加密方法,称为间隔加密,它可以实现更有效的广播加密。为此,我们首先提出一种将二叉树加密方案转换为区间加密的通用方法。这种方法的一个具体实例是基于Boneh等人的基于分层身份的加密方案。只需要O(k)传输成本和O(log n)私有存储消耗,而解密则由O(log n)组操作控制。通过详细的性能分析,我们证明了所提出的间隔加密策略在提高效率方面具有优势,因此有望在实践中比传统系统在更多情况下提供更有效的解决方案。有趣的是,我们的方法还可以用于将Lewko和Waters提出的完全安全的基于分层身份的加密方案转换为自适应安全间隔加密方案,其传输成本为O(k),私有存储消耗为O(log n)。最后,我们还讨论了区间加密的其他一些有希望的应用。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号