Contributory Broadcast Encryption with Efficient Encryption and Short Ciphertexts
Contributory Broadcast Encryption with Efficient Encryption and Short Ciphertexts
复制标题
具有高效加密和短密文的贡献广播加密
DOI：
10.1109/tc.2015.2419662
复制
发表时间：
2016-02-01
影响因子：
3.7
通讯作者：
Manjon, Jesus A.
中科院分区：
文献类型：
--
作者：
Wu, Qianhong;Qin, Bo;Manjon, Jesus A.
广播加密（BE）方案允许发送者安全地向成员的任何子集广播，但需要可信方分发解密密钥。组密钥协商（GKA）协议使得一组成员能够经由开放网络协商公共加密密钥，使得只有组成员能够解密在共享加密密钥下加密的密文，但是发送方不能排除任何特定成员解密密文。在本文中，我们桥这两个概念的混合原语称为贡献广播加密（ConBE）。在这个新原语中，一组成员协商一个公共加密密钥，而每个成员持有一个解密密钥。发送者看到公共组加密密钥后，可以将解密限制在他选择的成员的子集内。根据这个模型，我们提出了一个短密文的ConBE方案。在标准模型下的决策n-双线性Diffie-Hellman指数（BDHE）假设下，证明了该方案是完全抗共谋的。独立的利益，我们提出了一个新的BE计划，是可聚合的。可聚合性属性被证明是有用的构造高级协议。
Broadcast encryption (BE) schemes allow a sender to securely broadcast to any subset of members but require a trusted party to distribute decryption keys. Group key agreement (GKA) protocols enable a group of members to negotiate a common encryption key via open networks so that only the group members can decrypt the ciphertexts encrypted under the shared encryption key, but a sender cannot exclude any particular member from decrypting the ciphertexts. In this paper, we bridge these two notions with a hybrid primitive referred to as contributory broadcast encryption (ConBE). In this new primitive, a group of members negotiate a common public encryption key while each member holds a decryption key. A sender seeing the public group encryption key can limit the decryption to a subset of members of his choice. Following this model, we propose a ConBE scheme with short ciphertexts. The scheme is proven to be fully collusion-resistant under the decision n-Bilinear Diffie-Hellman Exponentiation (BDHE) assumption in the standard model. Of independent interest, we present a new BE scheme that is aggregatable. The aggregatability property is shown to be useful to construct advanced protocols.