Separating agreement from execution for byzantine fault tolerant services

By Jian Yin, Jean-Philippe Martin, Arun Venkataramani, Lorenzo Alvisi, M. Dahlin. Symposium on Operating Systems Principles, 2003

402 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/73ec8a241c56608a61b028740600e099a4b56aea

How researchers see this paper

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

In Computer Networks and Communications

Citations in the corpus

Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults (2009, neutral): “This is the same basic structure of PBFT [8] and its direct descendants [4, 18, 19, 33, 32], but revisited with the goal of achieving an execution path that satisfies the properties outlined in the previous section: acceptable performance, ease of implementation, and robustness against Byzantine dis”
A Survey of Distributed Consensus Protocols for Blockchain Networks (2019, background): “[63] presents an alternative BFT-SMR framework that separates consensus (i.”
Efficient Byzantine Fault-Tolerance (2013, methodology): “The main idea of these algorithms is to allow a system to automatically continue operating correctly, even if some of its components exhibit arbitrary, possibly malicious behavior [4], [12], [13], [15], [17], [19], [26], [29], [30], [39], [49].”
The Chubby lock service for loosely-coupled distributed systems (2006, methodology): “Like a lock service, a consensus service would allow clients to make progress safely even with only one active client process; a similar technique has been used to reduce the number of state machines needed for Byzantine fault tolerance [24].”
Depot: Cloud Storage with Minimal Trust (2010, background): “For example, quorum and replicated state machine approaches [9, 24, 28, 29, 32, 41, 53, 54, 85, 95, 99, 100] tolerate failures by a fraction of servers.”
Fast Byzantine Consensus (2006, background): “However, an architecture for Byzantine fault tolerant state machine replication that physically separates agreement from execution [20] makes this tradeoff look much more attractive.”
Attested append-only memory: making adversaries stick to their word (2007, methodology): “For conciseness, throughout the paper we use the authentication notation of Yin et al. [39], according to which we denote by X i S,D,k an authentication certiﬁcate that any node in a set D can regard as proof that k distinct nodes in S said X .”
Hyperledger fabric: a distributed operating system for permissioned blockchains (2018, background): “The same peers often execute the applications as well, under the same security assumption (even though one could actually restrict BFT execution to fewer peers [37]).”
SBFT: A Scalable and Decentralized Trust Infrastructure (2018, methodology): “SBFT uses the conceptual approach of separating commitment from execution that is based on Yin et al. [76].”
Tendermint: Byzantine Fault Tolerance in the Age of Blockchains (2016, background): “Hence, despite a resurgence in academic interest, including numerous improved variations [107, 58] not much progress was made in the way of implementations and deployment.”
A Vademecum on Blockchain Technologies: When, Which, and How (2019, background): “First, consensus on the transactions order is reached, then the ordered transactions are executed, which improves the system’s fault tolerance [159].”
BAR fault tolerance for cooperative services (2005, background): “Our work is clearly indebted to recent research [2, 10, 36, 53, 63] that has shown how BFT can be practical in distributed systems that fall under a single administrative domain—indeed, Castro and Liskov’s BFT state machine [10]”
SoK: Consensus in the Age of Blockchains (2017, methodology): “Separating ordering from execution [96] allows”