International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Optimistic Asynchronous Multi-Party Contract Signing with Reduced Number of Rounds

Authors:
Birgit Baum-Waidner
Download:
URL: http://eprint.iacr.org/2001/044
Search ePrint
Search Google
Abstract: Optimistic asynchronous multi-party contract signing protocols have received attention in recent years as a compromise between efficient protocols and protocols avoiding a third party as a bottleneck of security. ``Optimistic'' roughly means: in case all participants are honest and receive the messages from the other participants as expected, the third party is not involved at all. The best solutions known so far terminate within $t+2$ rounds in the optimistic case, for any fixed set of $n$ signatories and allowing up to $t
BibTeX
@misc{eprint-2001-11456,
  title={Optimistic Asynchronous Multi-Party Contract Signing with Reduced Number of Rounds},
  booktitle={IACR Eprint archive},
  keywords={cryptographic protocols / fair exchange},
  url={http://eprint.iacr.org/2001/044},
  note={A short version without proofs will be published at ICALP 2001, July 2001. This eprint version contains also the proofs and a few corrections. bbaum@ieee.org 11469 received 27 May 2001},
  author={Birgit Baum-Waidner},
  year=2001
}