TY - GEN
T1 - Cryptanalysis and improvement of a concurrent signature scheme based on identity
AU - Zhang, Zhong
AU - Xu, Shuo
PY - 2011
Y1 - 2011
N2 - Concurrent signatures were introduced as an alternative approach to solving the problem of fair exchange of signatures by Chen et al.[1], in which two entities can produce two signatures that are not binding, until the keystone is released by one of the parties. Recently, Huang et al.[10] proposed a more ambiguity and stronger fairness concurrent signature scheme based on identity. However, we will show that their scheme did not satisfy the strong unforgeability properties, and was vulnerable to forgery attack. Then, we propose an improved scheme to prevent such attack.
AB - Concurrent signatures were introduced as an alternative approach to solving the problem of fair exchange of signatures by Chen et al.[1], in which two entities can produce two signatures that are not binding, until the keystone is released by one of the parties. Recently, Huang et al.[10] proposed a more ambiguity and stronger fairness concurrent signature scheme based on identity. However, we will show that their scheme did not satisfy the strong unforgeability properties, and was vulnerable to forgery attack. Then, we propose an improved scheme to prevent such attack.
KW - Bilinear pairings
KW - Concurrent signature
KW - Digital signature
KW - Identity-based
UR - http://www.scopus.com/inward/record.url?scp=80052503010&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80052503010&partnerID=8YFLogxK
U2 - 10.1109/ICSESS.2011.5982351
DO - 10.1109/ICSESS.2011.5982351
M3 - Conference contribution
AN - SCOPUS:80052503010
SN - 9781424496969
T3 - ICSESS 2011 - Proceedings: 2011 IEEE 2nd International Conference on Software Engineering and Service Science
SP - 453
EP - 456
BT - ICSESS 2011 - Proceedings
T2 - 2011 IEEE 2nd International Conference on Software Engineering and Service Science, ICSESS 2011
Y2 - 15 July 2011 through 17 July 2011
ER -