Abstract
The Byzantine Agreement (BA) problem introduced by Pease, Shostak and Lamport in [1] is one of the central problems in distributed computing. It was extensively studied under various timing, topology, authentication and failure assumptions. In previous works it was assumed that the network topology is known to the processors in advance, i.e., every processor has an a priori knowledge of the true unique identi.er of the processor to which it is connected by each of its communication channels (see Fig. 1a).
This research was supported by Israeli Council for Higher Education and by Sally Berg foundation.
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
References
Pease, M., Shostak, R., Lamport, L.: Reaching Agreement in the Presence of Faults. J. ACM 27(2), 228–234 (1980)
Okun, M., Barak, A.: On Anonymous Byzantine Agreement, Leibniz Center TR 2004-2, School of Computer Science, The Hebrew University, submitted for publication (2004)
Okun, M.: On the Round Complexity of Byzantine Agreement Without Initial Set-Up (2005) (submitted for publication)
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
Okun, M. (2005). Agreement Among Unacquainted Byzantine Generals. In: Fraigniaud, P. (eds) Distributed Computing. DISC 2005. Lecture Notes in Computer Science, vol 3724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561927_40
Download citation
DOI: https://doi.org/10.1007/11561927_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29163-3
Online ISBN: 978-3-540-32075-3
eBook Packages: Computer ScienceComputer Science (R0)