Analysis of Binary Voting Algorithms for Use in Fault-Tolerant and Secure Computing

Abstract

This paper examines three binary voting algorithms used with computer replication for fault tolerance and separately observes the resultant reliability and security. The paper offers insights to answer the following question: Can a voting algorithm provide a system with both security and reliability? The paper shows that while random dictator (i.e., randomly choosing one of the replicas) provides good security and majority rule yields good fault tolerance, neither is effective in both. The authors present the random troika (a subset of 3 replicas) as an effective combination of fault-tolerant and secure computing.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 2011
Accession Number
ADA549606

Entities

People

  • Alan Taylor
  • Daniel Hill
  • Kevin A. Kwiat
  • Sean Wetzonis
  • Shangping Ren
  • William Zwicker

Organizations

  • Air Force Research Laboratory

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Air Force
  • Air Force Research Laboratories
  • Algorithms
  • Computer Science
  • Computers
  • Engineering
  • Fault Tolerance
  • Game Theory
  • High Reliability
  • Mathematics
  • Military Research
  • New York
  • Probability
  • Reliability
  • Replicas
  • Security
  • Universities

Fields of Study

  • Computer science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Strategic Security Studies