How Byzantine is a send corruption?
From MaRDI portal
Publication:2096642
DOI10.1007/978-3-031-09234-3_34OpenAlexW3186077535MaRDI QIDQ2096642
Karim Eldefrawy, Ben Terner, Julian Loss
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-09234-3_34
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)
Cites Work
- The sleepy model of consensus
- Expected constant round Byzantine broadcast under dishonest majority
- Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions
- Synchronous, with a chance of partition tolerance
- Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
- Born and raised distributively
- Authenticated Algorithms for Byzantine Agreement
- Realistic Failures in Secure Multi-party Computation
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Communication Complexity of Byzantine Agreement, Revisited
- On Expected Constant-Round Protocols for Byzantine Agreement
This page was built for publication: How Byzantine is a send corruption?
