ISCAS OpenIR
identity traceable attribute-based signature scheme
Zhang Qiu-Pu; Xu Zhen; Ye Ding-Feng
2012
发表期刊Ruan Jian Xue Bao/Journal of Software
ISSN1000-9825
卷号23期号:9页码:2449-2464
摘要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. © 2012 ISCAS.; 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. © 2012 ISCAS.
收录类别EI
关键词Network Security
部门归属(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
语种中文
内容类型期刊论文
URI标识http://ir.iscas.ac.cn/handle/311060/15184
专题中国科学院软件研究所
推荐引用方式
GB/T 7714
Zhang Qiu-Pu,Xu Zhen,Ye Ding-Feng. identity traceable attribute-based signature scheme[J]. Ruan Jian Xue Bao/Journal of Software,2012,23(9):2449-2464.
APA Zhang Qiu-Pu,Xu Zhen,&Ye Ding-Feng.(2012).identity traceable attribute-based signature scheme.Ruan Jian Xue Bao/Journal of Software,23(9),2449-2464.
MLA Zhang Qiu-Pu,et al."identity traceable attribute-based signature scheme".Ruan Jian Xue Bao/Journal of Software 23.9(2012):2449-2464.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Zhang Qiu-Pu]的文章
[Xu Zhen]的文章
[Ye Ding-Feng]的文章
百度学术
百度学术中相似的文章
[Zhang Qiu-Pu]的文章
[Xu Zhen]的文章
[Ye Ding-Feng]的文章
必应学术
必应学术中相似的文章
[Zhang Qiu-Pu]的文章
[Xu Zhen]的文章
[Ye Ding-Feng]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。