Skip to main content

Brief Announcement: A Leader-free Byzantine Consensus Algorithm

  • Conference paper

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

Abstract

We consider the consensus problem in a partially synchronous system with Byzantine faults. In a distributed system of n processes, where each process has an initial value, Byzantine consensus is the problem of agreeing on a common value, even though some of the processes may fail in arbitrary, even malicious, ways. It is shown in [11] that — in a synchronous system — 3t + 1 processes are needed to solve the Byzantine consensus problem without signatures, where t is the maximum number of Byzantine processes. In an asynchronous system, Fischer, Lynch and Peterson [7] proved that no deterministic asynchronous consensus protocol can tolerate even a single non-Byzantine (= crash) failure. The problem can however be solved using randomization for benign and Byzantine faults. For Byzantine faults, Ben-Or [2] and Rabin [12] showed that this requires 5t + 1 processes. Later, Bracha [3] increased the resiliency of the randomized algorithm to 3t + 1.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-642-04355-0_48
  • Chapter length: 2 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   99.00
Price excludes VAT (USA)
  • ISBN: 978-3-642-04355-0
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   129.99
Price excludes VAT (USA)

References

  1. Amir, Y., Coan, B., Kirsch, J., Lane, J.: Byzantine Replication Under Attack. In: DSN 2008, pp. 197–206 (2008)

    Google Scholar 

  2. Ben-Or, M.: Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols. In: PODC 1983, pp. 27–30. ACM, New York (1983)

    Google Scholar 

  3. Bracha, G.: An asynchronous [(n - 1)/3]-resilient consensus protocol. In: PODC 1984, pp. 154–162. ACM, New York (1984)

    Google Scholar 

  4. Castro, M., Liskov, B.: Practical Byzantine Fault Tolerance and Proactive Recovery. Transactions on Computer Systems (TOCS) 20(4), 398–461 (2002)

    CrossRef  Google Scholar 

  5. Clement, A., Wong, E., Alvisi, L., Dahlin, M., Marchetti, M.: Making Byzantine fault tolerant systems tolerate Byzantine faults. In: NSDI 2009, pp. 153–168. USENIX Association (2009)

    Google Scholar 

  6. Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the Presence of Partial Synchrony. JACM 35(2), 288–323 (1988)

    MathSciNet  CrossRef  Google Scholar 

  7. Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of Distributed Consensus with one Faulty Process. J. ACM 32(2), 374–382 (1985)

    MathSciNet  CrossRef  MATH  Google Scholar 

  8. Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.: Zyzzyva: speculative byzantine fault tolerance. SIGOPS Oper. Syst. Rev. 41(6), 45–58 (2007)

    CrossRef  Google Scholar 

  9. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)

    MATH  Google Scholar 

  10. Martin, J.P., Alvisi, A.: Fast Byzantine Consensus. IEEE Transactions on Dependable and Secure Computing 3(3), 202–215 (2006)

    CrossRef  Google Scholar 

  11. Pease, M., Shostak, R., Lamport, L.: Reaching Agreement in the Presence of Faults. J. ACM 27(2), 228–234 (1980)

    MathSciNet  CrossRef  MATH  Google Scholar 

  12. Rabin, M.: Randomized Byzantine generals. In: Proc. Symposium on Foundations of Computer Science, pp. 403–409 (1983)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Borran, F., Schiper, A. (2009). Brief Announcement: A Leader-free Byzantine Consensus Algorithm. In: Keidar, I. (eds) Distributed Computing. DISC 2009. Lecture Notes in Computer Science, vol 5805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04355-0_48

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04355-0_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04354-3

  • Online ISBN: 978-3-642-04355-0

  • eBook Packages: Computer ScienceComputer Science (R0)