eCommons

 

Randomized Asynchronous Byzantine Agreements

Other Titles

Author(s)

Abstract

A randomized protocol for reaching Byzantine Agreement in asynchronous systems with n processes was recently proposed in [Rabi83]. This protocol tolerates up to ⌊(n−1)/10⌋ faulty processes, and agreement is reached within an expected number of phases that is a small constant independent of n and the number of faulty processes t. In this paper, using the same computation model as in [Rabi83], it is shown that no Byzantine Agreement protocol can overcome more than ⌊(n−1)/3⌋ faulty processes in an asynchronous system, and we describe a protocol that achieves this upper bound. Agreement is also reached within an expected number of phases that is a small constant independent of n and t, but the communication complexity is higher than in [Rabi83}.

Journal / Series

Volume & Issue

Description

Sponsorship

Date Issued

1983-12

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/TR83-587

Government Document

ISBN

ISMN

ISSN

Other Identifiers

Rights

Rights URI

Types

technical report

Accessibility Feature

Accessibility Hazard

Accessibility Summary

Link(s) to Catalog Record