Checking a Non-Byzantine FT Scheme Against Byzantine Faults

Abstract

Process duplication for several application processes in combination with appropriate protocols provides byzantine fault tolerance. In contrast, lightweight protocols are often used among duplicated processes that are primarily not able to tolerate byzantine faults but reach fault tolerance under acceptable costs. Instead of guaranteeing byzantine fault tolerance by protocols, an overlaid system is suggested, to detect byzantine faults during normal processing and to detect byzantine faults possibly occurring within a recovery procedure. It is based on collecting and fusing digital signatures. In certain periods checks can be applied locally. These checks circumstantiate whether the current state has been reached by two duplicates in the same way and whether received messages were generated by two sender duplicates with the same content in the same order. Such a check over collected signatures is used to indicate absence of byzantine faults for certain processing periods.

Original languageEnglish
Title of host publicationProceedings 16th International Parallel and Distributed Processing Symposium
PublisherIEEE
Publication date01.01.2002
Article number1016529
ISBN (Print)978-076951573-1
DOIs
Publication statusPublished - 01.01.2002
Event16th International Parallel and Distributed Processing Symposium - Fort Lauderdale, United States
Duration: 15.04.200219.04.2002
Conference number: 116352

Fingerprint

Dive into the research topics of 'Checking a Non-Byzantine FT Scheme Against Byzantine Faults'. Together they form a unique fingerprint.

Cite this