Encyclopedia of Algorithms

2016 Edition
| Editors: Ming-Yang Kao

Optimal Probabilistic Synchronous Byzantine Agreement

  • Juan Garay
Reference work entry
DOI: https://doi.org/10.1007/978-1-4939-2864-4_269

Years and Authors of Summarized Original Work

  • 1988; Feldman, Micali

Problem Definition

The Byzantine agreement problem (BA) is concerned with multiple processors (parties, “players”) all starting with some initial value, agreeing on a common value, despite the possible disruptive or even malicious behavior of some them. BA is a fundamental problem in fault-tolerant distributed computing and secure multi-party computation.

The problem was introduced by Pease, Shostak and Lamport in [17], who showed that the number of faulty processors must be less than a third of the total number of processors for the problem to have a solution. They also presented a protocol matching this bound, which requires a number of communication rounds proportional to the number of faulty processors – exactly \( { t+1 } \)

Keywords

Byzantine generals problem Distributed consensus 
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Ben-Or M (1983) Another advantage of free choice: completely asynchronous agreement protocols. In: Proceedings of the 22nd annual ACM symposium on the principles of distributed computing, pp 27–30Google Scholar
  2. 2.
    Ben-Or M, El-Yaniv R (2003) Optimally-resilient interactive consistency in constant time. Distrib Comput 16(4):249–262CrossRefGoogle Scholar
  3. 3.
    Bracha G (1987) An O(log n) expected rounds randomized Byzantine generals protocol. J Assoc Comput Mach 34(4):910–920MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Canetti R, Rabin T (1993) Fast asynchronous Byzantine agreement with optimal resilience. In: Proceedings of the 25th annual ACM symposium on the theory of computing, San Diego, 16–18 May 1993, pp 42–51Google Scholar
  5. 5.
    Chor B, Coan B (1985) A simple and efficient randomized Byzantine agreement algorithm. IEEE Trans Softw Eng SE-11(6):531–539MathSciNetCrossRefGoogle Scholar
  6. 6.
    Chor B, Dwork C (1989) Randomization in Byzantine agreement. Adv Comput Res 5:443–497Google Scholar
  7. 7.
    Dwork C, Moses Y (1990) Knowledge and common knowledge in a Byzantine environment: crash failures. Inf Comput 88(2):156–186, Preliminary version in TARK’86MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Feldman P (1988) Optimal algorithms for Byzantine agreement. PhD thesis, MITGoogle Scholar
  9. 9.
    Feldman P, Micali S (1997) An optimal probabilistic protocol for synchronous Byzantine agreement. SIAM J Comput 26(4):873–933, Preliminary version in STOC’88MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Fischer MJ, Lynch NA (1982) A lower bound for the time to assure interactive consistency. Inf Process Lett 14(4):183–186MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Fischer MJ, Lynch NA, Paterson MS (1985) Impossibility of distributed consensus with one faulty processor. J ACM 32(2):374–382MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    Goldreich O (2001/2004) Foundations of cryptography, vols 1 and 2. Cambridge University Press, CambridgeGoogle Scholar
  13. 13.
    Goldreich O, Petrank E (1990) The best of both worlds: guaranteeing termination in fast randomized agreement protocols. Inf Process Lett 36(1):45–49MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    Katz J, Koo C (2006) On expected constant-round protocols for Byzantine agreement. In: Proceedings of advances in cryptology–CRYPTO 2006, Santa Barbara. Springer, Berlin/Heidelberg/New York, pp 445–462CrossRefGoogle Scholar
  15. 15.
    Lamport L, Shostak R, Pease M (1982) The Byzantine generals problem. ACM Trans Program Lang Syst 4(3):382–401zbMATHCrossRefGoogle Scholar
  16. 16.
    Lynch N (1996) Distributed algorithms. Morgan Kaufmann, San FranciscozbMATHGoogle Scholar
  17. 17.
    Pease M, Shostak R, Lamport L (1980) Reaching agreement in the presence of faults. J ACM 27(2):228–234MathSciNetzbMATHCrossRefGoogle Scholar
  18. 18.
    Rabin M (1983) Randomized Byzantine generals. In: Proceedings of the 24th annual IEEE symposium on foundations of computer science, pp 403–409Google Scholar
  19. 19.
    Turpin R, Coan BA (1984) Extending binary Byzantine agreement to multivalued Byzantine agreement. Inf Process Lett 18(2):73–76CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  • Juan Garay
    • 1
  1. 1.Bell LaboratoriesMurray HillUSA