Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model

DOI10.1145/3293611.3331619MaRDI QIDQ5145230zbMATH OpenOpenAlexFDO

Authors Muhammad Samir Khan, Syed Shalan Naqvi, Nitin H. Vaidya

Publication date 20 January 2021

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

Full work available at URL https://arxiv.org/abs/1903.11677

zbMATH Keywords

complexity and impossibility results for distributed computingfault-tolerancereliabilityself-organizationself-stabilization

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Recommendations

• On the price of equivocation in Byzantine agreement
• Iterative approximate Byzantine consensus in arbitrary directed graphs
• Constant-Space Localized Byzantine Consensus
• Fault-tolerant consensus in directed graphs
• Fast agreement in networks with Byzantine nodes

Cited in

(6)

• Testing equality under the local broadcast model
• Synchronous \(t\)-resilient consensus in arbitrary graphs
• Distributed CONGEST Algorithms against Mobile Adversaries
• Fast agreement in networks with Byzantine nodes
• Synchronous t-resilient consensus in arbitrary graphs
• Agreement tasks in fault-prone synchronous networks of arbitrary structure

This page was built for publication: Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145230)