Asynchronous consensus and broadcast protocols
From MaRDI portal
Recommendations
- Asynchronous byzantine agreement protocols
- Impossibility of distributed consensus with one faulty process
- On Optimal Probabilistic Asynchronous Byzantine Agreement
- Necessary and sufficient conditions for broadcast consensus protocols.
- A simple and fast asynchronous consensus protocol based on a weak failure detector
Cited in
(69)- On the performance of a retransmission-based synchronizer
- Byzantine-resistant total ordering algorithms.
- Higher-order quantifier elimination, counter simulations and fault-tolerant systems
- Invited talk: Resilient distributed algorithms
- Impossibility of distributed consensus with one faulty process
- On the minimal synchronism needed for distributed consensus
- Towards a Theory of Consistency Primitives
- Expressive Power of Broadcast Consensus Protocols
- Order-fairness for Byzantine consensus
- Open consensus
- On the power of an honest majority in three-party computation without broadcast
- Swiper: a new paradigm for efficient weighted distributed protocols
- MPC with synchronous security and asynchronous responsiveness
- Diffusion without false rumors: On propagating updates in a Byzantine environment.
- Lower bounds for asynchronous consensus
- BBCA-\textsc{Chain}: low latency, high throughput BFT consensus on a DAG
- Consensus in the presence of mortal Byzantine faulty processes
- The consensus number of a cryptocurrency
- AbU: a calculus for distributed event-driven programming with attribute-based interaction
- Hundreds of impossibility results for distributed computing
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
- On the nonexistence of resilient consensus protocols
- From binary consensus to multivalued consensus in asynchronous message-passing systems
- Consensus under unreliable transmission
- Accuracy of message counting abstraction in fault-tolerant distributed algorithms
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
- Asynchronous Fault-Tolerant Total Ordering Algorithms
- Extracting Symbolic Transitions from TLA$$^{+}$$+ Specifications
- Tutorial on parameterized model checking of fault-tolerant distributed algorithms
- Byzantine agreement with optimal resilience via statistical fraud detection
- Byzantine-Tolerant Reliable Broadcast in the Presence of Silent Churn
- Byzantine disk paxos: optimal resilience with Byzantine shared memory
- Necessary and sufficient conditions for broadcast consensus protocols.
- Is it even possible? On the parallel composition of asynchronous MPC protocols
- You only live multiple times: a blackbox solution for reusing crash-stop algorithms in realistic crash-recovery settings
- Dynamic Byzantine reliable broadcast
- Optimal resilience in systems that mix shared memory and message passing
- Synthesizing optimal bias in randomized self-stabilization
- Parameterized complexity of safety of threshold automata
- Consensus in Byzantine asynchronous systems
- Divide \& Scale: formalization and roadmap to robust sharding
- On Optimal Probabilistic Asynchronous Byzantine Agreement
- Low complexity Byzantine-resilient consensus
- scientific article; zbMATH DE number 1848309 (Why is no real title available?)
- Torus orientation
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^{2})\) messages, and constant time
- On the versatility of Bracha's Byzantine reliable broadcast algorithm
- A discrete-event simulation model for the Bitcoin blockchain network with strategic miners and mining pool managers
- Distributed CONGEST Algorithms against Mobile Adversaries
- Asynchronous byzantine agreement protocols
- Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures
- Detecting causality in the presence of Byzantine processes: the case of synchronous systems
- Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
- Asynchronous Byzantine reliable broadcast with a message adversary
- Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
- Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time
- What you always wanted to know about model checking of fault-tolerant distributed algorithms
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
- Asynchronous Networks
- Total ordering algorithms for asynchronous Byzantine systems
- Brief announcement: Multi-threshold asynchronous reliable broadcast and consensus
- From partial to global asynchronous reliable broadcast
- Automata, Languages and Programming
- Symbolic model checking for TLA+ made faster
- Consensus on demand
- Byzantine-tolerant causal broadcast
- Randomized protocols for asynchronous consensus
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
This page was built for publication: Asynchronous consensus and broadcast protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765232)
