Synchronous Byzantine Broadcast algorithms for a dishonest majority
Name
1102055620-MIT.pdf
Size
259.07 KB
Format
Adobe PDF
Checksum (MD5)
d070b1b4d87864e4291694a658db0fa3
Author(s)
Chan, Benjamin Yao.
Advisor(s)
Srini Devadas.
Date Issued
2019
Publisher
Massachusetts Institute of Technology
Abstract
Deterministic Byzantine Broadcast requires f+1 rounds for any f malicious processes, in the synchronous, authenticated setting. In the non-deterministic case, Katz and Koo [2] showed a lower-bound of [omega](2n=(n-f)) rounds, but it remains an open question whether the bound is tight, specically when f >/= n/2 (a dishonest majority). This thesis explores ways to improve the eciency of Byzantine Broadcast algorithms for a dishonest majority. In particular, we present an expected 10 round protocol for f = n/2, which works by constructing a hierarchy of quorums, to gather as many signatures as possible, before commitment. Finally, we offer brief commentary on how similar techniques could extend to f > n/2.
Description
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (page 37).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.
Persistent DSpace Link
