Very Simple and Efficient Byzantine Agreement
DownloadPublished version (225.3Kb)
Terms of use
Metadata
Show full item recordAbstract
We present a very simple, cryptographic, binary Byzantine-Agreement protocol that, with n ≥ 3t + 1 ≥ 3 players, at most t of which are malicious, halts in expected 9 rounds.
Date issued
2017Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence LaboratoryCitation
Micali, Silvio. 2017. "Very Simple and Efficient Byzantine Agreement."
Version: Final published version