Interactive Consistency Algorithms Based on Authentication and Error-correcting Codes

André Postma, Thijs Krol

    Research output: Chapter in Book/Report/Conference proceedingConference contributionProfessional

    5 Downloads (Pure)

    Abstract

    In this paper, a class of interactive consistency algorithms is described, based on authentication and error-correcting codes. These algorithms require considerably less data communication than existing algorithms, whereas the required number of modules and communication rounds meet the minimum bounds. The algorithms based on authentication and error-correcting codes are defined and proved on basis of a class of algorithms called the Authenticated Dispersed Joined Communication Algorithms.
    Original languageEnglish
    Title of host publicationProceedings IFIP Working Conferences on Dependable Computing for Critical Applications (DCCA 1995)
    Subtitle of host publicationUrbana-Champaign, Illinois, USA, 27-29 September 1995
    PublisherIFIP
    Number of pages11
    Publication statusPublished - Sep 1995
    EventIFIP Working Conferences on Dependable Computing for Critical Applications, DCCA-5 1995 - Urbana-Champaign, United States
    Duration: 27 Sep 199529 Sep 1995
    Conference number: 5

    Conference

    ConferenceIFIP Working Conferences on Dependable Computing for Critical Applications, DCCA-5 1995
    Abbreviated titleDCCA
    CountryUnited States
    CityUrbana-Champaign
    Period27/09/9529/09/95

    Fingerprint Dive into the research topics of 'Interactive Consistency Algorithms Based on Authentication and Error-correcting Codes'. Together they form a unique fingerprint.

    Cite this