Efficient verifiable encryption (and fair exchange) of digital signatures

Research output: Contribution to conferencePaperpeer-review

138 Scopus citations

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. This paper presents new simple schemes for verifiable encryption of digital signatures. We make use of a trusted third party (TTP) but in an optimistic sense, i.e., the TTP takes part in the protocol only if one user cheats or simply crashes. The performance of our schemes significantly surpasses that of prior art.

Original languageEnglish
Pages138-146
Number of pages9
DOIs
StatePublished - 1999
EventProceedings of the 1999 6th ACM Conference on Computer and Communications Security (ACM CCS) - Singapore, Singapore
Duration: 2 Nov 19994 Nov 1999

Conference

ConferenceProceedings of the 1999 6th ACM Conference on Computer and Communications Security (ACM CCS)
CitySingapore, Singapore
Period2/11/994/11/99

Fingerprint

Dive into the research topics of 'Efficient verifiable encryption (and fair exchange) of digital signatures'. Together they form a unique fingerprint.

Cite this