首页> 外文会议>International Conference on 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 ∈ [1,n]. An encryptor can choose a receiver set S c [1,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(logn) private storage consumption. Finally, we also discuss several other promising applications of interval encryption.
机译:在具有总共N个用户的广播加密系统中,每个用户都被分配有唯一索引I∈[1,n]。加密器可以自由地选择接收器设置的C [1,N]并在s中加密消息,使得只有那些接收器可以打开消息。大多数先前广播加密系统的传输过载符合撤销用户r的数量,因此它们适用于当R n保持时的目标接收器集的场景。关于任意接收器组的其他一些最近提出的结构需要一个不合理的大用户存储和长解密时间。另一方面,观察到,在实际广播加密系统中,接收器集可以被视为k自然间隔的集合,其中大多数情况下,间隔数k应该远小于r。此观察结果激励我们引入一种新型的加密,称为间隔加密,这可以实现更有效的广播加密。为此,我们首先介绍一种将二进制树加密方案转换为间隔加密的通用方法。基于基于分层标识的加密方案的这种方法的一种具体实例化。只需要O(k)传输成本和O(log n)私有存储消耗,而解密由O(log n)组操作主导。通过详细的性能分析,我们证明所提出的间隔加密策略对提高效率的优势具有优势,因此预计将在比在实践中的传统系统更高的情况下作为更有效的解决方案。有趣的是,我们的方法也可以用于将Lewko和Waters提出的基于完全安全的分层标识的加密方案转换为具有O(k)传输成本和O(LOGN)私有存储消耗的自适应安全的间隔加密方案。最后,我们还讨论了几个不同的间隔加密应用程序。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号