定长密文且快速解密的分布式属性基加密方案研究

发布时间：2018-08-31 21:07

【摘要】：属性基加密因其细粒度访问控制在云存储中得到广泛应用。但原始属性基加密方案中单授权机构带来了分发私钥的计算瓶颈与信任问题。为解决上述问题,该文基于素数阶双线性群构造了一种分布式属性基加密方案,方案中授权机构由多个权威中心和多个属性中心组成。权威中心负责系统建立及用户身份相关密钥生成,且每次用户私钥申请过程中只需一个权威中心参与工作,采用多权威中心的目的是提高系统的稳定性和降低权威中心的计算量;属性中心负责不同的属性域,相互独立甚至不需要知道其它属性中心的存在。同时,该方案的密文长度与属性数量无关,为一个常值;在解密运算过程中需要的对运算与属性数量也无关,为2个对运算。该文基于q-Bilinear Diffie-Hellman Exponent假设在随机预言机模型下对方案进行了选择明文攻击的安全性证明。最后从理论和实验两方面对所提方案的功能与效率进行了分析与验证。实验结果表明所提方案具有固定密文长度和快速解密的能力,大大减少了存储负担并提高了系统效率。
[Abstract]:Attribute-based encryption is widely used in cloud storage because of its fine-grained access control. However, in the original attribute-based encryption scheme, single-authority brings about the bottleneck and trust problem of private key distribution. In order to solve the above problem, a distributed attribute-base encryption scheme based on the bilinear group of prime order is proposed in this paper. In the scheme, the authority is composed of multiple authority centers and multiple attribute centers. The authority center is responsible for the establishment of the system and the generation of the user's identity-related key, and only one authority center is required to participate in the process of applying for the user's private key. The purpose of adopting multi-authority center is to improve the stability of the system and reduce the computational complexity of the authority center, and the attribute center is responsible for different attribute domains, independent of each other, and does not even need to know the existence of other attribute centers. At the same time, the ciphertext length of the scheme is independent of the number of attributes and is a constant value, and the pair operation required in the decryption operation is also independent of the number of attributes, being two pairs of operations. In this paper, based on the q-Bilinear Diffie-Hellman Exponent hypothesis, the security proof of the selective plaintext attack is given under the random oracle model. Finally, the function and efficiency of the proposed scheme are analyzed and verified theoretically and experimentally. The experimental results show that the proposed scheme has the capability of fixed ciphertext length and fast decryption, which greatly reduces the storage burden and improves the system efficiency.
【作者单位】：信息工程大学三院;
【基金】：国家973计划项目(2013CB 338000) 国家重点研发计划(2016YFB0501900)~~
【分类号】：TP309.7

【相似文献】