Interactive Consistency Algorithms Based on Voting and Error-Correding Codes

Th. Krol

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    41 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 languageUndefined
    Title of host publicationProc. of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
    Place of PublicationPasadena, CA USA
    PublisherIEEE
    Pages89-98
    ISBN (Print)0-8186-7079
    DOIs
    Publication statusPublished - 31 Jan 1995

    Publication series

    Name
    PublisherIEEE

    Keywords

    • METIS-119369
    • IR-18847

    Cite this

    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 (pp. 89-98). Pasadena, CA USA: IEEE. https://doi.org/10.1109/FTCS.1995.466994