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 |
| _version_ | 1811074811394260992 |
|---|---|
| author | Micali, Silvio Vaikuntanathan, Vinod |
| author2 | Vinod Vaikuntanathan |
| author_facet | Vinod Vaikuntanathan Micali, Silvio Vaikuntanathan, Vinod |
| author_sort | Micali, Silvio |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T09:55:53Z |
| id | mit-1721.1/107927 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T09:55:53Z |
| publishDate | 2017 |
| record_format | dspace |
| spelling | mit-1721.1/1079272019-04-12T17:07:01Z Optimal and Player-Replaceable Consensus with an Honest Majority Micali, Silvio Vaikuntanathan, Vinod Vinod Vaikuntanathan Theory of Computation Byzantine Agreement Cryptography 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 protocol when executed on real-world networks such as the ones employed in the bitcoin protocol. 2017-04-06T23:00:04Z 2017-04-06T23:00:04Z 2017-03-31 2017-04-06T23:00:04Z http://hdl.handle.net/1721.1/107927 MIT-CSAIL-TR-2017-004 8 p. application/pdf |
| spellingShingle | Byzantine Agreement Cryptography Honest Majority Micali, Silvio Vaikuntanathan, Vinod Optimal and Player-Replaceable Consensus with an Honest Majority |
| title | Optimal and Player-Replaceable Consensus with an Honest Majority |
| title_full | Optimal and Player-Replaceable Consensus with an Honest Majority |
| title_fullStr | Optimal and Player-Replaceable Consensus with an Honest Majority |
| title_full_unstemmed | Optimal and Player-Replaceable Consensus with an Honest Majority |
| title_short | Optimal and Player-Replaceable Consensus with an Honest Majority |
| title_sort | optimal and player replaceable consensus with an honest majority |
| topic | Byzantine Agreement Cryptography Honest Majority |
| url | http://hdl.handle.net/1721.1/107927 |
| work_keys_str_mv | AT micalisilvio optimalandplayerreplaceableconsensuswithanhonestmajority AT vaikuntanathanvinod optimalandplayerreplaceableconsensuswithanhonestmajority |