Skip to main content

Towards Efficient and Robust BFT Protocols with ER-BFT (Short Paper)

  • Conference paper
  • First Online:
Stabilization, Safety, and Security of Distributed Systems (SSS 2016)

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

  • 626 Accesses

Abstract

Significant efforts have been made in designing Byzantine Fault-Tolerant (BFT) state machine replication. In addition to facing arbitrary types of faults, efficient BFT protocols aim at improving the performance in the absence of faults. This is usually obtained at the expense of higher cost when faults occur. Symmetrically, BFT protocols known as robust protocols tend to improve the performance when some types of faults occur. However, this usually implies a higher overhead in fault-free executions. ER-BFT associates efficiency and robustness to BFT protocols. The paper presents the design principles of ER-BFT, and its implementation through the ER-PBFT protocol. When compared to classical robust BFT protocols, ER-PBFT achieves better performance in fault-free cases, and in presence of faults.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Aublin, P.-L., Mokhtar, S.B., Quéma, V.: RBFT: Redundant Byzantine Fault Tolerance. In: ICDCS (2013)

    Google Scholar 

  2. Behl, J., Distler, T., Kapitza, R.: Consensus-oriented parallelization: how to earn your first million. In: Middleware (2015)

    Google Scholar 

  3. Bessani, A., Sousa, J., Alchieri, E.E.: State machine replication for the masses with BFT-SMaRt. In: DSN (2014)

    Google Scholar 

  4. Castro, M., Liskov, B.: Practical Byzantine fault tolerance. In: OSDI, pp. 173–186 (1999)

    Google Scholar 

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

    Google Scholar 

  6. Lamport, L., Shostak, R.E., Pease, M.C.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382–401 (1982)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Lucas Perronne or Sara Bouchenak .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Perronne, L., Bouchenak, S. (2016). Towards Efficient and Robust BFT Protocols with ER-BFT (Short Paper). In: Bonakdarpour, B., Petit, F. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2016. Lecture Notes in Computer Science(), vol 10083. Springer, Cham. https://doi.org/10.1007/978-3-319-49259-9_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49259-9_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49258-2

  • Online ISBN: 978-3-319-49259-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics