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. Under normal circumstances, the protocol runs in an extremely efficient “optimistic mode,” while in rare circumstances the protocol may briefly switch to a less efficient “pessimistic mode.”
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Anceaume, E., Charron-Bost, B., Minet, P., Toueg, S.: On the formal specification of group membership services. Tech. Rep. TR95-1534, Cornell University, Computer Science Department (1995)
Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: 1st ACM Conf. on Computer and Communications Security, pp. 62–73 (1993)
Bracha, G.: An asynchronous [(n − 1)/3]-resilient consensus protocol. In: Proc. of the 3rd Ann. ACM Symp. on Principles of Distributed Computing, pp. 154–162 (1984)
Castro, M.: Practical Byzantine Fault Tolerance. PhD thesis, Massachusetts Institute of Technology (2000)
Cachin, C., Kursawe, K., Petzold, F., Shoup, V.: Secure and efficient asynchronous broadcast protocols. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 524–541. Springer, Heidelberg (2001)
Cachin, C., Kursawe, K., Shoup, V.: Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement using Cryptography. In: ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, pp. 123–132 (2000)
Castro, M., Liskov, B.: Authenticated byzantine fault tolerance without public-key cryptography. Tech. Memo MIT/LCS/TM-589, MIT Laboratory for Computer Science (1999)
Castro, M., Liskov, B.: Practical Byzantine fault tolerance. In: Proc. 3rd Symp. Operating Systems Design and Implementation (1999)
Canetti, R., Rabin, T.: Fast asynchronous Byzantine agreement with optimal resilience. In: Proc. 25th Ann. ACM Symp. on Theory of Computing, pp. 42–51 (1993)
Doudou, Guerraoui, Garbinato.: Abstractions for devising byzantine-resilient state machine replication. In: SRDS: 19th Symp. on Reliable Distributed Systems (2000)
Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374–382 (1985)
Kihlstrom, K.P., Moser, L.E., Melliar-Smith, P.M.: The SecureRing protocols for securing group communication. In: 31st Hawaii International Conference on System Sciences, pp. 317–326 (1998)
Kursawe, K., Shoup, V.: Optimistic asynchronous atomic broadcast. Cryptology ePrint Archive, Report 2001/022 (2001), http://eprint.iacr.org
Reiter, M.K.: Secure agreement protocols: Reliable and atomic group multicast in Rampart. In: Proc. of the 2nd ACM Conference on Computer and Communication Security, pp. 68–80 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kursawe, K., Shoup, V. (2005). Optimistic Asynchronous Atomic Broadcast. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds) Automata, Languages and Programming. ICALP 2005. Lecture Notes in Computer Science, vol 3580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11523468_17
Download citation
DOI: https://doi.org/10.1007/11523468_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27580-0
Online ISBN: 978-3-540-31691-6
eBook Packages: Computer ScienceComputer Science (R0)