Brief announcement: Practical synchronous byzantine consensus
Name
LIPIcs-DISC-2017-41.pdf
Description
Published version
Size
340.48 KB
Format
Adobe PDF
Checksum (MD5)
31bfe218d3560366f82663a695a0717b
Author(s)
Abraham, Ittai
Devadas, Srinivas
Nayak, Kartik
Ren, Ling
Date Issued
2017
Journal
Leibniz International Proceedings in Informatics (LIPIcs)
Publisher
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
Citation
Abraham, Ittai, et al. “Brief Announcement: Practical Synchronous Byzantine Consensus.” Leibniz International Proceedings in Informatics (LIPIcs), 91 (2017): n. pag. © Ittai Abraham, Srinivas Devadas, Kartik Nayak, and Ling Ren
Version
Final published version
Abstract
This paper presents new protocols for Byzantine state machine replication and Byzantine agreement in the synchronous and authenticated setting. The PBFT state machine replication protocol tolerates f Byzantine faults in an asynchronous setting using n = 3f + 1 replicas. We improve the Byzantine fault tolerance to n = 2f +1 by utilizing the synchrony assumption. Our protocol also solves synchronous authenticated Byzantine agreement in fewer expected rounds than the best existing solution (Katz and Koo, 2006).
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution 4.0 International license
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.4230/LIPIcs.DISC.2017.41
