Communication lower bounds for cryptographic broadcast protocols
From MaRDI portal
Cites work
- A lower bound for the time to assure interactive consistency
- A New Way to Achieve Round-Efficient Byzantine Agreement
- Adaptively secure broadcast
- Adaptively secure broadcast, revisited
- Algorand: a secure and efficient distributed ledger
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Asynchronous Byzantine agreement with subquadratic communication
- Authenticated Algorithms for Byzantine Agreement
- Bounds on information exchange for Byzantine agreement
- Breaking the \(O(n^2)\) bit barrier, scalable Byzantine agreement with an adaptive adversary
- Breaking the O(√ n)-Bit Barrier
- Communication Complexity of Byzantine Agreement, Revisited
- Communication Locality in Secure Multi-party Computation
- Completeness theorems for adaptively secure broadcast
- Easy impossibility proofs for distributed consensus problems
- Efficient player-optimal protocols for strong and differential consensus
- Expected constant round Byzantine broadcast under dishonest majority
- Fast Byzantine agreement
- From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits
- Fully polynomial Byzantine agreement in t + 1 rounds
- Gossiping for communication-efficient broadcast
- scientific article; zbMATH DE number 1256784 (Why is no real title available?)
- scientific article; zbMATH DE number 1030984 (Why is no real title available?)
- Modular construction of a Byzantine agreement protocol with optimal message bit complexity
- Must the communication graph of MPC protocols be an expander?
- Not a COINcidence: sub-quadratic asynchronous Byzantine agreement WHP
- On Expected Constant-Round Protocols for Byzantine Agreement
- On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
- Optimal communication complexity of authenticated Byzantine agreement
- Practical provably secure flooding for blockchains
- Reaching Agreement in the Presence of Faults
- Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions
- Scalable distributed agreement from LWE: Byzantine agreement, broadcast, and leader election
- Scalable leader election
- Sublinear-round Byzantine agreement under corrupt majority
- The Byzantine Generals Problem
- The Byzantine generals strike again
- Transparent batchable time-lock puzzles and applications to Byzantine consensus
- Unconditional Byzantine agreement for any number of faulty processors (extended abstract)
- Verifiable random functions from standard assumptions
This page was built for publication: Communication lower bounds for cryptographic broadcast protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7004079)
