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

Modern Electronics Technique

Fair Exchange Protocol of Digital Signature

Yan Ya-jun

Published Jan 1, 2011• 0 citations
OpenAlex

Abstract

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.

Related papers

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

Efficient and practical fair exchange protocols with off-line TTP

Feng Bao, Robert Huijie Deng, Wenbo Mao

We present protocols for fair exchange of electronic data (digital signatures, payment and confidential data) between two parties A and B. Novel properties of the proposed protocols include: 1) offline trusted third party (TTP), i.e., TTP does not take part in the exchange unless one of the parties behaves improperly; 2) only three message exchanges are required in the normal situation; 3) true fair exchange, i.e., either A and B obtain each other's data or no party receives anything useful; no loss can be incurred to a party no matter how maliciously the other party behaves during the exchange. This last property is in contrast to previously proposed protocols with offline TTP ([1] and [21]), where a misbehaving party may get another party's data while refusing to send his document to the other party, and the TTP can provide affidavits attesting to what happened during the exchange. To our knowledge, the protocols presented here are the first exchange protocols which use offline TTP and at the same time guarantee true fair exchange of digital messages. We introduce a novel cryptographic primitive, called the Certificate of Encrypted Message Being a Signature (CEMBS), as the basic building block of the fair exchange protocols. It is used to prove that an encrypted message is a certain party's signature on a public file, without revealing the signature. We also give two examples to show in detail how the certificate can be constructed.

IEEE Symposium on Security and Privacy (S&P)•Nov 27, 2002•291 citations

Verifiable encryption of digital signatures and applications

Giuseppe Ateniese

This paper presents a new simple schemes for verifiable encryption of digital signatures. We make use of a trusted third party (TTP) but in an optimistic sense, that is, the TTP takes part in the protocol only if one user cheats or simply crashes. Our schemes can be used as primitives to build efficient fair exchange and certified e-mail protocols.

ACM Transactions on Information and System Security•Feb 1, 2004•95 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

Efficient verifiable encryption (and fair exchange) of digital signatures

Giuseppe Ateniese

A fair exchange protocol allows two users to exchange items so that either each user gets the other's item or neither user does. In [2], verifiable encryption is introduced as a primitive that can be used to build extremely efficient fair exchange protocols where the items exchanged represent digital signatures. Such protocols may be used to digitally sign contracts.

ACM SIGSAC Conference on Computer and Communications Security (CCS)•Nov 1, 1999•158 citations

Fair Exchange of Digital Signatures using RSA-based CEMBS and Offline STTP

Jamal Ali Hussein, Mumtaz A. AlMukhtar

One of the essential security services needed to safeguard online transactions is fair exchange. In fair exchange protocols two parties can exchange their signatures in a fair manner, so that either each party gain the other's signature or no one obtain anything useful. This paper examines security solutions for achieving fair exchange. It proposes new security protocols based on the "Certified Encrypted Message Being Signature" (CEMBS) by using RSA signature scheme. This protocol relies on the help of an "off-line Semi-Trusted Third Party" (STTP) to achieve fairness. They provide with confidential protection from the STTP for the exchanged items by limiting the role and power of the STTP. Three different protocols have been proposed. In the first protocol, the two main parties exchange their signatures on a common message. In the second protocol, the signatures are exchanged on two different messages. While in the third one, the exchange is between confidential data and signature.

arXiv:0912.3980•Dec 20, 2009•0 citations
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.
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.
We present protocols for fair exchange of electronic data (digital signatures, payment and confidential data) between two parties A and B. Novel properties of the proposed protocols include: 1) offline trusted third party (TTP), i.e., TTP does not take part in the exchange unless one of the parties behaves improperly; 2) only three message exchanges are required in the normal situation; 3) true fair exchange, i.e., either A and B obtain each other's data or no party receives anything useful; no loss can be incurred to a party no matter how maliciously the other party behaves during the exchange. This last property is in contrast to previously proposed protocols with offline TTP ([1] and [21]), where a misbehaving party may get another party's data while refusing to send his document to the other party, and the TTP can provide affidavits attesting to what happened during the exchange. To our knowledge, the protocols presented here are the first exchange protocols which use offline TTP and at the same time guarantee true fair exchange of digital messages. We introduce a novel cryptographic primitive, called the Certificate of Encrypted Message Being a Signature (CEMBS), as the basic building block of the fair exchange protocols. It is used to prove that an encrypted message is a certain party's signature on a public file, without revealing the signature. We also give two examples to show in detail how the certificate can be constructed.
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.
One of the essential security services needed to safeguard online transactions is fair exchange. In fair exchange protocols two parties can exchange their signatures in a fair manner, so that either each party gain the other's signature or no one obtain anything useful. This paper examines security solutions for achieving fair exchange. It proposes new security protocols based on the "Certified Encrypted Message Being Signature" (CEMBS) by using RSA signature scheme. This protocol relies on the help of an "off-line Semi-Trusted Third Party" (STTP) to achieve fairness. They provide with confidential protection from the STTP for the exchanged items by limiting the role and power of the STTP. Three different protocols have been proposed. In the first protocol, the two main parties exchange their signatures on a common message. In the second protocol, the signatures are exchanged on two different messages. While in the third one, the exchange is between confidential data and signature.