Brief Announcement: Practical Synchronous Byzantine Consensus

Authors Ittai Abraham, Srinivas Devadas, Kartik Nayak, Ling Ren

Thumbnail PDF


  • Filesize: 340 kB
  • 4 pages

Document Identifiers

Author Details

Ittai Abraham
Srinivas Devadas
Kartik Nayak
Ling Ren

Cite AsGet BibTex

Ittai Abraham, Srinivas Devadas, Kartik Nayak, and Ling Ren. Brief Announcement: Practical Synchronous Byzantine Consensus. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 41:1-41:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)


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).
  • consensus
  • agreement
  • Byzantine fault tolerance
  • replication
  • synchrony


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Miguel Castro and Barbara Liskov. Practical byzantine fault tolerance. In OSDI, pages 173-186. USENIX Association, 1999. Google Scholar
  2. Jonathan Katz and Chiu-Yuen Koo. On expected constant-round protocols for byzantine agreement. J. Comput. Syst. Sci., 75(2):91-112, 2009. Google Scholar
  3. Leslie Lamport. The part-time parliament. ACM Transactions on Computer Systems, 16(2):133-169, 1998. Google Scholar
  4. Leslie Lamport, Robert Shostak, and Marshall Pease. The byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, 1982. Google Scholar
  5. Shengyun Liu, Christian Cachin, Vivien Quéma, and Marko Vukolic. XFT: practical fault tolerance beyond crashes. In OSDI, pages 485-500. USENIX Association, 2016. Google Scholar