引用本文:张秋璞,徐震,叶顶锋.一个可追踪身份的基于属性签名方案.软件学报,2012,23(9):2449-2464
【打印本页】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览 5026次   下载 8773 本文二维码信息
码上扫一扫!
分享到: 微信 更多
一个可追踪身份的基于属性签名方案
张秋璞1,2, 徐震3, 叶顶锋1,2
1.信息安全国家重点实验室(中国科学院 研究生院),北京 100049;2.中国科学院 数据与通信保护研究教育中心,北京 100049;3.信息安全国家重点实验室(中国科学院 软件研究所),北京 100190
摘要:
基于属性的签名(attribute-based signature,简称ABS)方案可以隐藏签名者的身份.为了防止签名者滥用签名,Escala,Herranz 和Morillo 提出了一种可追踪签名者身份的基于属性签名方案(EHM-ABS),其中使用了自同构签名,并多次使用了非交互证据不可区分(non-interactive witness indistinguishable,简称NIWI)的证明.在Boyen 和Waters 的基于ID 的紧致群签名方案的基础上,在标准模型下提出了一种可追踪身份的ABS 方案.在颁发属性私钥时嵌入签名者的身份,并对身份使用比特加密的NIWI 证明来实现可追踪性.与EHM-ABS 相比,当声明的属性集合的阶大于ID 的比特长度的1/4 时,该方案减少了使用NIWI 证明的次数,且无须使用自同构签名.该方案的安全性基于子群判定假设和CDH 假设.
关键词:  基于属性签名  可追踪性  不可联系性  不可陷害性  双线性对
DOI:10.3724/SP.J.1001.2012.04172
分类号:
基金项目:
Identity Traceable Attribute-Based Signature Scheme
ZHANG Qiu-Pu1,2, XU Zhen3, YE Ding-Feng1,2
1.State Key Laboratory of Information Security (Graduate University, The Chinese Academy of Sciences), Beijing 100049, China;2.The Data Assurance and Communication Security Research Center, The Chinese Academy of Sciences, Beijing 100049, China;3.State Key Laboratory of Information Security (Institute of Software, The Chinese Academy of Sciences), Beijing 100190, China
Abstract:
In an attribute-based signature (ABS) scheme, the signer’s identity keeps anonymous. To prevent the signer from abusing this property, Escala, Herranz, and Morillo proposed an identity traceable attribute-based signature scheme (EHM-ABS). Their scheme used an automorphic signature, and applied the non-interactive witness indistinguishable (NIWI) proofs many times. Inspired by Boyen, and Waters’ identity-based compact group signature scheme, the study presents an identity traceable ABS scheme in the standard model. When issuing the attribute private key, the signer’s identity is embedded. By using the NIWI proof of encrypting each bit of identity, this scheme achieves the traceability. To compare with EHM-ABS, this scheme reduces the number of applying the NIWI proofs when the order of the claimed attributes set is bigger than the quarter of the bit length of identity, and do not need to use automorphic signature. The security of this proposed scheme is based on the subgroup dicision and the computational diffie-Hellman assumptions.
Key words:  attribute-based signature  traceability  unlinkability  non-frameability  bilinear pairings

引用本文:
【打印本页】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览次   下载  
分享到: 微信 更多
摘要:
关键词:  
DOI:
分类号:
基金项目:
Abstract:
Key words: