Synchronous consensus with optimal asynchronous fallback guarantees
From MaRDI portal
Publication:2175907
Recommendations
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback
- On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
- Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
- On Optimal Probabilistic Asynchronous Byzantine Agreement
- Asynchronous byzantine agreement protocols
Cites work
- Adaptively secure broadcast
- Adaptively secure broadcast, revisited
- An almost-surely terminating polynomial protocol for asynchronous Byzantine agreement with optimal resilience
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Asynchronous Multiparty Computation: Theory and Implementation
- Authenticated Algorithms for Byzantine Agreement
- Fast asynchronous Byzantine agreement with optimal resilience
- scientific article; zbMATH DE number 2009948 (Why is no real title available?)
- Hybrid consensus: efficient consensus in the permissionless model
- Impossibility of distributed consensus with one faulty process
- MPC with synchronous security and asynchronous responsiveness
- On expected constant-round protocols for Byzantine agreement
- On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
- On the Power of Hybrid Networks in Multi-Party Computation
- On the theoretical gap between synchronous and asynchronous MPC protocols
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- Reaching Agreement in the Presence of Faults
- Secure multi-party computation without agreement
- Signature-free asynchronous binary Byzantine consensus with \(t<n/3\), \(O(n^2)\) messages, and \(O(1)\) expected time
- Simple and efficient asynchronous Byzantine agreement with optimal resilience
- Synchronous, with a chance of partition tolerance
- The Byzantine Generals Problem
- The part-time parliament
- Thunderella: blockchains with optimistic instant confirmation
Cited in
(24)- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- Optimistically tuning synchronous Byzantine consensus: another win for null messages
- On recovery guarantees for angular synchronization
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback
- On implementing omega with weak reliability and synchrony assumptions
- Jolteon and Ditto: network-adaptive efficient consensus with asynchronous fallback
- 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
- Synchronous perfectly secure message transmission with optimal asynchronous fallback guarantees
- Network agnostic MPC with statistical security
- Zombies and ghosts: optimal Byzantine agreement in the presence of omission faults
- Network-agnostic multi-party computation revisited (extended abstract)
- Closing the efficiency gap between synchronous and network-agnostic consensus
- Multi-threshold asynchronous reliable broadcast and consensus
- Heterogeneous paxos
- Peeking into the future: MPC resilient to super-rushing adversaries
- \textsf{Juggernaut}: efficient crypto-agnostic Byzantine agreement
- An unstoppable ideal functionality for signatures and a modular analysis of the Dolev-Strong broadcast
- Fast and efficient perfectly secure network-agnostic secure computation
- Information-theoretic network-agnostic MPC with polynomial communication
- Perfectly secure network-agnostic MPC comes for free
This page was built for publication: Synchronous consensus with optimal asynchronous fallback guarantees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175907)
