Show simple item record

Optimal and Player-Replaceable Consensus with an Honest Majority

dc.date.accessioned2017-04-06T23:00:04Z
dc.date.accessioned2018-11-26T22:27:41Z
dc.date.available2017-04-06T23:00:04Z
dc.date.available2018-11-26T22:27:41Z
dc.date.issued2017-03-31
dc.identifier.urihttp://hdl.handle.net/1721.1/107927
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/107927
dc.description.abstractWe 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.extent8 p.en_US
dc.subjectByzantine Agreementen_US
dc.subjectCryptographyen_US
dc.subjectHonest Majorityen_US
dc.titleOptimal and Player-Replaceable Consensus with an Honest Majorityen_US


Files in this item

FilesSizeFormatView
MIT-CSAIL-TR-2017-004.pdf224.8Kbapplication/pdfView/Open

This item appears in the following Collection(s)

Show simple item record