The Byzantine Generals Problem
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Synchronous consensus with optimal asynchronous fallback guarantees
- Byzantine agreement with homonyms in synchronous systems
- Interplay between (im)perfectness, synchrony and connectivity: the case of reliable message transmission
- On the performance of a retransmission-based synchronizer
- Power and limits of distributed computing shared memory models
- Wait-free implementations in message-passing systems
- Distributed empirical likelihood inference with or without Byzantine failures
- Blockchain technology: issues of analysis and synthesis
- Stopping times of distributed consensus protocols: a probabilistic analysis
- The Byzantine generals problem in generic and wireless networks
- Mixed self/event-triggered ternary control for resilient consensus against mobile adversarial agents
- Symbolic synthesis of masking fault-tolerant distributed programs
- A fault detection mechanism in Erasure-code Byzantine Fault-tolerance Quorum
- Consensus in the presence of overlapping faults and total omission
- General adversary structures in Byzantine agreement and multi-party computation with active and omission corruption
- Agreement in synchronous networks with ubiquitous faults
- Constant-Space Localized Byzantine Consensus
- Synthesis in presence of dynamic links
- Quantum Byzantine agreement for any number of dishonest parties
- Robust gossiping with an application to consensus
- Invited talk: Resilient distributed algorithms
- Optimal strategies for selecting coordinators
- Group search of the plane with faulty robots
- Byzantine lattice agreement in synchronous message passing systems
- Order-fairness for Byzantine consensus
- Strong Separations Between Broadcast and Authenticated Channels
- P systems and the Byzantine agreement
- Early stopping Byzantine agreement in (1+ ) f rounds
- Intelligent optimal demand response implemented by blockchain and cooperative game in microgrids
- Randomized Kaczmarz in adversarial distributed setting
- HARTS: high-threshold, adaptively secure, and robust threshold Schnorr signatures
- Automation of fault-tolerant graceful degradation
- A game of pawns
- Quantum multi-valued Byzantine agreement based on d-dimensional entangled states
- Distributed fault detection and isolation of continuous-time non-linear systems
- On the power of an honest majority in three-party computation without broadcast
- Dissecting distributed coordination
- On the communication complexity of secure multi-party computation with aborts
- Nearly-optimal consensus tolerating adaptive omissions: why a lot of randomness is needed?
- Probabilistic Byzantine fault tolerance
- All Byzantine agreement problems are expensive
- Brief announcement: A case for Byzantine machine learning
- Keynote: Time is not a healer: before and after
- Quantum Byzantine agreement with tripartite entangled states
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Authenticated Byzantine generals in dual failure model
- Low-cost clock synchronization
- Diffusion without false rumors: On propagating updates in a Byzantine environment.
- Player-centric Byzantine agreement
- Distributed computing in asynchronous networks with byzantine edges
- Universally composable firewall architectures using trusted hardware
- The limits to gossip: second-order shared knowledge of all secrets is unsatisfiable
- Stability of long-lived consensus.
- The complexity of almost-optimal simultaneous coordination
- A simple voting protocol on quantum blockchain
- Efficient agreement over Byzantine gossip
- Automating the addition of fault tolerance with discrete controller synthesis
- Efficient constructions for almost-everywhere secure computation
- The customizable fault/error model for dependable distributed systems.
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era
- Levels of authentication in distributed agreement
- Clustered federated learning based on nonconvex pairwise fusion
- Byzantine generals in the permissionless setting
- Player-replaceability and forensic support are two sides of the same (crypto) coin
- The unique chain rule and its applications
- Byzantine agreement with homonyms
- Probabilistic termination and composability of cryptographic protocols
- The moduli space of three-qutrit states
- On real-time and non real-time distributed computing
- Asynchronous reference frame agreement in a quantum network
- A game of pawns
- Improved extension protocols for Byzantine broadcast and agreement
- Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links
- From distributed coordination to field calculus and aggregate computing
- Search on a line with faulty robots
- Consensus in the presence of mortal Byzantine faulty processes
- Topological characterization of consensus in distributed systems
- The bitcoin backbone protocol: analysis and applications
- On the round complexity of randomized Byzantine agreement
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Byzantine consensus is \(\Theta(n^2)\): the Dolev-Reischuk bound is tight even in partial synchrony!
- Good-case early-stopping latency of synchronous Byzantine reliable broadcast: the deterministic case
- Byzantine-resilient decentralized network learning
- On secure computation of solitary output functionalities with and without broadcast
- On the round complexity of fully secure solitary MPC with honest majority
- On the design of cryptographic primitives
- Combination of clock-state and clock-rate correction in fault-tolerant distributed systems
- Designing proof of human-work puzzles for cryptocurrency and beyond
- Self-stabilizing multivalued consensus in the presence of Byzantine faults and asynchrony
- Encapsulating deontic and branching time specifications
- Message-optimal protocols for Byzantine Agreement
- Modular construction of an efficient 1-bit Byzantine agreement protocol
- The Do-All problem with Byzantine processor failures
- Hundreds of impossibility results for distributed computing
- Oblivious transfer in incomplete networks
- Communication lower bounds for cryptographic broadcast protocols
- Self-stabilizing defeat status computation: dealing with conflict management in multi-agent systems
- Refined quorum systems
- Efficient information-theoretic multi-party computation over non-commutative rings
- A simple Byzantine generals protocol
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)
