
An Analysis of Multihop Iterative Approximate Byzantine Consensus with Local Communication
Iterative Approximate Byzantine Consensus (IABC) is a fundamental proble...
read it

Byzantine Consensus under Local Broadcast Model: Tight Sufficient Condition
In this work we consider Byzantine Consensus on undirected communication...
read it

A PermitBased Optimistic Byzantine Ledger
PermitBFT solves the byzantine consensus problem for n nodes tolerating ...
read it

Frugal Byzantine Computing
Traditional techniques for handling Byzantine failures are expensive: di...
read it

Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model
This paper considers the Byzantine consensus problem for nodes with bina...
read it

Byzantine Geoconsensus
We define and investigate the consensus problem for a set of N processes...
read it

Experimental Evaluation of Asynchronous Binary Byzantine Consensus Algorithms with t < n/3 and O(n^2) Messages and O(1) Round Expected Termination
This work performs an experimental evaluation of four asynchronous binar...
read it
Relay Protocol for Approximate Byzantine Consensus
This paper presents a novel algorithm for Approximate Byzantine Consensus (ABC), called RelayABC. The algorithm allows machines to achieve approximate consensus to arbitrary exactness in the presence of byzantine failures. The algorithm relies on the novel usage of a relayed messaging system and signed messages with unforgeable signatures that are unique to each node. The use of signatures and relays allows the strict necessary network conditions of traditional approximate byzantine consensus algorithms to be circumvented. We also provide theoretical guarantees of validity and convergence for RelayABC. To do this, we utilize the idea that the iteration of states in the network can be modelled by a sequence of transition matrices. We extend previous methods, which use transition matrices to prove ABC convergence, by having each state vector model not just one iteration, but a set of D iterations, where D is a diameter property of the graph. This allows us to accurately model the delays of messages inherent within the relay system.
READ FULL TEXT
Comments
There are no comments yet.