Brief announcement: Practical synchronous byzantine consensus
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 faul...
Main Authors: | Abraham, Ittai, Devadas, Srinivas, Nayak, Kartik, Ren, Ling |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
2019
|
Online Access: | https://hdl.handle.net/1721.1/121557 |
Similar Items
-
Wait-free Regular Storage from Byzantine Components
by: Abraham, Ittai, et al.
Published: (2005) -
Brief announcement: Distributed shared memory based on computation migration
by: Lis, Mieszko, et al.
Published: (2012) -
Synchronous Byzantine Broadcast algorithms for a dishonest majority
by: Chan, Benjamin Yao.
Published: (2019) -
Brief Announcement: Partial Reversal Acyclicity
by: Radeva, Tsvetomira, et al.
Published: (2012) -
Practical Byzantine Fault Tolerance
by: Castro, Miguel
Published: (2023)