Minimal Synchrony for Byzantine Consensus

DOI10.1145/2767386.2767418zbMath1333.68047OpenAlexW2116740098MaRDI QIDQ2796284

Michel Raynal, Achour Mostfaoui, Zohir Bouzid

Publication date: 23 March 2016

Published in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2767386.2767418

zbMATH Keywords

lower bounddistributed algorithmconsensusreliable broadcastadopt-commitByzantine processsignature-free algorithmasynchronous message-passingeventual timely channelfeasibility conditionoptimal resiliencesynchrony assumption

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (3)

Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems ⋮ About informatics, distributed computing, and our job: a personal view ⋮ Recent Results on Fault-Tolerant Consensus in Message-Passing Networks

Cites Work

• Memorization and Association on a Realistic Neural Model
• Unnamed Item

This page was built for publication: Minimal Synchrony for Byzantine Consensus