An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
From MaRDI portal
Recommendations
Cited in
(75)- On expected constant-round protocols for Byzantine agreement
- Asynchronous byzantine agreement protocols
- Perfect information leader election in \(\log^*n+O(1)\) rounds
- Perennial secure multi-party computation of universal Turing machine
- A tradeoff between safety and liveness for randomized coordinated attack
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols
- Sublinear-round Byzantine agreement under corrupt majority
- How Byzantine is a send corruption?
- Order-fairness for Byzantine consensus
- On the round complexity of randomized Byzantine agreement
- Round-optimal Byzantine agreement
- Synchronous consensus with optimal asynchronous fallback guarantees
- Optimistically tuning synchronous Byzantine consensus: another win for null messages
- Asynchronous Byzantine agreement with optimal resilience
- Probabilistic termination and composability of cryptographic protocols
- Efficient constant-round multi-party computation combining BMR and SPDZ
- Optimal decision strategies in Byzantine environments
- Lower bound for scalable Byzantine agreement
- Improving the round complexity of VSS in point-to-point networks
- Algorand: a secure and efficient distributed ledger
- Secure multi-party computation made simple
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- Optimal extension protocols for Byzantine broadcast and agreement
- A characterization of eventual Byzantine agreement
- Probabilistic Termination and Composability of Cryptographic Protocols
- The Byzantine generals problem in generic and wireless networks
- Secure message transmission by public discussion: a brief survey
- Player-centric Byzantine agreement
- Byzantine agreement with a rational adversary
- Resilient distributed field estimation
- Flipping Persuasively in Constant Time
- THE PROPORTIONAL LOTTERY PROTOCOL IS STRONGLY β-PARTICIPATORY AND VNM-STRATEGY-PROOF
- An O (log n ) expected rounds randomized byzantine generals protocol
- scientific article; zbMATH DE number 176512 (Why is no real title available?)
- scientific article; zbMATH DE number 1973984 (Why is no real title available?)
- scientific article; zbMATH DE number 4121395 (Why is no real title available?)
- Hundreds of impossibility results for distributed computing
- Randomized protocols for asynchronous consensus
- Cryptography and cryptographic protocols
- Resilient-optimal interactive consistency in constant time
- Spatial reference frame agreement in quantum networks
- A full proof of the BGW protocol for perfectly secure multiparty computation
- Detectable Byzantine agreement secure against faulty majorities
- Optimally efficient multi-valued byzantine agreement
- Structural Information and Communication Complexity
- A tradeoff between safety and liveness for randomized coordinated attack protocols
- On Optimal Probabilistic Asynchronous Byzantine Agreement
- On Byzantine Agreement over (2,3)-Uniform Hypergraphs
- Efficient perfectly secure computation with optimal resilience
- Efficient perfectly secure computation with optimal resilience
- scientific article; zbMATH DE number 7774289 (Why is no real title available?)
- Gossiping for communication-efficient broadcast
- Must the communication graph of MPC protocols be an expander?
- Fault-tolerant graph realizations in the congested clique
- Asymptotically free broadcast in constant expected time via packed VSS
- Multidimensional Byzantine agreement in a synchronous setting
- Distributed CONGEST Algorithms against Mobile Adversaries
- Brief Announcement: Improved Consensus in Quantum Networks
- A new solution for the Byzantine agreement problem
- Expected linear round synchronization: the missing link for linear Byzantine SMR
- Brief announcement: Multi-threshold asynchronous reliable broadcast and consensus
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
- Sublinear message bounds of authenticated implicit Byzantine agreement
- Towards permissionless consensus in the standard model via fine-grained complexity
- Multi-threshold asynchronous reliable broadcast and consensus
- Asymptotically optimal adaptive asynchronous common coin and DKG with silent setup
- Asymptotically free broadcast in constant expected time via packed VSS
- Expected constant round Byzantine broadcast under dishonest majority
- Efficient agreement over Byzantine gossip
- The bitcoin backbone protocol: analysis and applications
- Communication lower bounds for cryptographic broadcast protocols
- Byzantine agreement with optimal resilience via statistical fraud detection
- Round-optimal Byzantine agreement without trusted setup
- Synchronous distributed key generation without broadcasts
- Tight bound on mobile Byzantine agreement
This page was built for publication: An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376159)
