A Fair Concurrent Signature Scheme Based on Identity
The concept of concurrent signatures was introduced by Chen, Kudla and Paterson at Eurocrypt 2004, which allows two parties to produce two ambiguous signatures until the initial signer releases an extra piece of information (called keystone). Once the keystone is released, both signatures are bound to their true signers concurrently. However, Susilo, Mu and Zhang pointed out the original concurrent signature is not ambiguous to any third party if both signers are known to be trustworthy, and further proposed perfect concurrent signatures to strengthen the ambiguity of concurrent signatures in ICICS 2004. Unfortunately, Susilo et al.s schemes are unfair for the matching signer because they enable the initial signer to release a carefully prepared keystone that binds the matching signers signature, but not the initial signers. Therefore, we present a fair identity based concurrent signature in an effective way to correct these flaws in ambiguity and fairness. Moreover, our scheme is more efficient than other concurrent signature schemes based on the bilinear paring.
concurrent signature bilinear pairings fairness ambiguity
Xiaofang Huang Licheng Wang
Department of Computer Science,Southwest University of Science and Technology Mianyang, Sichuan 6210 National Engineering Laboratory for Disaster Backup and Recovery, Beijing University of Posts and Te
国际会议
The Second International Conference on High Performance Computing and Applications(第二届高性能计算及应用国际会议)
上海
英文
198-205
2009-08-10（万方平台首次上网日期，不代表论文的发表时间）