Efficient Asynchronous Byzantine Agreement without Private SetupsAsynchronous Byzantine Agreement • June 16th, 2021
Efficient Asynchronous Byzantine Agreement without Private SetupsAsynchronous Byzantine Agreement • April 27th, 2022
wi is the ith element in w = Weights(pvss), and Fi∗(0) represents the secret that is committed to some PVSS script pvssi that is computed by the party Pi.
Asynchronous Byzantine Agreement with Optimal ResilienceAsynchronous Byzantine Agreement • October 11th, 2013
Abstract We present an efficient, optimally-resilient Asyn- chronous Byzantine Agreement (ABA) protocol involving n = 3t + 1 parties over a completely asynchronous network, tolerating a computationally unbounded Byzantine adver- sary, capable of corrupting at most t out of the n parties. In comparison with the best known optimally-resilient ABA protocols of Canetti and Rabin (STOC 1993) and Abraham, Dolev and Halpern (PODC 2008), our protocol is signifi- cantly more efficient in terms of the communication com- plexity.
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.
