Interactive Consistency Algorithms Based on Voting and Error-Correding Codes

Th. Krol

doi:10.1109/FTCS.1995.466994

Interactive Consistency Algorithms Based on Voting and Error-Correding Codes

Th. Krol

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

136 Downloads (Pure)

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 algorithms based on voting and coding are defined and proved on the basis of a class of algorithms, called the dispersed joined communication algorithms

Original language	Undefined
Title of host publication	Proc. of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Place of Publication	Pasadena, CA USA
Publisher	IEEE
Pages	89-98
ISBN (Print)	0-8186-7079
DOIs	https://doi.org/10.1109/FTCS.1995.466994
Publication status	Published - 31 Jan 1995
Event	Twenty-Fifth International Symposium on Fault-Tolerant Computing, Pasadena, CA, USA 1995. FTCS-25. Digest of Papers - Pasadena, CA Duration: 27 Jun 1995 → 30 Jun 1995

Publication series

Name
Publisher	IEEE

Conference

Conference	Twenty-Fifth International Symposium on Fault-Tolerant Computing, Pasadena, CA, USA 1995. FTCS-25. Digest of Papers
Period	27/06/95 → 30/06/95
Other	27-30 June 1995

Keywords

METIS-119369
IR-18847

Access to Document

10.1109/FTCS.1995.466994

00466994

Cite this

@inproceedings{943473ed3f6243dda4a382c9f56064e2,

title = "Interactive Consistency Algorithms Based on Voting and Error-Correding Codes",

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 algorithms based on voting and coding are defined and proved on the basis of a class of algorithms, called the dispersed joined communication algorithms",

keywords = "METIS-119369, IR-18847",

author = "Th. Krol",

year = "1995",

month = jan,

day = "31",

doi = "10.1109/FTCS.1995.466994",

language = "Undefined",

isbn = "0-8186-7079",

publisher = "IEEE",

pages = "89--98",

booktitle = "Proc. of the Twenty-Fifth International Symposium on Fault-Tolerant Computing",

address = "United States",

note = "Twenty-Fifth International Symposium on Fault-Tolerant Computing, Pasadena, CA, USA 1995. FTCS-25. Digest of Papers ; Conference date: 27-06-1995 Through 30-06-1995",

}

Krol, T 1995, Interactive Consistency Algorithms Based on Voting and Error-Correding Codes. in Proc. of the Twenty-Fifth International Symposium on Fault-Tolerant Computing. IEEE, Pasadena, CA USA, pp. 89-98, Twenty-Fifth International Symposium on Fault-Tolerant Computing, Pasadena, CA, USA 1995. FTCS-25. Digest of Papers, 27/06/95. https://doi.org/10.1109/FTCS.1995.466994

TY - GEN

T1 - Interactive Consistency Algorithms Based on Voting and Error-Correding Codes

AU - Krol, Th.

PY - 1995/1/31

Y1 - 1995/1/31

N2 - 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 algorithms based on voting and coding are defined and proved on the basis of a class of algorithms, called the dispersed joined communication algorithms

AB - 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 algorithms based on voting and coding are defined and proved on the basis of a class of algorithms, called the dispersed joined communication algorithms

KW - METIS-119369

KW - IR-18847

U2 - 10.1109/FTCS.1995.466994

DO - 10.1109/FTCS.1995.466994

M3 - Conference contribution

SN - 0-8186-7079

SP - 89

EP - 98

BT - Proc. of the Twenty-Fifth International Symposium on Fault-Tolerant Computing

PB - IEEE

CY - Pasadena, CA USA

T2 - Twenty-Fifth International Symposium on Fault-Tolerant Computing, Pasadena, CA, USA 1995. FTCS-25. Digest of Papers

Y2 - 27 June 1995 through 30 June 1995

ER -