TY - GEN
T1 - Fast asynchronous byzantine agreement with optimal resilience
AU - Canetti, Ran
AU - Rabin, Tal
N1 - Publisher Copyright:
© 1993 ACM.
PY - 1993/6/1
Y1 - 1993/6/1
N2 - The Byzantine Agreement problem is one of the most fundamental problems in the field of distributed computing. However, despite extensive research, a few important questions have remained open. The resilience of a protocol is the maximum number of faults in the presence of which the protocol meets its specification. It is known that no BA protocol for n players (either synchronous or asynchronous) can be [n/3]1-resilient. The only known asynchronous ([n/3]1 - l)- resilient BA protocol runs in expected exponential time A long standing open question is whether there exists a fast asynchronous ([n/3]1 - 1)-resilient BA protocol. We answer this question in the affirmative. We consider a completely asynchronous network of n players, in which every two players are connected via a private channel. Furthermore, we let the faulty players have unlimited computational power. In this setting, we describe an ( [n/3]1 - I)-resilient Byzantine Agreement protocol. With overwhelming probability all the non-faulty players complete the execution of the protocol. Conditioned on the event that all the non-faulty players have completed the execution of the protocol, they do so in constant expected time. Our construction employs an ([n/3]1 - 1)-resilient Asynchronous Verifiable Secret Sharing (AVSS) scheme. No ([n/3]1 - 1)-resilient AVSS scheme was previously known. Our AVSS scheme employs new asynchronous tools which are of independent interest.
AB - The Byzantine Agreement problem is one of the most fundamental problems in the field of distributed computing. However, despite extensive research, a few important questions have remained open. The resilience of a protocol is the maximum number of faults in the presence of which the protocol meets its specification. It is known that no BA protocol for n players (either synchronous or asynchronous) can be [n/3]1-resilient. The only known asynchronous ([n/3]1 - l)- resilient BA protocol runs in expected exponential time A long standing open question is whether there exists a fast asynchronous ([n/3]1 - 1)-resilient BA protocol. We answer this question in the affirmative. We consider a completely asynchronous network of n players, in which every two players are connected via a private channel. Furthermore, we let the faulty players have unlimited computational power. In this setting, we describe an ( [n/3]1 - I)-resilient Byzantine Agreement protocol. With overwhelming probability all the non-faulty players complete the execution of the protocol. Conditioned on the event that all the non-faulty players have completed the execution of the protocol, they do so in constant expected time. Our construction employs an ([n/3]1 - 1)-resilient Asynchronous Verifiable Secret Sharing (AVSS) scheme. No ([n/3]1 - 1)-resilient AVSS scheme was previously known. Our AVSS scheme employs new asynchronous tools which are of independent interest.
UR - http://www.scopus.com/inward/record.url?scp=0027313816&partnerID=8YFLogxK
U2 - 10.1145/167088.167105
DO - 10.1145/167088.167105
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0027313816
T3 - Proceedings of the Annual ACM Symposium on Theory of Computing
SP - 42
EP - 51
BT - Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993
PB - Association for Computing Machinery
T2 - 25th Annual ACM Symposium on Theory of Computing, STOC 1993
Y2 - 16 May 1993 through 18 May 1993
ER -