Brief announcement: Practical synchronous byzantine consensus

Ittai Abraham, Srinivas Devadas, Kartik Nayak, Ling Ren

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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).

Original languageEnglish (US)
Title of host publication31st International Symposium on Distributed Computing, DISC 2017
EditorsAndrea W. Richa
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770538
DOIs
StatePublished - Oct 1 2017
Externally publishedYes
Event31st International Symposium on Distributed Computing, DISC 2017 - Vienna, Austria
Duration: Oct 16 2017Oct 20 2017

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume91
ISSN (Print)1868-8969

Conference

Conference31st International Symposium on Distributed Computing, DISC 2017
CountryAustria
CityVienna
Period10/16/1710/20/17

    Fingerprint

Keywords

  • Agreement
  • Byzantine fault tolerance
  • Consensus
  • Replication
  • Synchrony

ASJC Scopus subject areas

  • Software

Cite this

Abraham, I., Devadas, S., Nayak, K., & Ren, L. (2017). Brief announcement: Practical synchronous byzantine consensus. In A. W. Richa (Ed.), 31st International Symposium on Distributed Computing, DISC 2017 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 91). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.DISC.2017.41