Abstract
Fault-tolerant distributed systems move the trust in a single party to a majority of parties participating in the protocol. This makes blockchain based crypto-currencies possible: they allow parties to agree on a total order of transactions without a trusted third party. To trust a distributed system, the security of the protocol and the correctness of the implementation must be indisputable.
We present the first machine checked proof that guarantees both safety and liveness for a consensus algorithm. We verify a Proof of Stake (PoS) Nakamoto-style blockchain (NSB) protocol, using the foundational proof assistant Coq. In particular, we consider a PoS NSB in a synchronous network with a static set of corrupted parties. We define execution semantics for this setting and prove chain growth, chain quality, and common prefix which together imply both safety and liveness.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 2021 IEEE 34th Computer Security Foundations Symposium, CSF 2021 |
| Number of pages | 15 |
| Publisher | IEEE |
| Publication date | 2021 |
| ISBN (Electronic) | 978-1-7281-7607-9 |
| DOIs | |
| Publication status | Published - 2021 |
| Event | 34th IEEE Computer Security Foundations Symposium - Virtual, Online, United States Duration: 21 Jun 2021 → 25 Jun 2021 Conference number: 34 https://www.ieee-security.org/TC/CSF2021/ |
Conference
| Conference | 34th IEEE Computer Security Foundations Symposium |
|---|---|
| Number | 34 |
| Location | Virtual |
| Country/Territory | United States |
| City | Online |
| Period | 21/06/2021 → 25/06/2021 |
| Internet address |