Multi-authority attribute-based encryption with honest-but-curious central authority
Multi-authority attribute-based encryption with honest-but-curious central authority
复制标题
DOI：
10.1080/00207160.2011.555642
复制
发表时间：
2012-01-01
影响因子：
1.8
通讯作者：
Villanyi, Viktoria I.
中科院分区：
文献类型：
--
作者：
Bozovic, Vladimir;Socek, Daniel;Villanyi, Viktoria I.
Chase最近提出了一种能够处理多个授权的基于属性的加密方案。该方案建立在Sahai和沃茨早先提出的基于属性的单授权加密方案之上。Chase的构造使用了一个可信的中央权威机构，该机构天生就能够解密系统内创建的任意密文。本文提出了一种基于属性的多授权加密方案，在该方案中，只有加密方定义的接收者集合才能解密相应的密文。中央权威被视为“诚实但好奇”：一方面，它诚实地遵循协议，另一方面，它好奇地解密任意密文，从而违反加密方的意图。建议的计划，它像它的前辈依赖于双线性Diffie-Hellman假设，有一个复杂的大通计划。我们证明了我们的方案是安全的选择性ID模型，可以容忍一个诚实的，但好奇的中央权威。
An attribute-based encryption scheme capable of handling multiple authorities was recently proposed by Chase. The scheme is built upon a single-authority attribute-based encryption scheme presented earlier by Sahai and Waters. Chase's construction uses a trusted central authority that is inherently capable of decrypting arbitrary ciphertexts created within the system. We present a multi-authority attribute-based encryption scheme in which only the set of recipients defined by the encrypting party can decrypt a corresponding ciphertext. The central authority is viewed as 'honest-but-curious': on the one hand, it honestly follows the protocol, and on the other hand, it is curious to decrypt arbitrary ciphertexts thus violating the intent of the encrypting party. The proposed scheme, which like its predecessors relies on the Bilinear Diffie-Hellman assumption, has a complexity comparable to that of Chase's scheme. We prove that our scheme is secure in the selective ID model and can tolerate an honest-but-curious central authority.