Simple and Efficient Byzantine General Algorithms with Early Stopping
| dc.contributor.author | Toueg, Sam | en_US |
| dc.contributor.author | Perry, Kenneth J. | en_US |
| dc.contributor.author | Srikanth, T. K. | en_US |
| dc.date.accessioned | 2007-04-23T16:52:13Z | |
| dc.date.available | 2007-04-23T16:52:13Z | |
| dc.date.issued | 1984-07 | en_US |
| dc.description.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. | en_US |
| dc.format.extent | 2196672 bytes | |
| dc.format.extent | 410928 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR84-621 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6460 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Simple and Efficient Byzantine General Algorithms with Early Stopping | en_US |
| dc.type | technical report | en_US |