2026-09-20T00:40:25Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1216652026-06-06T00:54:50Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Srini Devadas.
Chan, Benjamin Yao.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2019-07-15T20:32:17Z
2019-07-15T20:32:17Z
2019
2019
https://hdl.handle.net/1721.1/121665
1102055620
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).
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.
by Benjamin Yao Chan.
M.Eng.
M.Eng. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
37 pages ;
eng
Massachusetts Institute of Technology
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.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Synchronous Byzantine Broadcast algorithms for a dishonest majority
Thesis
application/pdf
2019-07-15T20:32:14Z
Publication
Master
EECS
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="79fb0aca-dc13-4866-befc-cf4a87e57b2e">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Synchronous Byzantine Broadcast algorithms for a dishonest majority</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2019</PublicationDate>
<Authors>
<Author>
<DisplayName>Chan, Benjamin Yao.</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>