Asynchronous byzantine agreement protocols
From MaRDI portal
Recommendations
- Asynchronous consensus and broadcast protocols
- On Optimal Probabilistic Asynchronous Byzantine Agreement
- Randomized protocols for asynchronous consensus
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- When 3f + 1 Is Not Enough: Tradeoffs for Decentralized Asynchronous Byzantine Consensus
Cites work
Cited in
(73)- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- Clairvoyant state machine replications
- A reduction theorem for randomized distributed algorithms under weak adversaries
- Expected linear round synchronization: the missing link for linear Byzantine SMR
- Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection
- Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
- Principles of Distributed Systems
- Asynchronous Byzantine reliable broadcast with a message adversary
- Using asynchrony and zero degradation to speed up indulgent consensus protocols
- Consensus on demand
- On Byzantine Agreement over (2,3)-Uniform Hypergraphs
- Asynchronous consensus and broadcast protocols
- Reaching approximate agreement in the presence of faults
- Lower bounds for asynchronous consensus
- Improved extension protocols for Byzantine broadcast and agreement
- Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time
- scientific article; zbMATH DE number 7561445 (Why is no real title available?)
- Resilient-optimal interactive consistency in constant time
- A compiler that increases the fault tolerance of asynchronous protocols
- Byzantine consensus is \(\Theta(n^2)\): the Dolev-Reischuk bound is tight even in partial synchrony!
- Multidimensional agreement in Byzantine systems
- Distributed CONGEST Algorithms against Mobile Adversaries
- Total ordering algorithms for asynchronous Byzantine systems
- On Optimal Probabilistic Asynchronous Byzantine Agreement
- Low complexity Byzantine-resilient consensus
- Lightweight asynchronous verifiable secret sharing with optimal resilience
- Byzantine-tolerant causal broadcast
- Byzantine-resistant total ordering algorithms.
- Consensus in Byzantine asynchronous systems
- Byzantine lattice agreement in synchronous message passing systems
- An O (log n ) expected rounds randomized byzantine generals protocol
- Byzantine-Tolerant Reliable Broadcast in the Presence of Silent Churn
- When 3f + 1 Is Not Enough: Tradeoffs for Decentralized Asynchronous Byzantine Consensus
- Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems
- On the versatility of Bracha's Byzantine reliable broadcast algorithm
- On the nonexistence of resilient consensus protocols
- A hybrid protocol to solve authenticated Byzantine consensus
- Byzantine Agreement Using Partial Authentication
- Revisiting asynchronous fault tolerant computation with optimal resilience
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^{2})\) messages, and constant time
- Analysis of the Blockchain Protocol in Asynchronous Networks
- Byzantine preferential voting
- Synchronous consensus with optimal asynchronous fallback guarantees
- Making Byzantine consensus live
- An almost-surely terminating polynomial protocol for asynchronous Byzantine agreement with optimal resilience
- scientific article; zbMATH DE number 7649941 (Why is no real title available?)
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Expected linear round synchronization: the missing link for linear Byzantine SMR
- Signature-free asynchronous binary Byzantine consensus with \(t<n/3\), \(O(n^2)\) messages, and \(O(1)\) expected time
- Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
- scientific article; zbMATH DE number 4121395 (Why is no real title available?)
- Brief announcement: Multi-threshold asynchronous reliable broadcast and consensus
- From partial to global asynchronous reliable broadcast
- Not a COINcidence: sub-quadratic asynchronous Byzantine agreement WHP
- Knowledge and common knowledge in a Byzantine environment: Crash failures
- Cross-chain payment protocols with success guarantees
- Making Byzantine consensus live
- High-threshold AVSS with optimal communication complexity
- On the (limited) power of non-equivocation
- Randomized protocols for asynchronous consensus
- The contest between simplicity and efficiency in asynchronous Byzantine agreement
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- Asymmetric distributed trust
- Good-case early-stopping latency of synchronous Byzantine reliable broadcast: the deterministic case
- Liveness and latency of Byzantine state-machine replication
- Communication games, sequential equilibrium, and mediators
- Detecting causality in the presence of Byzantine processes: the case of synchronous systems
- Process-commutative distributed objects: from cryptocurrencies to Byzantine-fault-tolerant CRDTs
- Closing the efficiency gap between synchronous and network-agnostic consensus
- Fast batched asynchronous distributed key generation
- Perfect asynchronous MPC with linear communication overhead
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
This page was built for publication: Asynchronous byzantine agreement protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1091131)
