Practical Byzantine fault tolerance

By Miguel Oom Temudo de Castro. 1999

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

DRACO: Byzantine-resilient Distributed Training via Redundant Gradients (2018, background): “Due to increasingly common malicious attacks, hardware and software errors (Castro et al., 1999; Kotla et al., 2007; Blanchard et al., 2017; Chen et al., 2017), protecting distributed machine learning against adversarial attacks and failures has become increasingly important.”
Federated Learning: Challenges, Methods, and Future Directions (2019, background): “n the underlying statistical structure. 2.2.3 Fault Tolerance Fault tolerance has been extensively studied in the systems community and is a fundamental consideration of classical distributed systems [19, 71, 110]. Recent works have also investigated fault tolerance speciﬁcally for machine learning ”
Biscotti: A Ledger for Private and Secure Peer-to-Peer Machine Learning (2018, background): “Because ML does not require strong consensus or consistency to converge [43], traditional strong consensus protocols such as Byzantine Fault Tolerant (BFT) protocols [15] are too restrictive for machine learning workloads.”
Proactively Accountable Anonymous Messaging in Verdict (2012, background): “We expect off-the-shelf Byzantine Fault Tolerance algorithms [12] to be applicable to this group evolution problem.”
Blockchain for the Internet of Vehicles Towards Intelligent Transportation Systems: A Survey (2020, background): “With the help of PBFT and PoW consensus mechanisms, this proposed scheme is able to make a decentralized network.”
A Survey of Blockchain Technology Applied to Smart Cities: Research Issues and Challenges (2019, background): “PBFT is a replication algorithm to tolerate byzantine faults.”
Reclaiming space from duplicate files in a serverless distributed file system (2002, background): “The integrity of file content and of the system namespace is rooted in replicated state machines that communicate via a Byzantine-fault-tolerant protocol [11].”
Separating agreement from execution for byzantine fault tolerant services (2003, methodology): “To address this issue, our prototype employs the standard technique [11, 12, 36] of resolving nondeterminism by having the primary agreement node select any nondeterministic value needed by a request and include that value in agreement certificates; each execution node runs a deterministic algorithm”
Rx: treating bugs as allergies---a safe method to survive software failures (2005, methodology): “We can borrow many ideas, such as, coordinated checkpointing, asynchronous recovery, etc, from previous work on supporting fault tolerance in distributed systems [15, 16, 24, 45, 1], and also from recent work such as micro-reboot [14].”
A Survey on Blockchain Technology: Evolution, Architecture and Security (2021, background): “To efﬁciently survive Byzantine faults in asynchronous network, the authors in [93] propose ﬁrst state-machine replication protocol.”
Algorand: Scaling Byzantine Agreements for Cryptocurrencies (2017, methodology): “Byzantine agreement protocols have been used to replicate a service across a small group of servers, such as in PBFT [15].”
A Generalized Birthday Problem (2002, methodology): “, give no concrete suggestions for the size of m, and so it is no surprise that some implementors have used inadequate parameters: for instance, NASD used a 256bit modulus [13,14], and several implementations have used a 128-bit modulus [8,9,32].”
Everything You Wanted to Know About the Blockchain: Its Promise, Components, Processes, and Problems (2018, methodology): “The practical Byzantine fault tolerance (PBFT) algorithm was proposed as a solution to the Byzantine Generals’ Problem, which is about conducting a successful attack on a rival city by the Byzantine army [11], [12].”
An Overview on Smart Contracts: Challenges, Advances and Platforms (2019, unknown): “Fabric chooses to PBFT consensus algorithm [24], in which several rounds of voting among authenticated nodes are taken to reach the consensus.”
STAR : An Efficient Coding Scheme for Correcting Triple Storage Node Failures (2005, methodology): “In fact, many research and development efforts have been made to address various issues of building reliable data storage systems to ensure data survivability, reliability, availability, and integrity, including disk arrays such as RAID [14], clustered systems such as NOW [2] and RAIN [12], distribu”