Early stopping for any number of corruptions
From MaRDI portal
Publication:6637339
DOI10.1007/978-3-031-58734-4_16MaRDI QIDQ6637339
Jesper Buus Nielsen, Julian Loss
Publication date: 13 November 2024
Cites Work
- A simple proof of the uniform consensus synchronous lower bound.
- Sublinear-round Byzantine agreement under corrupt majority
- Expected constant round Byzantine broadcast under dishonest majority
- Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions
- Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity
- Authenticated Algorithms for Byzantine Agreement
- Early stopping in Byzantine agreement
- On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
- The Byzantine Generals Problem
- On the security of public key protocols
- Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
- Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
- Communication Complexity of Byzantine Agreement, Revisited
- Sequential composition of protocols without simultaneous termination
- Early-deciding consensus is expensive
- Fully polynomial Byzantine agreement in t + 1 rounds
- On Expected Constant-Round Protocols for Byzantine Agreement
- Transparent batchable time-lock puzzles and applications to Byzantine consensus
- A Recursive Early-Stopping Phase King Protocol
This page was built for publication: Early stopping for any number of corruptions
