Interactive Consistency Algorithms Based on Voting and Error-Correding Codes


Share/Save/Bookmark

Krol, Thijs (1995) Interactive Consistency Algorithms Based on Voting and Error-Correding Codes. In: Twenty-Fifth International Symposium on Fault-Tolerant Computing, Pasadena, CA, USA 1995. FTCS-25. Digest of Papers, 27-30 June 1995 , Pasadena, CA (pp. pp. 89-98).

open access
[img]
Preview
PDF
887kB
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
Item Type:Conference or Workshop Item
Copyright:©1995 IEEE
Research Group:
Link to this item:http://purl.utwente.nl/publications/18847
Official URL:http://dx.doi.org/10.1109/FTCS.1995.466994
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 119369