The Byzantine generals problem
From MaRDI portal
Cited in
(22)- Two distributed problems involving Byzantine processes
- The Do-All problem with Byzantine processor failures
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \)
- The Weak Byzantine Generals Problem
- Secure reliable multicast protocols in a WAN
- Communication-Efficient Distributed Eigenspace Estimation
- scientific article; zbMATH DE number 7077336 (Why is no real title available?)
- Improving the implementation of quantum blockchain based on hypergraphs
- Finite-time consensus for leader-follower and leaderless swarms in the presence of malicious agents
- Multidimensional Byzantine agreement in a synchronous setting
- Divide \& Scale: formalization and roadmap to robust sharding
- On the Validity of Consensus
- Randomized Kaczmarz in adversarial distributed setting
- Executing and proving over dirty ledgers
- MANDERA: malicious node detection in federated learning via ranking
- Asymptotically optimal early termination for dishonest majority broadcast
- Statistical layered MPC
- On the communication complexity of secure multi-party computation with aborts
- Resilient and privacy-preserving consensus for multi-agent systems
- The economic limits of permissionless consensus
- Byzantine-tolerant privacy-preserving atomic register
- Adaptive proof-of-stake governance: a game-theoretic approach to consensus mechanisms
This page was built for publication: The Byzantine generals problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5133676)
