Velisarios: Byzantine Fault-Tolerant Protocols Powered by Coq

@inproceedings{Rahli2018VelisariosBF,
  title={Velisarios: Byzantine Fault-Tolerant Protocols Powered by Coq},
  author={Vincent Rahli and Ivana Vukotic and Marcus V{\"o}lp and Paulo Esteves Ver{\'i}ssimo},
  booktitle={ESOP},
  year={2018}
}
Our increasing dependence on complex and critical information infrastructures and the emerging threat of sophisticated attacks, ask for extended efforts to ensure the correctness and security of these systems. Byzantine fault-tolerant state-machine replication (BFT-SMR) provides a way to harden such systems. It ensures that they maintain correctness and availability in an application-agnostic way, provided that the replication protocol is correct and at least \(n-f\) out of n replicas survive… 
View via Publisher
pure-oai.bham.ac.uk
30 Citations
Highly Influential Citations
5
Background Citations
11
Methods Citations
10
Results Citations
1

30 Citations

A Formally Verified Protocol for Log Replication with Byzantine Fault Tolerance
TLDR
This work proposes a formally verified consensus protocol designed for a specific use case: secure logging that allows each node to propose entries in a parallel subroutine, and guarantees that correct nodes agree on the set of all proposed entries, without leader election.
Asphalion: trustworthy shielding against Byzantine faults
TLDR
Asphalion is introduced, the first theorem prover-based framework for verifying implementations of hybrid systems and protocols, and supports compositional reasoning, e.g., through mechanisms to lift properties about trusted-trustworthy components, to the level of the distributed systems they are integrated in.
An Ecosystem for Verifying Implementations of BFT protocols
TLDR
The Byzantine fault-tolerance state machine replication (BFT-SMR) is a technique that enables correct functioning of a system even when some parts of the system are not working correctly.
Lazarus: Automatic Management of Diversity in BFT Systems
TLDR
The evaluation shows that the devised strategy reduces the number of executions where the system becomes compromised and that the prototype supports the execution of full-fledged BFT systems in diverse configurations with 17 OS versions, reaching a performance close to a homogeneous bare-metal setup.
Towards Formal Verification of HotStuff-based Byzantine Fault Tolerant Consensus in Agda: Extended Version
TLDR
This work presents an abstract model of the protocol underlying HotStuff / LibraBFT, and formal, machine-checked proofs of their core correctness (safety) property and an extended condition that enables non-participating parties to verify committed results.
HAMRAZ: Resilient Partitioning and Replication
TLDR
A security-typed object-based language, a partitioning transformation, an operational semantics, and an information flow type inference system for partitioned and replicated classes that guarantees end-to-end policies simultaneously for all the three aspects of trustworthiness.
On the Formal Verification of the Stellar Consensus Protocol
TLDR
This paper believes this is the first mechanized proof of both safety and liveness, specified in LTL, for a deployed BFT protocol.
Formal Security Analysis on dBFT Protocol of NEO
TLDR
A security analysis on the backbone consensus protocol, called delegated Byzantine Fault Tolerance (dBFT), and recommendations on how to defend the system against the identified attacks are provided.
Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics
TLDR
This work develops a new methodology for decomposing the verification task of such protocols into two decidable logics: EPR and BAPA, and develops an algorithm for automatically generating the properties needed for verifying a given protocol, facilitating fully automated deductive verification.
Formalizing Nakamoto-Style Proof of Stake
TLDR
This work verifies a Proof of Stake (PoS) Nakamoto-style blockchain (NSB) protocol, using the foundational proof assistant Coq, and presents the first machine checked proof that guarantees both safety and liveness for a consensus algorithm.
...
...

References

SHOWING 1-10 OF 87 REFERENCES
CheapBFT: resource-efficient byzantine fault tolerance
TLDR
CheapBFT is presented, a BFT system that tolerates that all but one of the replicas active in normal-case operation become faulty, and which allows the system to safely switch to another, more resilient agreement protocol.
Efficient Byzantine Fault-Tolerance
TLDR
Two asynchronous Byzantine fault-tolerant state machine replication (BFT) algorithms, which improve previous algorithms in terms of several metrics, and can have better throughput than Castro and Liskov's PBFT, and better latency in networks with nonnegligible communication delays.
Practical byzantine fault tolerance and proactive recovery
TLDR
A new replication algorithm, BFT, is described that can be used to build highly available systems that tolerate Byzantine faults and is used to implement the first Byzantine-fault-tolerant NFS file system, BFS.
State Machine Replication for the Masses with BFT-SMART
TLDR
BFT-SMART is an open-source Java-based library implementing robust BFT state machine replication with improved reliability, modularity as a first-class property, multicore-awareness, reconfiguration support and a flexible programming interface.
Byzantine quorum systems
TLDR
This paper considers the arbitrary (Byzantine) failure of data repositories and presents the first study of quorum system requirements and constructions that ensure data availability and consistency despite these failures, and demonstrates quorum systems over n servers with a load of O(\frac{1}{\sqrt{n}})$, thus meeting the lower bound on load for benignly fault-tolerant quorum Systems.
Practical Byzantine fault tolerance
TLDR
A new replication algorithm that is able to tolerate Byzantine faults that works in asynchronous environments like the Internet and incorporates several important optimizations that improve the response time of previous algorithms by more than an order of magnitude.
EventML: Specification, verification, and implementation of crash-tolerant state machine replication systems
A Correctness Proof for a Practical Byzantine-Fault-Tolerant Replication Algorithm
TLDR
This work has developed a practical algorithm for state-machine replication that tolerates Byzantine faults and incorporates important optimizations that enable it to outperform previous systems by more than an order of magnitude.
IronFleet: proving practical distributed systems correct
TLDR
A methodology for building practical and provably correct distributed systems based on a unique blend of TLA-style state-machine refinement and Hoare-logic verification is described, which proves that each obeys a concise safety specification, as well as desirable liveness requirements.
Analysis of Self-⋆ and P2P Systems Using Refinement
TLDR
A mechanized proof of correctness of the self-i?ź systems along with a case study related to the P2P-based self-healing protocol and a methodology for verifying distributed systems and ensuring safety and convergence requirements.
...
...