A Correctness Proof for a Practical Byzantine-Fault-Tolerant Replication Algorithm (1999)
Cached
Download Links
by
Miguel Castro
,
Barbara Liskov
| Citations: | 20 - 4 self |
BibTeX
@TECHREPORT{Castro99acorrectness,
author = {Miguel Castro and Barbara Liskov},
title = {A Correctness Proof for a Practical Byzantine-Fault-Tolerant Replication Algorithm},
institution = {},
year = {1999}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper presents a formal specification for the unoptimized version of our algorithm presented in Section 4 of [4] and proves its safety (but not its liveness.) The specification uses the I/O automaton formalism of Tuttle an Lynch [8] and the proof is based on invariant assertions and simulation relations
Citations
| 1309 | Distributed Algorithms - Lynch - 1996 |
| 725 | the Ordering of Events in a Distributed System - Time - 1978 |
| 716 | Implementing fault-tolerant services using the state machine approach: a tutorial - Schneider - 1990 |
| 476 | Practical byzantine fault tolerance - CASTRO, LISKOV - 1999 |
| 288 | The exact security of digital signatures - how to sign with rsa and rabin - Bellare, Rogaway - 1996 |
| 135 | The Rampart Toolkit for building high-integrity services - Reiter - 1995 |
| 132 | Asynchronous consensus and broadcast protocols - Bracha, Toueg - 1985 |
| 117 | The SecureRing protocols for securing group communication - Kihlstrom, Moser, et al. - 1998 |
| 80 | Linearizable concurrent objects - Herlihy, Wing - 1988 |
| 57 | Publication 180-1: Secure Hash Standard - FIPS - 1995 |
| 7 | A Correctness Condition for Memory Shared by Byzantine Processes. Unpublished manuscript - Malkhi, Reiter, et al. - 1998 |
