Optimized Authenticated Self-synchronizing Byzantine Agreement Protocols


Share/Save/Bookmark

Postma, André and Krol, Thijs and Molenkamp, Egbert (1997) Optimized Authenticated Self-synchronizing Byzantine Agreement Protocols. In: Pacific Rim International Symposium on Fault-Tolerant Systems, December 15-16, 1997, Taipei, Taiwan (pp. pp. 122-129).

open access
[img]
Preview
PDF
795kB
Abstract:In order to make a dependable distributed computer system resilient to arbitrary failures of its processors, deterministic Byzantine agreement protocols (BAPs) can be applied. Many BAPs found in literature require that communication takes place in synchronized rounds of information exchange and require that all correct processors know the start of the BAP and start the protocol simultaneously It is hard to satisfy either or both requirements in a distributed system. As a consequence, it is hard to implement the above BAPs in a distributed system. Authenticated self-synchronizing BAPs evade this problem by guaranteeing Byzantine Agreement while allowing arbitrary clock skew between the clocks of the processors and not requiring correct processors to know the start of the BAP. However, authenticated self-synchronizing BAPs require much communication overhead. Therefore, in this paper, we introduce so-called optimized authenticated self-synchronizing BAPs, that require fewer messages than the existing authenticated self-synchronizing BAPs
Item Type:Conference or Workshop Item
Copyright:©1997 IEEE
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/18992
Official URL:http://dx.doi.org/10.1109/PRFTS.1997.640136
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 119514