License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2017.41
URN: urn:nbn:de:0030-drops-79703
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/7970/
Abraham, Ittai ;
Devadas, Srinivas ;
Nayak, Kartik ;
Ren, Ling
Brief Announcement: Practical Synchronous Byzantine Consensus
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).
BibTeX - Entry
@InProceedings{abraham_et_al:LIPIcs:2017:7970,
author = {Ittai Abraham and Srinivas Devadas and Kartik Nayak and Ling Ren},
title = {{Brief Announcement: Practical Synchronous Byzantine Consensus}},
booktitle = {31st International Symposium on Distributed Computing (DISC 2017)},
pages = {41:1--41:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-053-8},
ISSN = {1868-8969},
year = {2017},
volume = {91},
editor = {Andr{\'e}a W. Richa},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7970},
URN = {urn:nbn:de:0030-drops-79703},
doi = {10.4230/LIPIcs.DISC.2017.41},
annote = {Keywords: consensus, agreement, Byzantine fault tolerance, replication, synchrony}
}
|
Keywords: |
|
consensus, agreement, Byzantine fault tolerance, replication, synchrony |
|
Collection: |
|
31st International Symposium on Distributed Computing (DISC 2017) |
|
Issue Date: |
|
2017 |
|
Date of publication: |
|
12.10.2017 |
