Optimal and Player-Replaceable Consensus with an Honest Majority
| dc.contributor.advisor | Vinod Vaikuntanathan | |
| dc.contributor.author | Micali, Silvio | en_US |
| dc.contributor.author | Vaikuntanathan, Vinod | en_US |
| dc.contributor.other | Theory of Computation | en |
| dc.date.accessioned | 2017-04-06T23:00:04Z | |
| dc.date.available | 2017-04-06T23:00:04Z | |
| dc.date.issued | 2017-03-31 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/107927 | |
| dc.description.abstract | 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 protocol when executed on real-world networks such as the ones employed in the bitcoin protocol. | en_US |
| dc.format.extent | 8 p. | en_US |
| dc.relation.ispartofseries | MIT-CSAIL-TR-2017-004 | |
| dc.subject | Byzantine Agreement | en_US |
| dc.subject | Cryptography | en_US |
| dc.subject | Honest Majority | en_US |
| dc.title | Optimal and Player-Replaceable Consensus with an Honest Majority | en_US |
| dc.date.updated | 2017-04-06T23:00:04Z |
