The Byzantine Generals Problem
From MaRDI portal
Cited in
(only showing first 100 items - show all)- On expected constant-round protocols for Byzantine agreement
- Models of closed multimachine computer systems with transient-fault-tolerance and fault-tolerance on the basis of replication under byzantine faults
- Automating the addition of fault tolerance with discrete controller synthesis
- 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
- Stopping times of distributed consensus protocols: a probabilistic analysis
- Asynchronous byzantine agreement protocols
- Optimal fault-tolerant distributed construction of a spanning forest
- Reliable broadcasts and communication models: tradeoffs and lower bounds
- 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
- Machine checked proofs of the design of a fault-tolerant circuit
- Low-cost clock synchronization
- Consensus under unreliable transmission
- Wait-free implementations in message-passing systems
- Efficient agreement using fault diagnosis.
- Distributed consensus revisited
- Stability of long-lived consensus.
- Local majorities, coalitions and monopolies in graphs: A review
- Oblivious transfer in incomplete networks
- Optimal tradeoff between instantaneous and delayed neighbor information in consensus algorithms
- Randomized k-set agreement in crash-prone and Byzantine asynchronous systems
- Simulation relations for fault-tolerance
- Fairness versus guaranteed output delivery in secure multiparty computation
- Opinion dynamics in social networks with stubborn agents: an issue-based perspective
- Automation of fault-tolerant graceful degradation
- A simple voting protocol on quantum blockchain
- Characterization of secure multiparty computation without broadcast
- Incentives and the structure of communication
- Approximate agreement under mobile Byzantine faults
- A graph based model for survivability applications
- The Do-All problem with Byzantine processor failures
- Toward an algebraic theory of systems
- A flexible formal framework for masking/demasking faults
- Dynamic monopolies of constant size
- The customizable fault/error model for dependable distributed systems.
- Distributed probabilistic polling and applications to proportionate agreement
- Computing in totally anonymous asynchronous shared memory systems
- Diffusion without false rumors: On propagating updates in a Byzantine environment.
- Symbolic synthesis of masking fault-tolerant distributed programs
- A secure voting scheme based on rational self-interest
- Low complexity Byzantine-resilient consensus
- Active disk Paxos with infinitely many processes
- The inherent price of indulgence
- The overhead of consensus failure recovery
- Renaming in synchronous message passing systems with Byzantine failures
- Byzantine-tolerant causal broadcast
- Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures
- Search on a line with faulty robots
- From distributed coordination to field calculus and aggregate computing
- A simple Byzantine generals protocol
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols
- Sublinear-round Byzantine agreement under corrupt majority
- Resilient output regulation in heterogeneous networked systems under Byzantine agents
- Communication-efficient randomized consensus
- Order-fairness for Byzantine consensus
- Synthesis in presence of dynamic links
- Practical quantum Byzantine protocol via nearly optimal entanglement resources
- Quantum Byzantine agreement for any number of dishonest parties
- The epigenetic consensus problem
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era
- Efficient constructions for almost-everywhere secure computation
- On the round complexity of randomized Byzantine agreement
- Efficient information-theoretic multi-party computation over non-commutative rings
- Efficient state management in distributed ledgers
- Multi-armed bandit based distributed resilient consensus and its applications in social networks
- Genuinely distributed Byzantine machine learning
- Round-optimal Byzantine agreement
- Synchronous consensus with optimal asynchronous fallback guarantees
- Byzantine preferential voting
- Optimal strategies for selecting coordinators
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- A lightweight epistemic logic and its application to planning
- Optimistically tuning synchronous Byzantine consensus: another win for null messages
- Reconciling fault-tolerant distributed algorithms and real-time computing
- Fault tolerance in distributed systems using fused state machines
- Lower bounds for weak Byzantine agreement
- Quantum multi-valued Byzantine agreement based on d-dimensional entangled states
- Resilient consensus for multi-agent systems subject to differential privacy requirements
- Determining \(r\)- and \((r,s)\)-robustness of digraphs using mixed integer linear programming
- Probabilistic termination and composability of cryptographic protocols
- Blockchain technology: issues of analysis and synthesis
- Quantum Byzantine agreement with tripartite entangled states
- Group search of the plane with faulty robots
- Common knowledge and consistent simultaneous coordination
- The Theta-Model: achieving synchrony without clocks
- Lower bound for scalable Byzantine agreement
- Agreement in synchronous networks with ubiquitous faults
- Performance study of Byzantine agreement protocol with artificial neural network
- Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time
- Reliable broadcast with respect to topology knowledge
- Of choices, failures and asynchrony: the many faces of set agreement
- Computational aspects of uncertainty profiles and angel-daemon games
- Self-stabilizing defeat status computation: dealing with conflict management in multi-agent systems
- Efficient algorithms for anonymous Byzantine agreement
- Secure multi-party computation made simple
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 Q3942378)
