Byzantizing Paxos by Refinement

We derive a 3f +1 process Byzantine Paxos consensus algorithm by Byzantizing a variant of the ordinary Paxos algorithm--that is, by having 2f+1 nonfaulty processes emulate the ordinary Paxos algorithm despite the presence of f malicious processes. We have written a formal, machine-checked proof that the Byzantized algorithm implements the ordinary Paxos consensus algorithm under a suitable refinement mapping.

[1]  Leslie Lamport,et al.  Vertical paxos and primary-backup replication , 2009, PODC '09.

[2]  Martín Abadi,et al.  The existence of refinement mappings , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[3]  Leslie Lamport,et al.  Cheap Paxos , 2004, International Conference on Dependable Systems and Networks, 2004.

[4]  Leslie Lamport,et al.  The PlusCal Algorithm Language , 2009, ICTAC.

[5]  Leslie Lamport,et al.  The part-time parliament , 1998, TOCS.

[6]  Miguel Castro,et al.  Practical byzantine fault tolerance and proactive recovery , 2002, TOCS.

[7]  Jean-Philippe Martin,et al.  Fast Byzantine Consensus , 2006, IEEE Transactions on Dependable and Secure Computing.

[8]  B. M. Oki,et al.  VIEWSTAMPED REPLICATION FOR HIGHLY AVAILABLE DISTRIBUTED SYSTEMS , 1988 .

[9]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[10]  Leslie Lamport,et al.  Fast Paxos , 2006, Distributed Computing.

[11]  Butler W. Lampson,et al.  The ABCD's of Paxos , 2001, PODC '01.

[12]  Carroll Morgan,et al.  Theoretical Aspects of Computing - ICTAC 2009 , 2009, Lecture Notes in Computer Science.

[13]  Marko Vukolic,et al.  Refined quorum systems , 2007, PODC '07.

[14]  Lorenzo Alvisi,et al.  Fast Byzantine Paxos , 2004 .