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

Birgit Baum-Waidner

Paper 2001/044

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

Birgit Baum-Waidner

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 rounds in the optimistic case, for any fixed set of signatories and allowing up to dishonest signatories. The protocols presented here achieve a major improvement compared to the state of the art: The number of rounds is reduced from to for all , and for , grows remarkably slowly compared with numbers of rounds in : If then .

Metadata

Available format(s): PS
Category: Cryptographic protocols
Publication info: Published elsewhere. A short version without proofs will be published at ICALP 2001, July 2001. This eprint version contains also the proofs and a few corrections.
Keywords: fair exchange
Contact author(s): bbaum @ ieee org
History: 2001-05-28: received
Short URL: https://ia.cr/2001/044
License: CC BY

BibTeX

@misc{cryptoeprint:2001/044,
      author = {Birgit Baum-Waidner},
      title = {Optimistic Asynchronous Multi-Party Contract Signing with Reduced Number of Rounds},
      howpublished = {Cryptology {ePrint} Archive, Paper 2001/044},
      year = {2001},
      url = {https://eprint.iacr.org/2001/044}
}