Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6435
Title: Randomized Byzantine Agreement
Authors: Perry, Kenneth J.
Keywords: computer science
technical report
Issue Date: Mar-1984
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR84-595
Abstract: A randomized model of distributed computation was presented in [Rabin83]. This model admits a solution to the Byzantine Agreement Problem for systems of $n$ asynchronous processes where no more than $t$ are faulty. The algorithm described in [Rabin83] produces agreement in an expected number of rounds whish is a small constant independent of $n$ and $t$. Using the same model, we present an algorithm of similar complexity which is able to tolerate a greater proportion of malicious processes. The algorithm is also applicable, with minor changes, to systems of synchronous processes.
URI: http://hdl.handle.net/1813/6435
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
84-595.pdf1.18 MBAdobe PDFView/Open
84-595.ps399.71 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us