Interactive Consistency Algorithms Based on Authentication and Error-correcting Codes

André Postma; Thijs Krol

Interactive Consistency Algorithms Based on Authentication and Error-correcting Codes

André Postma, Thijs Krol

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Professional

27 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 language	English
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
Publisher	IFIP
Number of pages	11
Publication status	Published - Sept 1995
Event	IFIP Working Conferences on Dependable Computing for Critical Applications, DCCA-5 1995 - Urbana-Champaign, United States Duration: 27 Sept 1995 → 29 Sept 1995 Conference number: 5

Conference

Conference	IFIP Working Conferences on Dependable Computing for Critical Applications, DCCA-5 1995
Abbreviated title	DCCA
Country/Territory	United States
City	Urbana-Champaign
Period	27/09/95 → 29/09/95

Access to Document

Postma1995interactiveAccepted author version, 56.9 KB

Interactive Consistency Algorithms Based on Authentication and Error-correcting Codes
Postma, A. (Keynote speaker)
28 Sept 1995
Activity: Talk or presentation › Oral presentation

Cite this

@inproceedings{c6ef83949e00490f9cb4a65cf57b84de,

title = "Interactive Consistency Algorithms Based on Authentication and Error-correcting Codes",

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. ",

author = "Andr{\'e} Postma and Thijs Krol",

year = "1995",

month = sep,

language = "English",

booktitle = "Proceedings IFIP Working Conferences on Dependable Computing for Critical Applications (DCCA 1995)",

publisher = "IFIP",

note = "IFIP Working Conferences on Dependable Computing for Critical Applications, DCCA-5 1995, DCCA ; Conference date: 27-09-1995 Through 29-09-1995",

}

Postma, A & Krol, T 1995, Interactive Consistency Algorithms Based on Authentication and Error-correcting Codes. in Proceedings IFIP Working Conferences on Dependable Computing for Critical Applications (DCCA 1995): Urbana-Champaign, Illinois, USA, 27-29 September 1995. IFIP, IFIP Working Conferences on Dependable Computing for Critical Applications, DCCA-5 1995, Urbana-Champaign, Illinois, United States, 27/09/95.

Interactive Consistency Algorithms Based on Authentication and Error-correcting Codes. / Postma, André; Krol, Thijs.
Proceedings IFIP Working Conferences on Dependable Computing for Critical Applications (DCCA 1995): Urbana-Champaign, Illinois, USA, 27-29 September 1995. IFIP, 1995.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Professional

TY - GEN

T1 - Interactive Consistency Algorithms Based on Authentication and Error-correcting Codes

AU - Postma, André

AU - Krol, Thijs

N1 - Conference code: 5

PY - 1995/9

Y1 - 1995/9

N2 - 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.

AB - 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.

M3 - Conference contribution

BT - Proceedings IFIP Working Conferences on Dependable Computing for Critical Applications (DCCA 1995)

PB - IFIP

T2 - IFIP Working Conferences on Dependable Computing for Critical Applications, DCCA-5 1995

Y2 - 27 September 1995 through 29 September 1995

ER -

Interactive Consistency Algorithms Based on Authentication and Error-correcting Codes

Abstract

Conference

Access to Document

Fingerprint

Activities

Interactive Consistency Algorithms Based on Authentication and Error-correcting Codes

Cite this