Common Contracts
1 similar Byzantine Agreement contracts
Communication-Efficient Byzantine Agreement without ErasuresByzantine Agreement • May 22nd, 2021
Byzantine agreement (BA) is one of the most fundamental building blocks in distributed sys- tems. A long-standing open problem is whether BA protocols with subquadratic communication complexity are possible in the presence of an adaptive attacker. A breakthrough result by King and Saia (JACM’11) showed how to overcome the quadradtic “barrier”, assuming erasures—that is, honest player can untraceably erase memory contents—achieving a communication complex- ity of n1.5 while tolerating a constant fraction of corrupt nodes. Another very recent result by Micali (ITCS’17) also considers the erasure model and shows how to achieve close-to-optimal communication complexity O(n · poly log n), and handling f < (1 − ǫ)n/3 corrupted players, but this time using cryptographic assumptions (the existence of unique signatures and a “ran- dom oracle”) and relying on a public key infrastructure (PKI). Both of these results are in the synchronous model of computation.
