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

ACM SIGSAC Conference on Computer and Communications Security (CCS)

Efficient verifiable encryption (and fair exchange) of digital signatures

Giuseppe Ateniese

Published Nov 1, 1999• 161 citations
Publisher

Abstract

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.

DOI
10.1145/319709.319728

Related papers

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•96 citations

New verifiable encryptions and their applications

Caifen Wang

As more and more electronic transactions are being conducted on the IN TERNET, fair exchange protocol is becoming more and more important. Verifiable e ncryption is introduced as a primitive that can be used to build extremely effic ient fair exchange protocols where the items exchanged represent digital signat ures. In this paper, new verifiable encryption schemes are presented, and based on this scheme, a blinded verifiable encryption is presented. They are advantage ous over previous schemes in that they are more efficient and practical.

Journal of Lanzhou University•Jan 1, 2002•0 citations

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

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

A secure and fair DSA-based signature exchange protocol

Aleksandra Nenadić, Ning Zhang, S. Barton

This work presents a novel protocol for fair exchange of DSA-based signatures to support an e-commerce activity of digital contract signing. The protocol employs an off-line semitrusted third party (STTP), which participates in the protocol execution only in exceptional circumstances and which involvement in the protocol is transparent. The protocol can tolerate the STTP's own misbehaviour (i.e. if it does not collude with other participants of the protocol) and it prevents the STTP from gaining the exchanged signatures or the signed document. The protocol is based on the principle of verifiable and recoverable signature encryption, and in comparison with related protocols is more efficient.

IEEE Symposium on Computers and Communications (ISCC)•Jan 1, 2004•8 citations

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•295 citations
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.
As more and more electronic transactions are being conducted on the IN TERNET, fair exchange protocol is becoming more and more important. Verifiable e ncryption is introduced as a primitive that can be used to build extremely effic ient fair exchange protocols where the items exchanged represent digital signat ures. In this paper, new verifiable encryption schemes are presented, and based on this scheme, a blinded verifiable encryption is presented. They are advantage ous over previous schemes in that they are more efficient and practical.
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.
This work presents a novel protocol for fair exchange of DSA-based signatures to support an e-commerce activity of digital contract signing. The protocol employs an off-line semitrusted third party (STTP), which participates in the protocol execution only in exceptional circumstances and which involvement in the protocol is transparent. The protocol can tolerate the STTP's own misbehaviour (i.e. if it does not collude with other participants of the protocol) and it prevents the STTP from gaining the exchanged signatures or the signed document. The protocol is based on the principle of verifiable and recoverable signature encryption, and in comparison with related protocols is more efficient.
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.