College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
|Title: ||Simple and Efficient Byzantine General Algorithms with Early Stopping|
|Authors: ||Toueg, Sam|
Perry, Kenneth J.
Srikanth, T. K.
|Keywords: ||computer science|
|Issue Date: ||Jul-1984|
|Publisher: ||Cornell University|
|Abstract: ||We describe a Byzantine Agreement algorithm, with early stopping, for systems with arbitrary process failures. The algorithm presented is simpler and more efficient than those previously known. It was derived using a broadcast primitive that provides properties of message authentication and thus restricts the disruptive behavior of faulty processes. This primitive is a general tool for deriving fault-tolerant algorithms in the presence of arbitrary failures.|
|Appears in Collections:||Computer Science Technical Reports|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.