The Byzantine generals strike again
From MaRDI portal
Cited in
(82)- On the round complexity of Byzantine agreement without initial set-up
- How to cope with faulty processors in a completely connected network of communicating processors
- On the possibility and impossibility of achieving clock synchronization
- Easy impossibility proofs for distributed consensus problems
- Serializability theory for replicated databases
- A lower bound for the time to assure interactive consistency
- Modular construction of a Byzantine agreement protocol with optimal message bit complexity
- A self-adjusting algorithm for Byzantine agreement
- Reliable communication over partially authenticated networks
- Efficient agreement using fault diagnosis.
- Fast consensus in networks of bounded degree.
- Agreement in the presence of faults, on networks of bounded degree
- Oblivious transfer in incomplete networks
- Incentives and the structure of communication
- On private computation in incomplete networks
- Instant block confirmation in the sleepy model
- Is information-theoretic topology-hiding computation possible?
- Lower bounds for weak Byzantine agreement
- Resilient consensus for multi-agent systems subject to differential privacy requirements
- The Heard-Of model: computing in distributed systems with benign faults
- Communications in unknown networks: preserving the secret of topology
- Agreement in synchronous networks with ubiquitous faults
- Performance study of Byzantine agreement protocol with artificial neural network
- Reliable broadcast with respect to topology knowledge
- Algorand: a secure and efficient distributed ledger
- Probabilistic reliability and privacy of communication using multicast in general neighbor networks
- Computational aspects of uncertainty profiles and angel-daemon games
- Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip
- Recent results on fault-tolerant consensus in message-passing networks
- The Byzantine generals problem in generic and wireless networks
- Agreement under faulty interfaces
- Broadcast (and round) efficient verifiable secret sharing
- Byzantine Agreement Using Partial Authentication
- Authenticated Byzantine generals in dual failure model
- Constant-Space Localized Byzantine Consensus
- The Failure Discovery problem
- Modular construction of an efficient 1-bit Byzantine agreement protocol
- Consensus in the presence of mortal Byzantine faulty processes
- Multi-verifier signatures
- An algorithm for identification of maliciously faulty units
- On the impact of link faults on Byzantine agreement
- Cryptanalysis of secure message transmission protocols with feedback
- Effects of topology knowledge and relay depth on asynchronous appoximate consensus
- Time is not a healer (preliminary version)
- Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links
- Hundreds of impossibility results for distributed computing
- Efficient counting with optimal resilience
- Fault-tolerant algorithms for tick-generation in asynchronous logic: robust pulse generation
- Gathering despite mischief
- Efficient reliable communication over partially authenticated networks
- Near-optimal self-stabilising counting and firing squads
- Synchronous \(t\)-resilient consensus in arbitrary graphs
- Asynchronous Byzantine reliable broadcast with a message adversary
- Correction to: ``Topology-hiding communication from minimal assumptions
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
- Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey
- Must the communication graph of MPC protocols be an expander?
- Mutual information reconciliation in non-fully connected heterogeneous multicomputer computational systems
- Submodularity-based false data injection attack scheme in multi-agent dynamical systems
- Distributed CONGEST Algorithms against Mobile Adversaries
- Secure message transmission in asynchronous networks
- Fast agreement in networks with Byzantine nodes
- Synchronous t-resilient consensus in arbitrary graphs
- Levels of authentication in distributed agreement
- Proof-of-work-based consensus in expected-constant time
- Asynchronous approximate Byzantine consensus: a multi-hop relay method and tight graph conditions
- Self-stabilizing Byzantine-resilient communication in dynamic networks
- State machine replication among strangers, fast and self-sufficient
- \(f\)-sensitivity distance oracles and routing schemes
- Efficient secure communication over dynamic incomplete networks with minimal connectivity
- Faithful simulation of randomized BFT protocols on block DAGs
- On the communication complexity of secure multi-party computation with aborts
- Communication lower bounds for cryptographic broadcast protocols
- Synchronous consensus under hybrid process and link failures
- Agreement tasks in fault-prone synchronous networks of arbitrary structure
- Maintaining sublinear locality over time: adaptively secure MPC on a reusable hidden graph
- Invited talk: Resilient distributed algorithms
- Broadcasting with locally bounded byzantine faults
- Feasibility and complexity of broadcasting with random transmission failures
- Synchronous counting and computational algorithm design
- Tight bound on mobile Byzantine agreement
- Almost-everywhere secure computation with edge corruptions
This page was built for publication: The Byzantine generals strike again
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3959472)
