Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Conference on Communication Software and Networks

New Optimistic Fair Exchange Protocol Based on Short Signature

Yanbin Sun, Lize Gu, Sihan Qing, Shihui Zheng, Yixian Yang, Yan Sun

Published Jan 1, 2010• 7 citations
Publisher

Abstract

In CIS2008, Gao et al. suggested an abuse-free optimistic fair exchange protocol based on the short signature. Their scheme is very efficient in terms of communication. In this paper, we point out that their scheme has two weaknesses. These weaknesses may lead to an unfair situation that Bob may obtain Alice's signature, but Alice can not obtain Bob's signature. In order to overcome these weaknesses, we propose a new secure abuse-free optimistic fair exchange protocol. In the new protocol, both parties can contact the trusted third party and settle the argument before the deadline. Moreover, we give a formal proof of fairness in the strand space model.

DOI
10.1109/iccsn.2010.9

Related papers

An Abuse-Free Fair Contract-Signing Protocol Based on the RSA Signature

Guilin Wang

A fair contract-signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in afairway, so that either each of them obtains the other's signature, or neither party does. Based on the RSA signature scheme, a new digital contract-signing protocol is proposed in this paper. Like the existing RSA-based solutions for the same problem, our protocol is not only fair, but also optimistic, since the trusted third party is involved only in the situations where one party is cheating or the communication channel is interrupted. Furthermore, the proposed protocol satisfies a new property-abuse-freeness. That is, if the protocol is executed unsuccessfully, none of the two parties can show the validity of intermediate results to others. Technical details are provided to analyze the security and performance of the proposed protocol. In summary, we present the first abuse-free fair contract-signing protocol based on the RSA signature, and show that it is both secure and efficient.

IEEE Transactions on Information Forensics and Security•Nov 13, 2009•49 citations

New Optimistic Fair Exchange Protocol Based on VE-RSA Signature

Lize Gu, Yanbin Sun

Recently, Zhou et al. proposed a verifiably encrypted RSA (VE-RSA) signature scheme, which was used to convince that an encrypted message is a certain party's signature on a message while without revealing the signature. In this paper, we propose a new optimistic fair exchange protocol based on the verifiably encrypted RSA signature scheme. In our scheme, both parties can contact the TTP and settle the argument before the deadline. Moreover, our new scheme achieves fairness and timeliness.

International Workshop on Education Technology and Computer Science•Jan 1, 2010•1 citation

Timeliness optimistic fair exchange protocol based on key-exposure-free chameleon hashing scheme

Yanbin Sun, Lize Gu, Sihan Qing +4 more

In ESS2008, Yang et al. suggested a key-exposure-free chameleon hashing scheme, and it can be used to design signature and some other cryptography mechanism. In this paper, we construct a new timeliness optimistic fair exchange protocol based on this key-exposure-free chameleon hashing scheme. The new scheme does not require the use of interactive zero-knowledge proofs in the exchange phase. In our scheme, both parties can contact the trusted third party and settle the argument before the deadline. Moreover, the new scheme achieves fairness and timeliness.

International Conference on Advanced Communication Technology•Feb 7, 2010•2 citations

A fair exchange protocol based on short signature with the off-line semi-trusted third party

Xiangjun Xin, Fagen Li

Based on a short signature scheme and discrete logarithm problem,a new fair exchange protocol with the off-line semi-Trusted Third Party(TTP) is proposed.The off-line semi-TTP intervenes into the protocol in case of trouble,which makes the fair exchange optimistic.The off-line TTP need not be completely trusted,since it can get neither signature exchanged when disputation is solved.Because this protocol is based on short signature,which needs low storage and little communication,it can be used in low-bandwidth communication and low-storage environments.

Journal of Xidian University•Jan 1, 2007•0 citations

Fair Contract Signing Protocol Based on Short Signature

Luo Wen-jun, Tong Ling, Zufeng Fu +1 more

Based on Zhang's short signature scheme without random oracles and k+1-square roots assumption, a new fair contract signing protocol with the off-line semi-Trusted Third Party is given because the disadvantages of existed fair contract signing protocol. The off-line semi-TTP intervenes into the protocol in cases where one party attempts to cheat or simply crashes to make the fair exchange optimistic. The off-line TTP need not be completely trusted, since the TTP can get neither exchanged signature when dispute is mediated. Because this protocol is based on short signature, which needs low storage and little communication, it can be used in low-bandwidth communication and low-storage environments.

•Jul 1, 2010•1 citation

New scheme of fair exchange of digital signatures

Yu Shang

Based on the verifiably encrypted signature scheme without random oracles recently proposed by Gorantla et al.,a new scheme of optimistic fair exchange of digital signatures is proposed in this paper.The two players firstly exchange their verifiably encrypted signature on agreed-upon messages then their ordinary signature after the verification of each other's verifiably encrypted signature.If one of them executes the protocol dishonestly,the other can resort to a trusted third party so as to get the purpose of fair exchange of signatures.The proposed scheme has properties of short signature,low computation and verification cost.It can realize exchange of digital signatures fairly and efficiently.

Computer Engineering and Applications Journal•Jan 1, 2008•1 citation
In CIS2008, Gao et al. suggested an abuse-free optimistic fair exchange protocol based on the short signature. Their scheme is very efficient in terms of communication. In this paper, we point out that their scheme has two weaknesses. These weaknesses may lead to an unfair situation that Bob may obtain Alice's signature, but Alice can not obtain Bob's signature. In order to overcome these weaknesses, we propose a new secure abuse-free optimistic fair exchange protocol. In the new protocol, both parties can contact the trusted third party and settle the argument before the deadline. Moreover, we give a formal proof of fairness in the strand space model.
A fair contract-signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in afairway, so that either each of them obtains the other's signature, or neither party does. Based on the RSA signature scheme, a new digital contract-signing protocol is proposed in this paper. Like the existing RSA-based solutions for the same problem, our protocol is not only fair, but also optimistic, since the trusted third party is involved only in the situations where one party is cheating or the communication channel is interrupted. Furthermore, the proposed protocol satisfies a new property-abuse-freeness. That is, if the protocol is executed unsuccessfully, none of the two parties can show the validity of intermediate results to others. Technical details are provided to analyze the security and performance of the proposed protocol. In summary, we present the first abuse-free fair contract-signing protocol based on the RSA signature, and show that it is both secure and efficient.
In ESS2008, Yang et al. suggested a key-exposure-free chameleon hashing scheme, and it can be used to design signature and some other cryptography mechanism. In this paper, we construct a new timeliness optimistic fair exchange protocol based on this key-exposure-free chameleon hashing scheme. The new scheme does not require the use of interactive zero-knowledge proofs in the exchange phase. In our scheme, both parties can contact the trusted third party and settle the argument before the deadline. Moreover, the new scheme achieves fairness and timeliness.
Based on a short signature scheme and discrete logarithm problem,a new fair exchange protocol with the off-line semi-Trusted Third Party(TTP) is proposed.The off-line semi-TTP intervenes into the protocol in case of trouble,which makes the fair exchange optimistic.The off-line TTP need not be completely trusted,since it can get neither signature exchanged when disputation is solved.Because this protocol is based on short signature,which needs low storage and little communication,it can be used in low-bandwidth communication and low-storage environments.
Based on Zhang's short signature scheme without random oracles and k+1-square roots assumption, a new fair contract signing protocol with the off-line semi-Trusted Third Party is given because the disadvantages of existed fair contract signing protocol. The off-line semi-TTP intervenes into the protocol in cases where one party attempts to cheat or simply crashes to make the fair exchange optimistic. The off-line TTP need not be completely trusted, since the TTP can get neither exchanged signature when dispute is mediated. Because this protocol is based on short signature, which needs low storage and little communication, it can be used in low-bandwidth communication and low-storage environments.
Based on the verifiably encrypted signature scheme without random oracles recently proposed by Gorantla et al.,a new scheme of optimistic fair exchange of digital signatures is proposed in this paper.The two players firstly exchange their verifiably encrypted signature on agreed-upon messages then their ordinary signature after the verification of each other's verifiably encrypted signature.If one of them executes the protocol dishonestly,the other can resort to a trusted third party so as to get the purpose of fair exchange of signatures.The proposed scheme has properties of short signature,low computation and verification cost.It can realize exchange of digital signatures fairly and efficiently.