Extending Binary Byzantine Agreement to Multivalued Byzantine Agreement.

Abstract

A binary Byzantine agreement algorithm can be extended to produce a multivalued Byzantine agreement algorithm. The resulting multivalued algorithm is cheaper than previously published algorithms when the cost of transmitting values from the multivalued domain is significant. The concern of this paper is a set of potentially faulty processes that engage in a distributed computation to agree on some piece of information. Each process enters the computation with an initial value. The computation returns a common result value to each correct process. If all correct processes begin the computation with identical initial values, then the result equals the initial value.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1984
Accession Number
ADA143424

Entities

People

  • B. A. Coan
  • R. Turpin

Organizations

  • Massachusetts Institute of Technology

Tags

DTIC Thesaurus Topics

  • Agreements
  • Algorithms
  • Authentication
  • Computations
  • Computer Programming
  • Computer Science
  • Computers
  • Fault Tolerance
  • Information Processing
  • Information Systems
  • Information Transfer
  • Language
  • Military Research
  • Programming Languages
  • Security
  • Technical Information Centers

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.