Institutional Repository
| identity traceable attribute-based signature scheme | |
| Zhang Qiu-Pu; Xu Zhen; Ye Ding-Feng | |
| 2012 | |
| Source | Ruan Jian Xue Bao/Journal of Software
 |
| ISSN | 1000-9825 |
| Volume | 23Issue:9Pages:2449-2464 |
| English 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. © 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. |
| Indexed Type | EI |
| Keyword | Network Security |
| Department | (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 |
| Language | 中文 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/15184 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation 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. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment