支持复杂访问策略的属性基加密方案  

An attribute-based encryption scheme supporting complex access policies

作　　者：许城洲 李陆 张文涛[1] XU Cheng-zhou;LI Lu;ZHANG Wen-tao(China Aerospace Academy of Systems Science and Engineering,Beijing 100037;China Aerospace Science and Technology Corporation,Beijing 100048,China)

机构地区：[1]中国航天系统科学与工程研究院,北京100037 [2]中国航天科技集团有限公司,北京100048

出　　处：《计算机工程与科学》2023年第10期1779-1788,共10页Computer Engineering & Science

摘　　要：针对属性基加密的访问结构,提出一种支持复杂访问策略的属性基加密方案。方案将简化有序二元决策图(ROBDD)作为访问结构,用户属性集对应ROBDD中一个路径,ROBDD不仅可以表示任何关于属性的布尔函数,还能通过简化访问结构中的节点减少有效路径,防止无关属性干扰,从而降低加密阶段的计算开销。通过布尔函数整合有效路径特征值,密文不用额外存储复杂访问策略中的多个有效路径特征值,降低了密文存储开销。方案将属性认证计算外包给解密服务器,降低了解密阶段用户本地计算开销;使用群元素幂运算代替双线性配对,降低了方案的计算开销。方案在安全模型中被证明是INDCPA安全的。性能分析和实验仿真表明,本文方案的计算开销和存储开销更低。Aiming at the access structure of attribute-based encryption,this paper proposes an attribute-based encryption scheme that supports complex access policies.The scheme uses reduced ordered binary decision diagrams(ROBDDs)as the access structure,where a user's attribute set corresponds to a path in the ROBDD.The ROBDD can not only represent any Boolean function about attributes,but also reduce valid paths by simplifying nodes in the access structure,thereby preventing interference from irrelevant attributes and reducing the computational cost in the encryption phase.By integrating effective path feature values into Boolean functions,the ciphertext does not need to store multiple effective path feature values in complex access policies,reducing the storage cost of the ciphertext.The scheme outsources attribute authentication computation to the decryption server,reducing the local computation cost of users in the decryption phase,and uses group element exponentiation instead of bilinear pairing to reduce the computational cost of the scheme.The security model proves that the scheme is IND-CPA secure,and performance analysis and experimental simulation show that the proposed scheme has lower computational and storage costs.

关 键 词：属性基加密 简化有序二元决策图 支持复杂访问策略 轻量级运算 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]