Asynchronous Byzantine Agreement with Subquadratic CommunicationAsynchronous Byzantine Agreement • June 12th, 2023
Asynchronous Byzantine Agreement in Incomplete NetworksAsynchronous Byzantine Agreement • May 27th, 2020
The Byzantine agreement problem is considered to be a core prob- lem in distributed systems. For example, Byzantine agreement is needed to build a blockchain, a totally ordered log of records. Blockchains are asynchronous distributed systems, fault-tolerant against Byzantine nodes.
Asynchronous Byzantine Agreement with Subquadratic CommunicationAsynchronous Byzantine Agreement • July 12th, 2020
Understanding the communication complexity of Byzantine agreement (BA) is a fundamental problem in distributed computing. In particular, as protocols are run with a large number of parties (as, e.g., in the context of blockchain protocols), it is important to understand the dependence of the communication on the number of parties n. Although adaptively secure BA protocols with o(n2) communication are known in the synchronous and partially synchronous settings, no such protocols are known in the fully asynchronous case.
Asynchronous Byzantine Agreement with Subquadratic CommunicationAsynchronous Byzantine Agreement • October 6th, 2020
Understanding the communication complexity of Byzantine agreement (BA) is a fundamental problem in distributed computing. In particular, for protocols involving a large number of parties (as in, e.g., the context of blockchain protocols), it is impor- tant to understand the dependence of the communication on the number of parties n. Although adaptively secure BA protocols with o(n2) communication are known in the synchronous and partially synchronous settings, no such protocols are known in the fully asynchronous case.
