Welcome to the resource topic for 2024/403
Title:
DARE to agree: Byzantine Agreement with Optimal Resilience and Adaptive Communication
Authors: Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira
Abstract:Byzantine Agreement (BA) enables n processes to reach consensus on a common valid L_o-bit value, even in the presence of up to tn/3. Different instantiations of ADA-DARE achieve near-optimal adaptive bit complexity of O(nL_o + n(f + 1) \kappa) for both strong multi-valued validated BA (SMVBA) and interactive consistency (IC). By definition, for IC, L_o = nL_{in}, with L_{in} representing the size of an input value.
These results achieve optimal O(n(L_o+f)) word complexity and significantly improve the previous best results by up to a linear factor, depending on L_o and f.
ePrint: https://eprint.iacr.org/2024/403
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .