Round efficient Byzantine agreement from VDFs
From MaRDI portal
Recommendations
- On expected constant-round protocols for Byzantine agreement
- On the round complexity of randomized Byzantine agreement
- On Expected Constant-Round Protocols for Byzantine Agreement
- On the round complexity of randomized Byzantine agreement
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
Cites work
- scientific article; zbMATH DE number 708802 (Why is no real title available?)
- scientific article; zbMATH DE number 1931811 (Why is no real title available?)
- Analysis of the Blockchain Protocol in Asynchronous Networks
- Authenticated Algorithms for Byzantine Agreement
- Bootstrapping Public Blockchains Without a Trusted Setup
- Bootstrapping the blockchain, with applications to consensus and fast PKI setup
- Communication Complexity of Byzantine Agreement, Revisited
- Efficient adaptively secure zero-knowledge from garbled circuits
- Efficient verifiable delay functions
- On Expected Constant-Round Protocols for Byzantine Agreement
- On the security of time-lock puzzles and timed commitments
- PoW-based distributed cryptography with no trusted setup
- Proof-of-work-based consensus in expected-constant time
- Proofs of Catalytic Space
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era
- Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions
- Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
- The Bitcoin Backbone Protocol: Analysis and Applications
- Verifiable delay functions
- Verifiable delay functions from supersingular isogenies and pairings
This page was built for publication: Round efficient Byzantine agreement from VDFs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660385)
