一种新的基于属性的广播签名算法  

A Novel Attribute-Based Broadcast Signature Algorithm

作　　者：张焱[1] 杨庚[1] 陈伟[1] 

机构地区：[1]南京邮电大学计算机学院,江苏南京210003

出　　处：《计算机技术与发展》2010年第2期40-43,共4页Computer Technology and Development

基　　金：国家自然科学基金项目(60873231);江苏省高校自然科学基金项目(08KJB520006);江苏省"六大人才高峰"基金项目(06-E-044)

摘　　要：针对现有基于ABE广播签名算法的复杂性,提出了一个新的基于属性的广播签名算法。现有的基于ABE的广播网签名算法,每次通信需要传输签名认证所需的线性秘密共享矩阵M,在通信量和用户存储能力上要求很高。该文的基于属性的签名算法是在CP-ABE的基础上发展来的,但此算法使用了新的接入策略,即使用求最大公约数(GCD)的方法取消了对线性秘密共享矩阵M的需求,接收者只需计算3个双线性对即可完成签名认证。此算法降低了通信量和接收者运算复杂度,对某些能量受限的网络,如Ad Hoc网络,有很好的适应性。For the complexity of the existing broadcast signature algorithms based on the ABE,propose a new signature algorithm based on the attributes. In the existing ABE broadcast signature scheme, senders need to transmit the linear secret sharing matrix M, which causes the heavy traffic and requires lots of storage space of receivers. Scheme based on the CP - ABE has different access policy, which computes the greatest common divisor of polynomial（GCD） instand of the linear secret sharing matrix M. In return, a receiver performs only 3 pairing computations. The traffic and the receivers＇ computing complexity are reduced in this scheme. This algorithm is also adapted to the resouree- restricted networks, such as Ad Hoe networks.

关 键 词：ABE 最大公约数 广播 签名 

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