|Title:||THE BEST OF BOTH WORLDS: GUARANTEEING TERMINATION IN FAST RANDOMIZED BYZANTINE AGREEMENT PROTOCOLS
|Authors:||O. Goldreich and E. Petrank
|Abstract:||All known fast randomized Byzantine Agreement (BA) protocols have (rare) infinite runs. We present a method of combining a randomized BA protocol of a certain class with any detenninistic BA protocol to obtain a randomized protocol which preserves the expected average complexity of the randomized protocol while guaranteeing tennination in all runs. In panicular, we obtain a randomized BA protocol with constant expected time which always tenninate within t +0 (log t) rounds, where t =0 (n) is the number offaulty processors.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1990/CS/CS0634), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1990
To the main CS technical reports page
Computer science department, Technion