Improvement and partial simulation of King & Saia’s expected-polynomial-time Byzantine agreement algorithm
We present a partial implementation of King and Saia 2016’s expected polyno- mial time byzantine agreement algorithm, which which greatly speeds up Bracha’s Byzantine agreement algorithm by introducing a shared coin flip subroutine and a method for detecting adversarially controlled nodes. In additi...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English en |
| Published: |
2020
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1828/11836 |