Zyzzyva

By R. Kotla, Lorenzo Alvisi, M. Dahlin, Allen Clement, Edmund L. Wong. 2007

903 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Information Systems

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

In Information Systems

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.”
RBFT: Redundant Byzantine Fault Tolerance (2013, background): “Indeed, an analysis of other famous BFT protocols, e.g., PBFT [5], QU [1], HQ [8] and Zyzzyva [14], performed in [7], has shown that these protocols suffer from a robustness issue.”
SBFT: A Scalable and Decentralized Trust Infrastructure (2018, methodology): “Our linear message complexity fast path is based on the techniques of Zyzzyva [47], [48] and its theoretical foundations [57].”
Zyzzyva: Speculative Byzantine fault tolerance (2009, methodology): “An article describing an earlier version of the Zyzzyva system appeared before [Kotla et al. 2007a].”
A Survey of IoT Applications in Blockchain Systems (2020, methodology): “A typical SBFT protocol is introduced in Zyzzyva [Kotla et al. 2007], which significantly improves PBFT efficiency.”
Algorand: Scaling Byzantine Agreements for Cryptocurrencies (2017, background): “Follow-on work has shown how to make Byzantine fault tolerance perform well and scale to dozens of servers [1, 17, 33].”
HotStuff: BFT Consensus with Linearity and Responsiveness (2019, methodology): “, Prime [9], Zyzzyva [34], Upright [22], BFT-SMaRt [13], 700BFT [11], and SBFT [30].”
Tendermint: Byzantine Fault Tolerance in the Age of Blockchains (2016, background): “Some of these focus on so-called optimistic execution, where transactions are executed before they are committed in order to provide a low-latency, optimistic reply to clients [58, 39].”
Enhancing Bitcoin Security and Performance with Strong Consistency via Collective Signing (2016, background): “Due to these optimizations, ByzCoin achieves a throughput higher than Paypal currently handles, with a confirmation latency of 15-20 seconds.”
All You Need is DAG (2021, background): “The amplified need in scalable geo-replicated Byzantine fault-tolerant reliability systems has motivated an enormous amount of study on the Byzantine State Machine Replication (SMR) problem [17, 31].”
Untangling Blockchain: A Data Processing View of Blockchain Systems (2017, background): “Zyzzyva [80] optimizes for normal cases (when there are no failures) via speculative execution.”
A Comprehensive Review of Blockchain Consensus Mechanisms (2021, background): “Since Zyzzyva is a state machine replication (SMR) that operates on 3 f + 1 replicas, it allows a client to collect 2 f + 1 coherent responses within a commit certiﬁcate that has been spread out among replicas [213].”
A survey on security and privacy issues of blockchain technology (2018, background): “[27] discussed the protocol in detail, showing that in order to tolerate the byzantine fault we need to understand the byzantine problem that can be described as an agreement problem where a cluster of generals, individually commanding a percentage of the Byzantine army, enfold a city.”
SoK: Consensus in the Age of Blockchains (2017, background): “Execution optimizations reduce latency by allowing clients [95] or replicas [60] to speculatively execute transactions based on predicted results—if a fault is detected (i.”
ZooKeeper: Wait-free Coordination for Internet-scale Systems (2010, methodology): “There have been proposals of protocols for practical implementations of Byzantine-tolerant replicated state-machines [7, 10, 18, 1, 28].”
Depot: Cloud Storage with Minimal Trust (2010, methodology): “For example, it may be useful to audit SSPs with black-box tests to verify that they are storing data as promised [Kotla et al. 2007; Shah et al. 2007], but we do not examine that issue.”
A Survey of Distributed Consensus Protocols for Blockchain Networks (2019, methodology): “Well-known proposals include Quorum/Update (QU) [44], Hybrid Quorum (HQ) [45], Zyzzyva (using speculative execution) [46], FaB [47], Spinning [48], Robust BFT SMR [49], and Aliph [50].”
Towards Scaling Blockchain Systems via Sharding (2018, background): “, network and execution engine. We plan to re-implement OmniLedger’s design for GRanBea. 6. RELATED WORKS Scaling BFT. Early works on scaling BFT protocols have focused on reducing communication cost [19, 35], number of replicas [18, 39, 61, 29] or execution cost [23]. They either do not use trusted”