Notice
This is not the latest version of this item. The latest version can be found at:https://dspace.mit.edu/handle/1721.1/137614.2
Very Simple and Efficient Byzantine Agreement
| dc.contributor.author | Micali, Silvio | |
| dc.date.accessioned | 2021-11-05T20:24:08Z | |
| dc.date.available | 2021-11-05T20:24:08Z | |
| dc.date.issued | 2017 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/137614 | |
| dc.description.abstract | 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. | en_US |
| dc.language.iso | en | |
| dc.relation.isversionof | 10.4230/LIPIcs.ITCS.2017.6 | en_US |
| dc.rights | Creative Commons Attribution 4.0 International license | en_US |
| dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | en_US |
| dc.source | DROPS | en_US |
| dc.title | Very Simple and Efficient Byzantine Agreement | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Micali, Silvio. 2017. "Very Simple and Efficient Byzantine Agreement." | |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
| dc.eprint.version | Final published version | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
| dc.date.updated | 2019-06-14T18:15:52Z | |
| dspace.date.submission | 2019-06-14T18:15:53Z | |
| mit.metadata.status | Authority Work and Publication Information Needed | en_US |
