Interactive Consistency Algorithms Based on Voting and Error-Correcting Codes

Authors:
Thijs Krol
Affiliations:
-
Venue:
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Year:
1995

Citing 4
Cited 1

(N, K) Concept Fault Tolerance

IEEE Transactions on Computers - The MIT Press scientific computation series
The consensus problem in fault-tolerant computing

ACM Computing Surveys (CSUR)
Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
Synchronization and Matching in Redundant Systems

IEEE Transactions on Computers

All-to-All gradecast using coding with byzantine failures

SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new class of synchronous deterministic non-authenticated algorithms for reaching interactive consistency (Byzantine agreement). The algorithms are based on voting and error-correcting codes and require considerably less data communication than the original algorithm, whereas the number of rounds and the number of modules meet the minimum bounds. These algorithm based on voting and coding will be defined and proved on the basis of a class of algorithms, called the Dispersed Joined Communication algorithms.