Synchronous consensus with optimal asynchronous fallback guarantees
From MaRDI portal
Publication:2175907
DOI10.1007/978-3-030-36030-6_6zbMath1455.94129OpenAlexW2990690033MaRDI QIDQ2175907
Julian Loss, Erica Blum, Jonathan N. Katz
Publication date: 30 April 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-36030-6_6
Related Items (7)
State machine replication under changing network conditions ⋮ \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions ⋮ Completeness theorems for adaptively secure broadcast ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience ⋮ Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback ⋮ Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
Cites Work
- Unnamed Item
- On expected constant-round protocols for Byzantine agreement
- Thunderella: blockchains with optimistic instant confirmation
- Synchronous, with a chance of partition tolerance
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- Secure multi-party computation without agreement
- MPC with synchronous security and asynchronous responsiveness
- An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience
- Adaptively secure broadcast, revisited
- Authenticated Algorithms for Byzantine Agreement
- Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time
- Adaptively Secure Broadcast
- Asynchronous Multiparty Computation: Theory and Implementation
- On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- The part-time parliament
- Simple and efficient asynchronous byzantine agreement with optimal resilience
- On the theoretical gap between synchronous and asynchronous MPC protocols
- Fast asynchronous Byzantine agreement with optimal resilience
- On the Power of Hybrid Networks in Multi-Party Computation
This page was built for publication: Synchronous consensus with optimal asynchronous fallback guarantees
