Optimal and Player-Replaceable Consensus with an Honest Majority
Name
MIT-CSAIL-TR-2017-004.pdf
Size
219.6 KB
Format
Adobe PDF
Checksum (MD5)
673caefccea815f219f5cab4b01d408c
Download all files submitted through automated deposit
Author(s)
Micali, Silvio
Vaikuntanathan, Vinod
Advisor(s)
Vinod Vaikuntanathan
Date Issued
March 31, 2017
Series/Report no.
MIT-CSAIL-TR-2017-004
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.
Subjects
Byzantine Agreement
Cryptography
Honest Majority
Persistent DSpace Link
