Interactive Consistency Algorithms Based on Authentication and Error-correcting Codes
A.J. Postma, Thijs Krol · University of Twente Research Information · 1995
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. 1. Introduction Fault-tolerant systems will always be connected to basically unreliable input devices. An external faulty module producing broadcast errors (i.e. sending conflicting information to different modules of the fault-tolerant system) may cause a system breakdown in the fault-tolerant system, even if this system does not contain more faulty modules than it is designed to tolerate. This problem is called the Input Problem [1]. The Input Problem can be conquered by so-called Interactive Con...