Common Contracts
1 similar null contracts
Asynchronous Byzantine Agreement with Optimal Resilience and Linear ComplexityOctober 11th, 2018
Given a system with n > 3t + 1 processes, where t is the tolerated number of faulty ones, we present a fast asynchronous Byzantine agreement protocol that can reach agreement in O(t) expected running time. This improves the O(n2) expected running time of Abraham, Dolev, and Halpern [1]. Furthermore, if n = (3 + ε)t for any ε > 0, our protocol can reach agreement in O(1/ε) expected running time. This improves the result of Feldman and Micali [7] (with constant expected running time when n > 4t).
