一个可追踪身份的门限属性签名方案
在基于属性的签名中, 签名者的身份是由一系列属性组成的集合来表示且满足匿名性, 但同时签名者也可以利用这一特性滥用签名。提出了一个可追踪身份的门限属性签名方案, 它利用PKG生成的追踪密钥和比特加密的非交互证据不可区分证明, 实现了属性签名的可追踪性和不可联系性。方案的安全性基于计算性Diffie-Hellman假设, 与现有方案相比, 公钥长度、私钥长度和签名运算量明显减少, 适用于通信网络带宽受限的环境。...
Saved in:
| Published in | 计算机应用研究 Vol. 31; no. 1; pp. 206 - 209 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | Chinese |
| Published |
武警工程大学电子技术系网络与信息安全研究所,西安710086
2014
武警工程大学电子技术系网络与信息安全武警部队重点实验室,西安,710086%武警工程大学电子技术系网络与信息安全武警部队重点实验室,西安710086 |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1001-3695 |
| DOI | 10.3969/j.issn.1001-3695.2014.01.048 |
Cover
| Summary: | 在基于属性的签名中, 签名者的身份是由一系列属性组成的集合来表示且满足匿名性, 但同时签名者也可以利用这一特性滥用签名。提出了一个可追踪身份的门限属性签名方案, 它利用PKG生成的追踪密钥和比特加密的非交互证据不可区分证明, 实现了属性签名的可追踪性和不可联系性。方案的安全性基于计算性Diffie-Hellman假设, 与现有方案相比, 公钥长度、私钥长度和签名运算量明显减少, 适用于通信网络带宽受限的环境。 |
|---|---|
| Bibliography: | 51-1196/TP attribute-based signature traceability unlinkability computational Diffie-Hellman assumption In an attribute-based signature scheme, one＇s identity is taken the set of attributes and can keep anonymous. But the signer could abuse this signature with the property at the same time. The paper proposed an identity traceable threshold attribute-based signature scheme. By using the traceable key and the non-interactive witness indistinguishable proof of encrypting each bit of identity, the attribute-based signature scheme achieved the traceability and unlingability. The security the scheme was based on the computational Diffie-Hellman assumption. Compared with the existing schemes, the scheme has the shorter public key, private key and the computation of signature, and is fit for the bandwidth-constrained condition. XING Han-rui, LU Wan-yi, WEI Li-xian, HAN Yi-liang （ a. Key Laboratory of Network ＆ Information Security under the Chinese Armed Police Force, b. Institute of Network ＆ Information Security unde |
| ISSN: | 1001-3695 |
| DOI: | 10.3969/j.issn.1001-3695.2014.01.048 |