Welcome to the resource topic for 2022/917
Title:
Almost-Surely Terminating Asynchronous Byzantine Agreement Against General Adversaries with Optimal Resilience
Authors: Ashish Choudhury
Abstract:In this work, we present an almost-surely terminating asynchronous Byzantine agreement (ABA) protocol for n parties. Our protocol requires {\cal O}(n^2) expected time and is secure against a computationally-unbounded malicious (Byzantine) adversary, characterized by a non-threshold adversary structure {\cal Z}, which enumerates all possible subsets of potentially corrupt parties. Our protocol has optimal resilience where {\cal Z} satisfies the {\cal Q}^{(3)} condition; i.e. union of no three subsets from {\cal Z} covers all the n parties. To the best of our knowledge, this is the first almost-surely terminating ABA protocol with {\cal Q}^{(3)} condition. Previously, almost-surely terminating ABA protocol is known with non-optimal resilience where {\cal Z} satisfies the {\cal Q}^{(4)} condition; i.e. union of no four subsets from {\cal Z} covers all the n parties. To design our protocol, we present a shunning asynchronous verifiable secret-sharing (SAVSS) scheme with {\cal Q}^{(3)} condition, which is of independent interest.
ePrint: https://eprint.iacr.org/2022/917
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 .