TY - GEN
T1 - A fair concurrent signature scheme based on identity
AU - Huang, Xiaofang
AU - Wang, Licheng
PY - 2010
Y1 - 2010
N2 - 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 signer's signature, but not the initial signer's. 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.
AB - 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 signer's signature, but not the initial signer's. 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.
KW - Ambiguity
KW - Bilinear pairings
KW - Concurrent signature
KW - Fairness
UR - https://www.scopus.com/pages/publications/77951518384
U2 - 10.1007/978-3-642-11842-5_26
DO - 10.1007/978-3-642-11842-5_26
M3 - Conference contribution
AN - SCOPUS:77951518384
SN - 3642118410
SN - 9783642118418
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 198
EP - 205
BT - High Performance Computing and Applications - Second International Conference, HPCA 2009, Revised Selected Papers
T2 - 2nd International Conference on High-Performance Computing and Applications, HPCA 2009
Y2 - 10 August 2009 through 12 August 2009
ER -