Deterministic Consensus Algorithm with Linear Per-Bit Complexity

Abstract

In this report, building on the deterministic multi-valued one-to-many Byzantine agreement (broadcast) algorithm in our recent technical report [2], we introduce a deterministic multivalued all-to-all Byzantine agreement algorithm (consensus), with linear complexity per bit agreed upon. The discussion in this note is not self-contained, and relies heavily on the material in [2] please refer to [2] for the necessary background.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 26, 2010
Accession Number
ADA555082

Entities

People

  • Guanfeng Liang
  • Nitin H. Vaidya

Organizations

  • University of Illinois Urbana–Champaign

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Agreements
  • Algorithms
  • Computer Science
  • Computers
  • Consensus Algorithms
  • Damage Detection
  • Demographic Cohorts
  • Detection
  • Engineering
  • Illinois
  • Information Operations
  • Mathematics
  • Mesh Networks
  • Military Research
  • Observation

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Business Analytics