Skip to main content
Log in

Byzantine-resilient distributed computing systems

  • Fault-tolerant Software
  • Published:
Sadhana Aims and scope Submit manuscript

Abstract

This paper is aimed at reviewing the notion of Byzantine-resilient distributed computing systems, the relevant protocols and their possible applications as reported in the literature. The three agreement problems, namely, the consensus problem, the interactive consistency problem, and the generals problem have been discussed. Various agreement protocols for the Byzantine generals problem have been summarized in terms of their performance and level of fault-tolerance. The three classes of Byzantine agreement protocols discussed are the deterministic, randomized, and approximate agreement protocols. Finally, application of the Byzantine agreement protocols to clock synchronization is highlighted.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Attiya C, Dolev D, Gil J 1984Proc. ACM Symp. Principles of Distributed Computing (New York:Acm Press)

    Book  Google Scholar 

  • Broder A Z, Dolev D 1984Proc. IEEE Symp. Foundations of Computer Science (Silver Spring,Md:Ieee Comput. Soc. Press)

    Google Scholar 

  • Chor B, Coan B A 1984Proc. IEEE Symp. Reliability in Distributed Software and Database Systems (Silver Spring,Md:Ieee Comput. Soc. Press)

    Google Scholar 

  • Cristian F, Aghili H, Strong R 1984 Atomic Broadcast from Simple Message Diffusion to Byzantine Agreement,ibm Res. Rep. RJ4540(48668)

  • Dolev D, Fischer M J, Fowler R, Lynch N A, Strong H R 1982aInf. Control 52: 257–274

    Article  MATH  MathSciNet  Google Scholar 

  • Dolev D, Lynch N A, Pinter S S, Stark E W, Weihl W E 1983Proc. IEEE Symp. Reliability in Distributed Software and Database Systems (Silver Spring,Md;Ieee Comput. Soc. Press)

    Google Scholar 

  • Dolev D, Reischuk R 1982 Bounds on Information Exchange for Byzantine Agreement,ibm Res. Rep. RJ3587 (42133)

  • Dolev D, Ruediger R, Strong H R 1982bProc. IEEE Symp. Foundations of Computer Science (Silver Spring,Md:Ieee Comput. Soc. Press)

    Google Scholar 

  • Dolev D, Strong H R 1982Proc. IEEE Symp. Reliability in Distributed Software and Database Systems (Silver Spring,Md:Ieee Comput. Soc. Press)

    Google Scholar 

  • Dolev D, Strong H R 1983SIAM J. Comput. 12: 656–666

    Article  MATH  MathSciNet  Google Scholar 

  • Ezhilchelvan P D, Shrivastava S K 1986Proc. IEEE Symp. Reliability in Distributed Software and Database Systems (Silver Spring,Md:Ieee Comput. Soc. Press)

    Google Scholar 

  • Feldman P, Micali S 1985Proc. IEEE Symp. Foundations of Computer Science (Silver Spring,Md:Ieee Comput. Soc. Press)

    Google Scholar 

  • Fischer M J 1983Proc. Int. Conf. Foundations of Computing Theory (New York:Acm Press)

    Google Scholar 

  • Fischer M J, Lynch N A 1982Inf. Process. Lett. 14: 183–186

    Article  MATH  MathSciNet  Google Scholar 

  • Garcia-Molina H, Pittelli F, Davidson S 1986ACM Trans. Database Syst. 11: 27–47

    Article  Google Scholar 

  • Johnson S C, Butler R W 1984AIAA/IEEE 6th Digital Avionics Systems Conference (New York:Ieee Press)

    Google Scholar 

  • Krishna C M, Shin K G, Butler R W 1985IEEE Trans. Comput. C-34: 752–756

    Article  Google Scholar 

  • Lala J H 1986Fault-tolerant Comput. Symp.-16 (Silver Spring,Md:Ieee Comput. Soc. Press)

    Google Scholar 

  • Lala J H, Alger L S, Gauthier R J, Dzwonezyk M J 1986AIAA/IEEE 7th Digital Avionics Systems Conference (New York:Ieee Press)

    Google Scholar 

  • Lamport L 1984ACM Trans. Program. Lang. Syst. 6: 254–280

    Article  Google Scholar 

  • Lamport L, Melliar-Smith P M 1984Proc. ACM Symp. Principles of Distributed Computing (New York:Acm Press)

    Google Scholar 

  • Lamport L, Melliar-Smith P M 1985J. ACM 32: 52–78

    Article  MATH  MathSciNet  Google Scholar 

  • Lamport L, Shostak R, Pease M 1982ACM Trans. Program. Lang. Syst. 4: 382–401

    Article  MATH  Google Scholar 

  • Mahaney S R, Schneider F B 1985Proc. ACM Symp. Principles of Distributed Computing (New York:Acm Press)

    Book  Google Scholar 

  • Pease M, Shostak R, Lamport L 1980J. ACM 27: 228–234

    Article  MATH  MathSciNet  Google Scholar 

  • Perry K J 1984Proc. IEEE Symp. Reliability in Distributed Software and Database Systems (Silver Spring,Md:Ieee Comput. Soc. Press).

    Google Scholar 

  • Perry K J 1985 Early Stopping Protocols for Fault-Tolerant Distributed Agreement, TR 85-662, Dept. of Computer Science, Cornell University

  • Rabin M O 1983Proc. IEEE Symp. Foundations of Computer Science (Silver Spring,Md:Ieee Comput. Soc. Press)

    Google Scholar 

  • Reischuk R 1985Inf. Control 64: 23–42

    Article  MATH  MathSciNet  Google Scholar 

  • Shin K G, Ramanathan P 1987IEEE Trans. Comput. C-36: 2–12

    Article  Google Scholar 

  • Smith T BFault-tolerant Comput. Symp.-16 (Silver Spring,Md:Ieee Comput. Soc. Press)

  • Strong R 1985IEEE COMPCON (Silver Spring,Md:Ieee Comput. Soc. Press)

    Google Scholar 

  • Toueg S 1984Proc. ACM Symp. Principles of Distributed Computing (New York:Acm Press)

    Book  Google Scholar 

  • Turpin R, Coan B A 1984Inf. Process. Lett. 18: 73–76

    Article  Google Scholar 

  • Wensley J H, Lamport L, Goldberg J, Green M W, Levitt K N, Melliar-Smith P M, Shostak R E, Weinstock C B 1978Proc. IEEE 66: 1240–1255

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Patnaik, L.M., Balaji, S. Byzantine-resilient distributed computing systems. Sadhana 11, 81–91 (1987). https://doi.org/10.1007/BF02811312

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02811312

Keywords

Navigation