Skip to main content
SpringerLink
Log in

Enhanced Fault-Tolerance through Byzantine Failure Detection

  • Conference paper
Principles of Distributed Systems (OPODIS 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5923))

Included in the following conference series:

Abstract

We consider a variant of the Byzantine failure model in which Byzantine processes are eventually detected and silenced, and investigate the fault-tolerance of the classical broadcast and agreement problems. We show that if all Byzantine processes are eventually detected, then it is possible to solve the broadcast problem in the presence of any number of Byzantine processes. If only a fraction of the Byzantine processes can be detected, then we show that it is possible to solve consensus (and broadcast) if the total number of processes is N ≥ 2f + 3F + 1, where f is the number of Byzantine processes that are eventually detected and F is the number of those that are never detected. We show that 2f + 3F + 1 is a lower bound to solve the consensus and broadcast problems.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Fischer, M., Lynch, N., Paterson, M.: Impossibility of distributed commit with one faulty process. Journal of the ACM 32(2) (April 1985)

    Google Scholar 

  2. Dolev, D., Strong, H.R.: Authenticated algorithms for byzantine agreement. SIAM J. Comput. 12(4), 656–666 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  3. Ben-Or, M.: Another advantage of free choice (extended abstract): Completely asynchronous agreement protocols. In: PODC, pp. 27–30 (1983)

    Google Scholar 

  4. Feldman, P., Micali, S.: Optimal algorithms for byzantine agreement. In: STOC, pp. 148–161 (1988)

    Google Scholar 

  5. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco (1996)

    MATH  Google Scholar 

  6. Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. JACM 43(2), 225–267 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  7. Dolev, D., Lynch, N.A., Pinter, S.S., Stark, E.W., Weihl, W.E.: Reaching approximate agreement in the presence of faults. JACM 33(3), 499–516 (1986)

    Article  MathSciNet  Google Scholar 

  8. Widder, J., Gridling, G., Weiss, B., Blanquart, J.-P.: Synchronous consensus with mortal byzantines. DSN 0, 102–112 (2007)

    Google Scholar 

  9. Douceur, J.R.: The sybil attack. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 251–260. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  10. Bazzi, R.A., Konjevod, G.: On the establishment of distinct identities in overlay networks. Distributed Computing 19(4), 267–287 (2007)

    Article  Google Scholar 

  11. Yu, H., Gibbons, P.B., Kaminsky, M., Xiao, F.: Sybillimit: A near-optimal social network defense against sybil attacks. In: IEEE Symposium on Security and Privacy, pp. 3–17 (2008)

    Google Scholar 

  12. Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. JACM 27(2), 228–234 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  13. Berman, P., Garay, J.A.: Asymptotically optimal distributed consensus (extended abstract). In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol. 372, pp. 80–94. Springer, Heidelberg (1989)

    Google Scholar 

  14. Doudou, A., Garbinato, B., Guerraoui, R.: Encapsulating failure detection: From crash to byzantine failures. In: Blieberger, J., Strohmeier, A. (eds.) Ada-Europe 2002. LNCS, vol. 2361, pp. 24–50. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  15. Guerraoui, R., Herlihy, M., Kouznetsov, P., Lynch, N.A., Newport, C.C.: On the weakest failure detector ever. In: PODC, pp. 235–243 (2007)

    Google Scholar 

  16. Li, J., Mazières, D.: Beyond one-third faulty replicas in byzantine fault tolerant systems. In: NSDI (2007)

    Google Scholar 

  17. Chun, B.G., Maniatis, P., Shenker, S., Kubiatowicz, J.: Attested append-only memory: making adversaries stick to their word. SIGOPS Oper. Syst. Rev. 41(6), 189–204 (2007)

    Google Scholar 

  18. Thambidurai, P.M., Park, Y.-K.: Interactive consistency with multiple failure modes. In: SRDS, pp. 93–100 (1988)

    Google Scholar 

  19. Siu, H.S., Chin, Y.H., Yang, W.P.: A note on consensus on dual failure modes. IEEE Transactions on Parallel and Distributed Systems 7(3), 225–230 (1996)

    Article  Google Scholar 

  20. Anceaume, E., Delporte-Gallet, C., Fauconnier, H., Hurfin, M., Le Lann, G.: Designing modular services in the scattered byzantine failure model. In: ISPDC, pp. 262–269 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Arizona State University, Tempe, AZ, 85287-8809, USA

    Rida A. Bazzi

  2. Brown University, Providence, RI, 02912, USA

    Maurice Herlihy

Authors
  1. Rida A. Bazzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maurice Herlihy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Illinois at Urbana Champaign, 61801, Urbana, IL, USA

    Tarek Abdelzaher

  2. IRISA, Campus de Beaulieu, Universit de Rennes1, Avenue du G´en´eral Leclerc,, 35042, Rennes Cedex, France

    Michel Raynal

  3. School of Computer Science, Carleton University, 1125 Colonel By Drive, K1S 5B6, Ottawa, Canada

    Nicola Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bazzi, R.A., Herlihy, M. (2009). Enhanced Fault-Tolerance through Byzantine Failure Detection. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds) Principles of Distributed Systems. OPODIS 2009. Lecture Notes in Computer Science, vol 5923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10877-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10877-8_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10876-1

  • Online ISBN: 978-3-642-10877-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation