articleACM Transactions on Computer SystemsOct 7, 2002Closed access

Practical byzantine fault tolerance and proactive recovery

Microsoft (United States) · Microsoft Research (United Kingdom)

Indexed incrossref

Abstract

Our growing reliance on online services accessible on the Internet demands highly available systems that provide correct service without interruptions. Software bugs, operator mistakes, and malicious attacks are a major cause of service interruptions and they can cause arbitrary behavior, that is, Byzantine faults. This article describes a new replication algorithm, BFT, that can be used to build highly available systems that tolerate Byzantine faults. BFT can be used in practice to implement real services: it performs well, it is safe in asynchronous environments such as the Internet, it incorporates mechanisms to defend against Byzantine-faulty clients, and it recovers replicas proactively. The recovery…

Citation impact

2,460
total citations
FWCI
18.71
Percentile
100%
References
84
Citations per year

Authors

2

Topics & keywords

Keywords
  • Byzantine fault tolerance
  • Computer science
  • Quantum Byzantine agreement
  • Asynchronous communication
  • Distributed computing
  • Vulnerability (computing)
  • The Internet
  • Intrusion tolerance
UN Sustainable Development Goals
  • Peace, Justice and strong institutions
No related works found for this paper.