电子学报 ›› 2020, Vol. 48 ›› Issue (10): 1993-2002.DOI: 10.3969/j.issn.0372-2112.2020.10.017

• 学术论文 • 上一篇    下一篇

一种支持算术张成程序的密文策略属性加密方案

魏铎, 高海英   

  1. 战略支援部队信息工程大学, 河南郑州 450001
  • 收稿日期:2019-06-10 修回日期:2020-04-12 出版日期:2020-10-25
    • 通讯作者:
    • 魏铎
    • 作者简介:
    • 高海英 女,1978年7月出生,河南沈丘人.2006年毕业于北京邮电大学,获军事学博士学位,现为信息工程大学教授,博士生导师.主要研究方向为密码算法设计和分析.
    • 基金资助:
    • 国家自然科学基金 (No.61702548,No.61601515); 河南省基础与前沿课题 (No.162300410192)

A Ciphertext-Policy Attribute-Based Encryption Scheme Supporting Arithmetic Span Program

WEI Duo, GAO Hai-ying   

  1. PLA SSF Information Engineering University, Zhengzhou, Henan 450001, China
  • Received:2019-06-10 Revised:2020-04-12 Online:2020-10-25 Published:2020-10-25
    • Corresponding author:
    • WEI Duo
    • Supported by:
    • National Natural Science Foundation of China (No.61702548, No.61601515); asic and Frontier Project of Henan Province (No.162300410192)

摘要: 密文策略属性加密方案适用于云环境中密文数据的访问控制.已有的支持算术张成程序的属性加密方案多是密钥访问策略的方案,且公开参数规模较大.本文利用双对偶向量空间(Dual Pair Vector Space,DPVS)技术,提出了一个公开参数长度固定、支持算术张成程序的密文策略属性加密方案.在新方案中,将密文相关的访问控制向量与随机矩阵结合,密钥相关的属性分量与熵扩张引理中的公开参量结合,设计方法对应了熵扩张引理中给出的密文和密钥分量的形式.最后,基于素数阶双线性熵扩张引理和k-Lin困难假设,证明了该方案具有适应安全性.新方案与已有支持算术张成程序的属性加密方案相比,实现了密文访问策略、公开参数长度固定且满足适应安全性.

关键词: 算术张成程序, 密文策略属性加密, 双线性熵扩张, k-Lin假设, 适应安全性

Abstract: Ciphertext-policy attribute-based encryption scheme is suitable for access control of ciphertext data in cloud environment. Most of the existing attribute-based encryption schemes supporting arithmetic span programs are key-policy schemes with large public parameter scale. By exploiting the double Dual Pair Vector Space (DPVS) technique, a ciphertext-policy attribute-based encryption scheme which has a fixed length of public parameters and supports arithmetic span programs is proposed in this paper. In this scheme, the ciphertext-related access control vector is combined with the random matrix, and the key-related attribute components are combined with the public parameters in the entropy expansion Lemma. The method is designed according to the form of ciphertext and key components given in the entropy expansion Lemma. Finally, the adaptive security of the scheme is proved based on the prime order bilinear entropy extension Lemma and k-Lin difficult assumption. Compared with the existing attribute-based encryption schemes which support arithmetic span programs, the new scheme has the advantages of ciphertext access policy, fixed length of public parameters and adaptive security.

Key words: arithmetic span program, ciphertext-policy attribute-based encryption, bilinear entropy expansion, k-linear assumption, adaptively secure

中图分类号: