Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Attiya, H., Welch, J.L.: Distributed Computing: Fundamentals, Simulations and Advanced Topics. McGraw-Hill, UK (1998)
Barborak, M., Dahbura, A., Malek, M.: The Consensus Problem in Fault-Tolerant Computing. ACM Comput. Surv. 25(2), 171–220 (1993)
Bazzi, R.A., Neiger, G.: Simplifying Fault-tolerance: Providing the Abstraction of Crash Failures. J. ACM 48(3), 499–554 (2001)
Berman, P., Garay, J.A., Perry, K.J.: Bit Optimal Distributed Consensus. In: Yaeza-Bates, R., Manber, U. (eds.) Computer Science Research, pp. 313–322. Plenum Publishing Corporation, New York (1992)
Berman, P., Garay, J.A., Perry, K.J.: Optimal Early Stopping in Distributed Consensus. In: Proc. 6th International Workshop on Distributed Algorithms (WDAG), pp. 221–237, Israel, November 1992
Burns, J.E., Lynch, N.A.: The Byzantine Firing Squad problem. Adv. Comput. Res. 4, 147–161 (1987)
Charron-Bost, B., Schiper, A.: Uniform Consensus is Harder than Consensus. J. Algorithms 51(1), 15–37 (2004)
Chlebus, B.S., Kowalski, D.R.: Time and Communication Efficient Consensus for Crash Failures. In: Proc. 20th International Symposium on Distributed Computing (DISC), pp. 314–328, Sweden, September 2006
Coan, B.A., Welch, J.L.: Modular construction of a Byzantine agreement protocol with optimal message bit complexity. Inf. Comput. 97(1), 61–85 (1992)
Dolev, D., Reischuk, R.: Bounds on Information Exchange for Byzantine Agreement. J. ACM 32(1), 191–204 (1985)
Dolev, D., Reischuk, R., Strong, H.R.: Early Stopping in Byzantine Agreement. J. ACM 37(4), 720–741 (1990)
Dolev, D., Strong, H.R.: Authenticated Algorithms for Byzantine Agreement. SIAM J. Comput. 12(4), 656–666 (1983)
Driscoll, K., Hall, B., Sivencrona, H., Zumsteg, P.: Byzantine Fault Tolerance, from Theory to Reality. In: Proc. 22nd International Conference on Computer Safety, Reliability, and Security (SAFECOMP), pp. 235–248, UK, September 2003
Dwork, C., Moses, Y.: Knowledge and Common Knowledge in a Byzantine Environment: Crash Failures. Inf. Comput. 88(2), 156–186 (1990)
Fischer, M.J.: The Consensus Problem in Unreliable Distributed Systems (A Brief Survey). Research Report, YALEU/DCS/RR-273, Yale University, New Heaven (1983)
Garay, J.A., Moses, Y.: Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds. SIAM J. Comput. 27(1), 247–290 (1998)
Goldreich, O.: Foundations of Cryptography, vol. 1-2. Cambridge University Press, UK (2001) (2004)
Lamport, L., Shostak, R.E., Pease, M.C.: The Byzantine Generals Problem. ACM Trans. Program. Lang. Syst. 4(3), 382–401 (1982)
Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, CA (1996)
Parvédy, P.R., Raynal, M.: Optimal Early Stopping Uniform Consensus in Synchronous Systems with Process Omission Failures. In: Proc. 16th Annual ACM Symposium on Parallel Algorithms (SPAA), pp. 302–310, Spain, June 2004
Pease, M.C., Shostak, R.E., Lamport, L.: Reaching Agreement in the Presence of Faults. J. ACM 27(2), 228–234 (1980)
Perry, K.J., Toueg, S.: Distributed Agreement in the Presence of Processor and Communication Faults. IEEE Trans. Softw. Eng. 12(3), 477–482 (1986)
Raynal, M.: Consensus in Synchronous Systems: A Concise Guided Tour. In: Proc. 9th Pacific Rim International Symposium on Dependable Computing (PRDC), pp. 221–228, Japan, December 2002
Toueg, S., Perry, K.J., Srikanth, T.K.: Fast Distributed Agreement. SIAM J. Comput. 16(3), 445–457 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag
About this entry
Cite this entry
Okun, M. (2008). Byzantine Agreement. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30162-4_60
Download citation
DOI: https://doi.org/10.1007/978-0-387-30162-4_60
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-30770-1
Online ISBN: 978-0-387-30162-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering