Paper 2001/022
Optimistic Asynchronous Atomic Broadcast
Klaus Kursawe and Victor Shoup
Abstract
This paper presents a new protocol for atomic broadcast in an asynchronous network with a maximal number of Byzantine failures. It guarantees both safety and liveness without making any timing assumptions or using any type of failure detector. Under normal circumstances, the protocol runs in an optimistic mode, with extremely low message and computational complexity -- essentially, just performing a Bracha broadcast for each request. In particular, no potentially expensive public-key cryptographic operations are used. In rare circumstances, the protocol may briefly switch to a pessimistic mode, where both the message and computational complexity are significantly higher than in the optimistic mode, but are still reasonable.
Metadata
- Available format(s)
-
PDF
PS
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- broadcast
- Contact author(s)
- sho @ zurich ibm com
- History
- 2002-04-19: revised
- 2001-03-06: received
- See all versions
- Short URL
- https://ia.cr/2001/022
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2001/022,
author = {Klaus Kursawe and Victor Shoup},
title = {Optimistic Asynchronous Atomic Broadcast},
howpublished = {Cryptology ePrint Archive, Paper 2001/022},
year = {2001},
note = {\url{https://eprint.iacr.org/2001/022}},
url = {https://eprint.iacr.org/2001/022}
}
