Activities per year
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.
|Title of host publication||Proceedings IFIP Working Conferences on Dependable Computing for Critical Applications (DCCA 1995)|
|Subtitle of host publication||Urbana-Champaign, Illinois, USA, 27-29 September 1995|
|Number of pages||11|
|Publication status||Published - Sep 1995|
|Event||IFIP Working Conferences on Dependable Computing for Critical Applications, DCCA-5 1995 - Urbana-Champaign, United States|
Duration: 27 Sep 1995 → 29 Sep 1995
Conference number: 5
|Conference||IFIP Working Conferences on Dependable Computing for Critical Applications, DCCA-5 1995|
|Period||27/09/95 → 29/09/95|
FingerprintDive into the research topics of 'Interactive Consistency Algorithms Based on Authentication and Error-correcting Codes'. Together they form a unique fingerprint.
- 1 Oral presentation