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

International Wireless Communications and Mobile Computing Conference (IWCMC)

A secure protocol for misbehavior-penalization-based fair digital signature exchange

Chia‐Chun Wu, Wei‐Bin Lee, Woei-Jiunn Tsaur

Published Aug 12, 2007• 0 citations
Publisher

Abstract

In 2005, Zhang et al. proposed a novel fair digital signature exchange protocol that can impose a penalty on the misbehaving party. However, we have discovered a weakness concerning the fairness aspect of the protocol which will occur when an initiator tries to exchange the signature of the same document to others again. That is, the latter exchange partner can obtain the initiator's valid signature with the help of the previous exchange partner without completing the protocol, and therefore the protocol is not fair enough. In this paper, the reason for the occurrence of the unfair exchange is discussed, and an improvement to remove the weakness is proposed.

DOI
10.1145/1280940.1280969

Related papers

Efficient fair digital-signature exchange based on misbehaviour penalisation

N. Zhang, Qi Shi, Aleksandra Nenadić +2 more

A protocol is presented for the fair digital-signature exchange commonly seen in e-commerce systems. The protocol incorporates a novel approach for the recovery of a signature with the assistance of an offline trusted third party that can impose a penalty on a misbehaving party. This new approach enables the protocol to achieve fairness in a simpler and more efficient manner than other relevant fair exchange protocols, while being able to deter a dishonest party from misbehaving.

IEE Proceedings - Communications•Jan 1, 2005•6 citations

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

Signature-based approach to fair document exchange

Qi Shi, N. Zhang, M. Merabti

The authors aim to present a protocol for fair document exchange between two parties, that incorporates a signature scheme based method for the recovery of a document decryption key. The principal idea for such key recovery is based on a verifiable and recoverable encryption of a key. This means that any party can verify the correctness of the key encrypted without actually viewing the key, and the party can be assured that a designated party can decrypt the encrypted key to recover the original key. A DSA (digital signature algorithm) is applied as an example to demonstrate how to implement such key encryption based on an off-line semi-trusted third party. The third party is off-line as they do not participate in an exchange in normal situations, and semi-trusted in the sense that they may misbehave but do not conspire with any party involved in the exchange. The main contribution of the paper is that it presents a fair document exchange protocol which is more efficient, simpler and easier to implement in comparison with related work.

IEE Proceedings - Communications•Jan 1, 2003•12 citations

Fair Exchange Protocol of Digital Signature

Yan Ya-jun

A fair exchange protocol by means of G.Ateniese′s verifiable encryption of digital signatures is introduced.Two parties exchanged digital signatures fairly over Internet using the protocol.In the protocol,one part encrypted the valid signature on message,and then proved to the others that the encryption contained the signature.Its security is based on the discrete logarithm problem.

Modern Electronics Technique•Jan 1, 2011•0 citations

New Optimistic Fair Exchange Protocol Based on Short Signature

Yanbin Sun, Lize Gu, Sihan Qing +3 more

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.

IEEE International Conference on Communication Software and Networks•Jan 1, 2010•7 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
In 2005, Zhang et al. proposed a novel fair digital signature exchange protocol that can impose a penalty on the misbehaving party. However, we have discovered a weakness concerning the fairness aspect of the protocol which will occur when an initiator tries to exchange the signature of the same document to others again. That is, the latter exchange partner can obtain the initiator's valid signature with the help of the previous exchange partner without completing the protocol, and therefore the protocol is not fair enough. In this paper, the reason for the occurrence of the unfair exchange is discussed, and an improvement to remove the weakness is proposed.
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.
The authors aim to present a protocol for fair document exchange between two parties, that incorporates a signature scheme based method for the recovery of a document decryption key. The principal idea for such key recovery is based on a verifiable and recoverable encryption of a key. This means that any party can verify the correctness of the key encrypted without actually viewing the key, and the party can be assured that a designated party can decrypt the encrypted key to recover the original key. A DSA (digital signature algorithm) is applied as an example to demonstrate how to implement such key encryption based on an off-line semi-trusted third party. The third party is off-line as they do not participate in an exchange in normal situations, and semi-trusted in the sense that they may misbehave but do not conspire with any party involved in the exchange. The main contribution of the paper is that it presents a fair document exchange protocol which is more efficient, simpler and easier to implement in comparison with related work.
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.
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.