首页> 外文会议>Progress in Cryptology - AFRICACRYPT 2008 >Attribute-Based Broadcast Encryption SchemeMade Efficient
【24h】

Attribute-Based Broadcast Encryption SchemeMade Efficient

机译:高效的基于属性的广播加密方案

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

摘要

In this paper, we describe a new broadcast encryption scheme for stateless receivers. The main difference between our scheme and the classical ones derived from the complete subtree paradigm is that the group of privileged users is described by attributes. Actually, some real applications have been described where the use of a more adaptable access structure brings more efficiency and ease of deployment. On the other side, the decryption algorithm in so far existing attribute-based encryption schemes adapted for broadcast applications is time-consuming for the receiver, since it entails the computation of a large number of pairings. This is a real drawback for broadcast applications where most of the technological constraints are on the receiver side. Our scheme can be viewed as a way to benefit at the same time from the performance of decryption of the classical broadcast schemes and the management easiness provided by the use of a more adaptable data structure based on attributes. More precisely, our scheme allows one to select or revoke users by sending ciphertexts of linear size with respect to the number of attributes, which is in general far less than the number of users. We prove that our scheme is fully collusion secure in the generic model of groups with pairing.
机译:在本文中,我们描述了一种针对无状态接收器的新广播加密方案。我们的方案与从完整子树范式派生的经典方案之间的主要区别在于特权用户组由属性描述。实际上,已经描述了一些实际的应用程序,其中使用更具适应性的访问结构可带来更高的效率和部署的便利性。另一方面,到目前为止,适用于广播应用的现有基于属性的加密方案中的解密算法对于接收机来说是耗时的,因为它需要计算大量的配对。对于大多数技术限制都在接收器侧的广播应用而言,这是一个真正的缺陷。我们的方案可以看作是同时受益于经典广播方案的解密性能和通过使用基于属性的更适应数据结构所带来的管理简便性的一种方法。更准确地说,我们的方案允许用户通过发送相对于属性数量呈线性大小的密文来选择或撤销用户,而密文通常远少于用户数量。我们证明了我们的方案在具有配对的组的通用模型中是完全合谋安全的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号