摘要
提出了一种基于访问树的属性基签名算法,签名算法采用访问树结构有效地解决了门限属性基签名方案中阈值对签名算法的限制。该算法无需限定属性个数,可以灵活地设定签名策略。算法安全性证明基于标准模型而不是随机预言机模型,在标准模型中将算法的安全性归约到判定BDH困难假设。
An attribute-based signature with access tree (AT) is presented in this paper. By building AT access control structure, the new scheme can solve the shortage that signature algorithms are always limited by the threshold in threshold attribute-based signature schemes. Our scheme need not constrain the number of attribute set and provides more flexibility in signature strategy. The security of our scheme is proved under the standard model rather than random oracle model.
出处
《电子科技大学学报》
EI
CAS
CSCD
北大核心
2013年第3期410-414,共5页
Journal of University of Electronic Science and Technology of China
基金
国家自然科学基金(61170241)
四川省重点实验室开放课题基金
黑龙江省自然科学基金面上项目(F201229)
关键词
访问树
属性基
判定BDH
签名
标准模型
access tree
attribute-based
decisional bilinear Diffie-Hellman
signature
standard model