Resilient-optimal interactive consistency in constant time
From MaRDI portal
Recommendations
- Asynchronous byzantine agreement protocols
- On Optimal Probabilistic Asynchronous Byzantine Agreement
- Principles of Distributed Systems
- Byzantine agreement in polynomial expected time (extended abstract)
- Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
Cites work
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Fast asynchronous Byzantine agreement with optimal resilience
- scientific article; zbMATH DE number 503254 (Why is no real title available?)
- Reaching Agreement in the Presence of Faults
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
- Security and composition of multiparty cryptographic protocols
Cited in
(20)- On expected constant-round protocols for Byzantine agreement
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols
- Broadcast-optimal two-round MPC
- Probabilistic termination and composability of cryptographic protocols
- Secure multi-party computation in large networks
- Optimal extension protocols for Byzantine broadcast and agreement
- A full proof of the BGW protocol for perfectly secure multiparty computation
- Asynchronous reference frame agreement in a quantum network
- Multiparty generation of an RSA modulus
- Asymptotically free broadcast in constant expected time via packed VSS
- On the Validity of Consensus
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
- \textsf{Juggernaut}: efficient crypto-agnostic Byzantine agreement
- Asymptotically free broadcast in constant expected time via packed VSS
- Asynchronous agreement on a core set in constant expected time and more efficient asynchronous VSS and MPC
- DRAGON: decentralization at the cost of representation after arbitrary GrOupiNg and its applications to sub-cubic DKG and interactive consistency
- All Byzantine agreement problems are expensive
- Randomized agreement, verifiable secret sharing and multi-party computation in granular synchrony
- Is it even possible? On the parallel composition of asynchronous MPC protocols
- Synchronous distributed key generation without broadcasts
This page was built for publication: Resilient-optimal interactive consistency in constant time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138494)
