2026-08-07T03:51:27Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:17229 2024-03-06T10:59:17Z ddc:004 open_access

Brief Announcement: Authenticated Consensus in Synchronous Systems with Mixed Faults Abraham, Ittai Dolev, Danny Kagan, Alon Stern, Gilad consensus state machine replication mixed faults synchrony lower bounds 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Ittai Abraham and Danny Dolev and Alon Kagan and Gilad Stern 2022 Is Part Of LIPIcs, Volume 246, 36th International Symposium on Distributed Computing (DISC 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.DISC.2022.38 urn:nbn:de:0030-drops-172292 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.38 eng https://creativecommons.org/licenses/by/4.0/legalcode