This paper considers the Byzantine consensus problem for nodes with binary inputs. The
nodes are interconnected by a network represented as an undirected graph, and the system …

In the Byzantine agreement problem, a set of n processors, any f of whom may be arbitrarily
faulty, must reach agreement on a value proposed by one of the correct processors. It is a …

We study non-equivocation in synchronous agreement protocols: the restriction on faulty
processes that they cannot act differently towards distinct non-faulty processes. Guarantees …

We consider the approximate consensus problem in a partially connected network of n
nodes where at most f nodes may suffer from Byzantine faults. We study under which …

We consider Byzantine consensus in a synchronous system where nodes are connected by
a network modeled as a directed graph, ie, communication links between neighboring …

Byzantine broadcast is a distributed primitive that allows a specific party to consistently
distribute a message among n parties in the presence of potential misbehavior of up to t of …

This paper considers the problem of achieving exact Byzantine consensus in a synchronous
system under a local-broadcast communication model. The nodes communicate with each …

Since 1982, numerous Byzantine Agreement Protocols (BAPs) have been developed to
solve arbitrary faults in the Byzantine Generals Problem (BGP). A novel BAP, using an …

Byzantine consensus is a classical problem in distributed computing. Each node in a
synchronous system starts with a binary input. The goal is to reach agreement in the …

In this work we consider Byzantine Consensus on undirected communication graphs under
the local broadcast model. In the classical point-to-point communication model the …