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

Jisuanji gongcheng

Exchange Protocol Based on Schnorr Signature Scheme and Secret Sharing

Xiao Guo-zhen

Published Jan 1, 2007• 0 citations
OpenAlex

Abstract

By using the secret sharing technique in the Schnorr signature scheme,a new scheme of fair exchange protocol is proposed,whose fairness and security depend on two or more trusted third authorities.According to the security and fairness analysis of this protocol,compared with the fair exchange protocols that fully depend on only one TTP,the proposed protocol is more secure and reliable.

Related papers

A multiparty fair-exchange protocol

Zhengquan Li

Based on the secret sharing technique,this paper proposes a multi-party fair exchange protocol.The protocol uses an online trusted third party(TTP) in order to help the participants to realize fair exchange.The advantage of a protocol implemented with an online TTP is that the TTP is semi-trusted.Fairness of the proposed protocol is proved in this paper.

Journal of Yangzhou University•Jan 1, 2008•0 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

Novel fair exchange protocol based on concurrent signature

Yang Yi-xian

Based on perfect concurrent signature, a novel fair exchange protocol was presented. In this protocol anyone can’t identify who has signed which signature when two parties have exchanged their two ambiguous signatures and rela- tive data items. Not until the initial signer publishes a secret information, are the two signatures bound to respective signer concurrently. After that, the other party sends the key of decrypting goods, and thus the two parties can fairly get each other’s data items without the trusted third party (TTP), which avoids the possibility of two parties’ collusion and the bottleneck of the TTP involvement. Through analysis, this protocol well ensures some significant properties of fair ex- change, such as fairness, non-repudiation and abuse-free etc. What’s more, it only needs four messages between two par- ties and it is very simple and highly efficient.

Journal of Communications•Jan 1, 2008•2 citations

Fair Document Exchange Protocol with Confidentiality

Xiaoxin Ye, Zhenfu Cao, Xiaohui Liang

The paper proposes a new fair document exchange protocol.In such a fair exchange scenario,each party owns a valuable secret message and they want to exchange their secrets in a fairness way so that at the end of the transaction,either both of them get the other’s secret or neither of them gets the other’s secret.Compared with previous fair exchange protocols,the protocol holds confidentiality,that is,except the two participating party,no one even the Trusted Third Party(TTP) can get exchanged items.

Jisuanji gongcheng•Jan 1, 2009•1 citation

Fair Exchange Protocol with Distributed Semi-trusted Third Party

Futai Zhang

The techniques of verifiable secret sharing and verifiable encryption are used in the construction of two party fair exchange protocols.The novelty of the construction lies in the introduction of the distributed semi-trusted third party.Compared to the previous fair exchange protocols with a single semi-trusted third party,the newly constructed fair exchange protocol can further guarantee the security and fairness of the transaction due to the existence of the distributed semi-trusted third party.

Jisuanji gongcheng•Jan 1, 2006•0 citations

A New Fair Exchange Protocol Using Designated Confirmer Signatures

LU Song-nian

we propose a new efficient protocol. which allows a pair of potentially mistrusting parties to exchange digital signatures over the Internet in a fair way. The protocol relies on an off-line Trusted Third Party (TTP). which does not take part in the exchange unless any of the parties behaves improperly or other faults occur. Efficiency of the protocol is achieved by using a cryptographic primitive, called designated confirmer signatures. The confirmer commitment schemes and ordinary signatures are combines to form the confirmer signatures. The security of the protocol is analyzed and the fairness of it is guaranteed.

Jisuanji gongcheng•Jan 1, 2000•0 citations
By using the secret sharing technique in the Schnorr signature scheme,a new scheme of fair exchange protocol is proposed,whose fairness and security depend on two or more trusted third authorities.According to the security and fairness analysis of this protocol,compared with the fair exchange protocols that fully depend on only one TTP,the proposed protocol is more secure and reliable.
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 perfect concurrent signature, a novel fair exchange protocol was presented. In this protocol anyone can’t identify who has signed which signature when two parties have exchanged their two ambiguous signatures and rela- tive data items. Not until the initial signer publishes a secret information, are the two signatures bound to respective signer concurrently. After that, the other party sends the key of decrypting goods, and thus the two parties can fairly get each other’s data items without the trusted third party (TTP), which avoids the possibility of two parties’ collusion and the bottleneck of the TTP involvement. Through analysis, this protocol well ensures some significant properties of fair ex- change, such as fairness, non-repudiation and abuse-free etc. What’s more, it only needs four messages between two par- ties and it is very simple and highly efficient.
The paper proposes a new fair document exchange protocol.In such a fair exchange scenario,each party owns a valuable secret message and they want to exchange their secrets in a fairness way so that at the end of the transaction,either both of them get the other’s secret or neither of them gets the other’s secret.Compared with previous fair exchange protocols,the protocol holds confidentiality,that is,except the two participating party,no one even the Trusted Third Party(TTP) can get exchanged items.
The techniques of verifiable secret sharing and verifiable encryption are used in the construction of two party fair exchange protocols.The novelty of the construction lies in the introduction of the distributed semi-trusted third party.Compared to the previous fair exchange protocols with a single semi-trusted third party,the newly constructed fair exchange protocol can further guarantee the security and fairness of the transaction due to the existence of the distributed semi-trusted third party.
we propose a new efficient protocol. which allows a pair of potentially mistrusting parties to exchange digital signatures over the Internet in a fair way. The protocol relies on an off-line Trusted Third Party (TTP). which does not take part in the exchange unless any of the parties behaves improperly or other faults occur. Efficiency of the protocol is achieved by using a cryptographic primitive, called designated confirmer signatures. The confirmer commitment schemes and ordinary signatures are combines to form the confirmer signatures. The security of the protocol is analyzed and the fairness of it is guaranteed.