Randomized Byzantine Agreement
Loading...
No Access Until
Permanent Link(s)
Collections
Other Titles
Authors
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.
Journal / Series
Volume & Issue
Description
Sponsorship
Date Issued
1984-03
Publisher
Cornell University
Keywords
computer science; technical report
Location
Effective Date
Expiration Date
Sector
Employer
Union
Union Local
NAICS
Number of Workers
Committee Chair
Committee Co-Chair
Committee Member
Degree Discipline
Degree Name
Degree Level
Related Version
Related DOI
Related To
Related Part
Based on Related Item
Has Other Format(s)
Part of Related Item
Related To
Related Publication(s)
Link(s) to Related Publication(s)
References
Link(s) to Reference(s)
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR84-595
Government Document
ISBN
ISMN
ISSN
Other Identifiers
Rights
Rights URI
Types
technical report