Optimal extension protocols for Byzantine broadcast and agreement
From MaRDI portal
Publication:2657277
DOI10.1007/s00446-020-00384-1OpenAlexW3043915571MaRDI QIDQ2657277
Publication date: 12 March 2021
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-020-00384-1
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modular construction of a Byzantine agreement protocol with optimal message bit complexity
- Information-theoretic broadcast with dishonest majority for long messages
- Probabilistic Termination and Composability of Cryptographic Protocols
- Multi-valued Byzantine Broadcast: The t < n Case
- Error-free multi-valued consensus with byzantine failures
- Broadcast (and Round) Efficient Verifiable Secret Sharing
- Communication Optimal Multi-valued Asynchronous Byzantine Agreement with Optimal Resilience
- Authenticated Algorithms for Byzantine Agreement
- Polynomial Codes Over Certain Finite Fields
- On the composition of authenticated Byzantine Agreement
- Improving the Round Complexity of VSS in Point-to-Point Networks
- Scalable leader election
- Communication Optimal Multi-valued Asynchronous Broadcast Protocol
- From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits
- Bounds on information exchange for Byzantine agreement
- Reaching Agreement in the Presence of Faults
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols
- Resilient-optimal interactive consistency in constant time
- Sequential composition of protocols without simultaneous termination
- Fast byzantine agreement
- Optimally efficient multi-valued byzantine agreement
- Asynchronous secure computation
- Broadcast Extensions with Optimal Communication and Round Complexity
- Breaking the O ( n 2 ) bit barrier
- Advances in Cryptology - CRYPTO 2003
- Round-Efficient Secure Computation in Point-to-Point Networks
- On Expected Constant-Round Protocols for Byzantine Agreement
- Theory of Cryptography
This page was built for publication: Optimal extension protocols for Byzantine broadcast and agreement
