Error-free multi-valued consensus with byzantine failures

DOI10.1145/1993806.1993809zbMath1321.68483arXiv1006.2422OpenAlexW2114856692MaRDI QIDQ2943378

Guanfeng Liang, Nitin H. Vaidya

Publication date: 11 September 2015

Published in: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

distributed computingconsensusByzantine agreement

Mathematics Subject Classification ID

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

Related Items (7)

Information-theoretic broadcast with dishonest majority for long messages ⋮ Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n 2) Messages, and Constant Time ⋮ Optimal extension protocols for Byzantine broadcast and agreement ⋮ Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time ⋮ Efficient adaptively-secure Byzantine agreement for long messages ⋮ On the Amortized Communication Complexity of Byzantine Broadcast ⋮ Recent Results on Fault-Tolerant Consensus in Message-Passing Networks

Cites Work

• Unnamed Item
• Gradient clock synchronization in dynamic networks
• Consensus algorithms with one-bit messages
• Knowledge and common knowledge in a Byzantine environment: Crash failures
• Broadcasting in dynamic radio networks
• Programming simultaneous actions using common knowledge
• Continuous consensus via common knowledge
• Distributed computation in dynamic networks
• Flooding time in edge-Markovian dynamic graphs
• Knowledge and common knowledge in a distributed environment
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony
• Fault Tolerance in Networks of Bounded Degree
• Reaching Agreement in the Presence of Faults
• Perfectly secure message transmission
• Parsimonious flooding in dynamic graphs
• Optimal gradient clock synchronization in dynamic networks
• Almost-Everywhere Secure Computation

This page was built for publication: Error-free multi-valued consensus with byzantine failures