FPC-BI: Fast Probabilistic Consensus within Byzantine Infrastructures

Practical Synchronous Byzantine Consensus

We present new protocols for Byzantine state machine replication and Byzantine agreement in the synchronous and authenticated setting. The celebrated PBFT state machine replication protocol tolerates f Byzantine faults in an asynchronous setting using 3f + 1 replicas, and has since been studied or deployed by numerous works. In this work, we improve the Byzantine fault tolerance to n = 2f + 1 b...

Efficient Synchronous Byzantine Consensus

We present new protocols for Byzantine state machine replication and Byzantine agreement in the synchronous and authenticated setting. The celebrated PBFT state machine replication protocol tolerates f Byzantine faults in an asynchronous setting using 3f +1 replicas, and has since been studied or deployed by numerous works. In this work, we improve the Byzantine fault tolerance threshold to n =...

Wait-free Byzantine consensus

Relaxed Byzantine Vector Consensus

Byzantine vector consensus requires that non-faulty processes reach agreement on a decision (or output) that is in the convex hull of the inputs at the non-faulty processes. Recent work has shown that, for n processes with up to f Byzantine failures, when the inputs are d-dimensional vectors of reals, n ≥ max (3f + 1, (d+ 1)f + 1) is the tight bound for synchronous systems, and n ≥ (d+ 2)f + 1 ...

Constant-Space Localized Byzantine Consensus

Adding Byzantine tolerance to large scale distributed systems is considered non-practical. The time, message and space requirements are very high. Recently, researches have investigated the broadcast problem in the presence of a f̀ -local Byzantine adversary. The local adversary cannot control more than f̀ neighbors of any given node. This paper proves sufficient conditions as to when the synchro...