Optimal and Player-Replaceable Consensus with an Honest Majority
We construct a Byzantine Agreement protocol that tolerates t < n/2 corruptions, is very efficient in terms of the number of rounds and the number of bits of communication, and satisfies a strong notion of robustness called player replaceability (defined in [Mic16]). We provide an analysis of our...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Published: |
2017
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/107927 |