Cryptology ePrint Archive: Report 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.

Category / Keywords: cryptographic protocols / broadcast

Date: received 6 Mar 2001, last revised 19 Apr 2002

Contact author: sho at zurich ibm com

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20010306:165347 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]