Randomized distributed agreement revisited

The authors present a succint and efficient randomized distributed agreement (DA) protocol for asynchronous networks that works for n > 5t processors, where n is the size of the network. The protocol has low communication complexity (/spl Theta/(log n) message size) and does not require any cryptographic assumption. The protocol belongs to the class of protocols that require a "trusted dealer", who is in charge of a suitable network initialization, and represents an improvement in terms of number of processors to some previous solutions. The authors contrast their approach to the class of protocols that are currently able to perform randomized agreement from scratch, an unlimited number of times, but have a communication cost that might be infeasible in many cases.

[1]  G. R. Blakley,et al.  Safeguarding cryptographic keys , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[2]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[3]  G. R. BLAKLEY.  Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[4]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[5]  Michael Ben-Or,et al.  Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.

[6]  Danny Dolev,et al.  Authenticated Algorithms for Byzantine Agreement , 1983, SIAM J. Comput..

[7]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[8]  Michael J. Fischer,et al.  The Consensus Problem in Unreliable Distributed Systems (A Brief Survey) , 1983, FCT.

[9]  Michael O. Rabin,et al.  Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[10]  Sam Toueg,et al.  Randomized Byzantine Agreements , 1984, PODC '84.

[11]  Brian A. Coan,et al.  A Simple and Efficient Randomized Byzantine Agreement Algorithm , 1985, IEEE Transactions on Software Engineering.

[12]  Kenneth J. Perry.  Randomized Byzantine Agreement , 1985, IEEE Transactions on Software Engineering.

[13]  Silvio Micali,et al.  Byzantine Agreement in Constant Expected Time (and Trusting No One) , 1985, FOCS 1985.

[14]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[15]  Cynthia Dwork,et al.  Flipping persuasively in constant expected time , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[16]  Silvio Micali,et al.  Optimal algorithms for Byzantine agreement , 1988, STOC '88.

[17]  Cynthia Dwork.  On Verification in Secret Sharing , 1991, CRYPTO.

[18]  Ran Canetti,et al.  Fast asynchronous Byzantine agreement with optimal resilience , 1993, STOC.