Efficient verifiable encryption (and fair exchange) of digital signatures

  • Authors:
  • Giuseppe Ateniese

  • Affiliations:
  • IBM Zurich Research Laboratory and Department of Computer Science (DISI), University of Genoa

  • Venue:
  • CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

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.