Welcome to the resource topic for 2022/805
Title:
Authenticated Consensus in Synchronous Systems with Mixed Faults
Authors: Ittai Abraham, Danny Dolev, Alon Kagan, and Gilad Stern
Abstract:Protocols solving authenticated consensus in synchronous networks with Byzantine faults have been widely researched and known to exists if and only if n>2f for f Byzantine faults. Similarly, protocols solving authenticated consensus in partially synchronous networks are known to exist if n>3f+2k for f Byzantine faults and k crash faults. In this work we fill a natural gap in our knowledge by presenting MixSync, an authenticated consensus protocol in synchronous networks resilient to f Byzantine faults and k crash faults if n>2f+k. As a basic building block, we first define and then construct a publicly verifiable crusader agreement protocol with the same resilience. The protocol uses a simple double-send round to guarantee non-equivocation, a technique later used in the MixSync protocol. We then discuss how to construct a state machine replication protocol using these ideas, and how they can be used in general to make such protocols resilient to crash faults. Finally, we prove lower bounds showing that n>2f+k is optimally resilient for consensus and state machine replication protocols.
ePrint: https://eprint.iacr.org/2022/805
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .