1 citations · 2 across the 6 of their papers we have counts for
Showing cs.DCShow all
3 papers · 1 filter
cs.DC2022
BeeGees: stayin' alive in chained BFT
Ittai Abraham, Natacha Crooks, Neil Giridharan +2
Modern chained Byzantine Fault Tolerant (BFT) systems leverage a combination of pipelining and leader rotation to obtain both efficiency and fairness. These protocols, however, req…
cs.DC2021★ 1 cited
An Analysis of Multi-hop Iterative Approximate Byzantine Consensus with Local Communication
Matthew Ding
Iterative Approximate Byzantine Consensus (IABC) is a fundamental problem of fault-tolerant distributed computing where machines seek to achieve approximate consensus to arbitrary…
cs.DC2020★ 1 cited
Relay Protocol for Approximate Byzantine Consensus
Matthew Ding
Approximate byzantine consensus is a fundamental problem of distributed computing. This paper presents a novel algorithm for approximate byzantine consensus, called Relay-ABC. The…