Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Subject "Byzantine Agreement"
Now showing items 1-1 of 1
-
Optimal and Player-Replaceable Consensus with an Honest Majority
(2017-03-31)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 ...