Recent Results on Fault-Tolerant Consensus in Message-Passing Networks
From MaRDI portal
Publication:2835019
DOI10.1007/978-3-319-48314-6_7zbMath1482.68049arXiv1608.07923OpenAlexW2517375438MaRDI QIDQ2835019
Publication date: 1 December 2016
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.07923
fault toleranceconsensuscrashBitcoinPaxosByzantine consensusBFTByzantine fault-tolerant systemsmessage-passing networksRaft
Network design and communication in computer systems (68M10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- From binary consensus to multivalued consensus in asynchronous message-passing systems
- Bounded cost algorithms for multivalued consensus using binary consensus instances
- Easy impossibility proofs for distributed consensus problems
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- Distributed consensus revisited
- Partial synchrony based on set timeliness
- Fast Paxos
- Reaching approximate Byzantine consensus with multi-hop communication
- Fault-Tolerant Consensus in Directed Graphs
- Minimal Synchrony for Byzantine Consensus
- Recent Results on Fault-Tolerant Consensus in Message-Passing Networks
- Iterative approximate byzantine consensus in arbitrary directed graphs
- On k -set consensus problems in asynchronous systems
- Error-free multi-valued consensus with byzantine failures
- Asynchronous convex hull consensus in the presence of crash faults
- The Bitcoin Backbone Protocol: Analysis and Applications
- Consensus in networked multi-agent systems with adversaries
- Low complexity resilient consensus in networked multi-agent systems with adversaries
- Communication Optimal Multi-valued Asynchronous Byzantine Agreement with Optimal Resilience
- Concurrent Programming: Algorithms, Principles, and Foundations
- Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n 2) Messages, and Constant Time
- Communication Optimal Multi-valued Asynchronous Broadcast Protocol
- Reaching approximate agreement in the presence of faults
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- The Byzantine generals strike again
- Impossibility Results for Distributed Computing
- Byzantine vector consensus in complete graphs
- Optimally efficient multi-valued byzantine agreement
- Multidimensional approximate agreement in Byzantine asynchronous systems
- Principles of Distributed Systems
This page was built for publication: Recent Results on Fault-Tolerant Consensus in Message-Passing Networks
