The Byzantine Generals Problem
From MaRDI portal
Publication:3942378
DOI10.1145/357172.357176zbMath0483.68021OpenAlexW3137092842WikidataQ55879356 ScholiaQ55879356MaRDI QIDQ3942378
M. C. III Pease, Robert E. Shostak, Leslie Lamport
Publication date: 1982
Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/357172.357176
algorithmsreliabilitydistributed systemsfault tolerancenetwork communicationoperating systemsmalfunctioningnetwork operating systemsinteractive consistencycommunications management
Related Items
Consensus in Data Management: From Distributed Commit to Blockchain, Time is not a healer, Decentralized runtime verification of message sequences in message-based systems, Synchronous \(t\)-resilient consensus in arbitrary graphs, Permissionless consensus in the resource model, Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast, Asynchronous Byzantine reliable broadcast with a message adversary, Byzantine-robust distributed sparse learning for \(M\)-estimation, Communication pattern logic: epistemic and topological views, Correction to: ``Topology-hiding communication from minimal assumptions, Improved deterministic leader election in diameter-two networks, Minimizing setup in broadcast-optimal two round MPC, Complete characterization of broadcast and pseudo-signatures from correlations, On real-time and non real-time distributed computing, Dissecting distributed coordination, High-dimensional \(M\)-estimation for Byzantine-robust decentralized learning, 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, On the number of authenticated rounds in Byzantine Agreement, Optimal algorithms for synchronous Byzantine \(k\)-set agreement, A comprehensive review on blockchains for Internet of Vehicles: challenges and directions, Gossiping for communication-efficient broadcast, An efficient publicly verifiable and proactive secret sharing scheme, Asymptotically free broadcast in constant expected time via packed VSS, Search on a Line by Byzantine Robots, A Sufficient Condition for Gaining Belief in Byzantine Fault-Tolerant Distributed Systems, Quantum detectable Byzantine agreement for distributed data trust management in blockchain, Byzantine-robust variance-reduced federated learning over distributed non-i.i.d. data, Optimal algorithms for synchronous Byzantine \(k\)-set agreement, Byzantine-robust loopless stochastic variance-reduced gradient, Incentive Compatibility on the Blockchain, Blockchain in dynamic networks, \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions, The limits to gossip: second-order shared knowledge of all secrets is unsatisfiable, On transient analysis of \(\Delta_N\)-Markov chains, Bipartite Byzantine‐resilient event‐triggered consensus control of heterogeneous multi‐agent systems, Distributed computing in asynchronous networks with byzantine edges, Completeness theorems for adaptively secure broadcast, \textsc{FnF-BFT}: a BFT protocol with provable performance under attack, Comparing the Update Expressivity of Communication Patterns and Action Models, Distributed CONGEST Algorithms against Mobile Adversaries, On the Validity of Consensus, Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication, Fault-tolerant functional reactive programming (extended version), Fast and simple distributed consensus, Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links, Hundreds of impossibility results for distributed computing, Spatial reference frame agreement in quantum networks, Must the communication graph of MPC protocols be an expander?, RATIONAL MULTI-SECRET SHARING SCHEME IN STANDARD POINT-TO-POINT COMMUNICATION NETWORKS, Deontic Logic, Contrary to Duty Reasoning and Fault Tolerance, Algorithmic mechanism design, On the power of an honest majority in three-party computation without broadcast, Efficient and Decentralized Polling Protocol for General Social Networks, Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph, Near-optimal self-stabilising counting and firing squads, Distributed Corruption Detection in Networks, Byzantine agreement with homonyms, Byzantine Fault Tolerant Distributed Quickest Change Detection, Asynchronous reference frame agreement in a quantum network, Leader Election in Sparse Dynamic Networks with Churn, On the possibility and impossibility of achieving clock synchronization, Diffusion without false rumors: On propagating updates in a Byzantine environment., Easy impossibility proofs for distributed consensus problems, Invited talk: Resilient distributed algorithms, Agreement under faulty interfaces, Oblivious transfer in incomplete networks, Unconditionally secure quantum signatures, Stopping times of distributed consensus protocols: a probabilistic analysis, Asynchronous byzantine agreement protocols, On the design of cryptographic primitives, Combination of clock-state and clock-rate correction in fault-tolerant distributed systems, Optimal fault-tolerant distributed construction of a spanning forest, Robust gossiping with an application to consensus, Reliable broadcasts and communication models: tradeoffs and lower bounds, Visiting Byzantine Agreement underlying ad hoc environment, The perfectly synchronized round-based model of distributed computing, Optimal resilient threshold GQ signatures, Optimal tradeoff between instantaneous and delayed neighbor information in consensus algorithms, Mutual information reconciliation in non-fully connected heterogeneous multicomputer computational systems, Interplay between (im)perfectness, synchrony and connectivity: the case of reliable message transmission, Byzantine agreement with homonyms in synchronous systems, Power and limits of distributed computing shared memory models, On the performance of a retransmission-based synchronizer, Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems, Simulation relations for fault-tolerance, Symbolic synthesis of masking fault-tolerant distributed programs, Tight bound on mobile Byzantine agreement, Stability of long-lived consensus., A secure voting scheme based on rational self-interest, Almost-everywhere secure computation with edge corruptions, Spreading alerts quietly and the subgroup escape problem, On the complexity of asynchronous agreement against powerful adversaries, Multidimensional agreement in Byzantine systems, Fairness versus guaranteed output delivery in secure multiparty computation, Consensus in the presence of mortal Byzantine faulty processes, On Byzantine generals with alternative plans, Deterministic secure positioning in wireless sensor networks, 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, A new solution for the Byzantine agreement problem, Self-stabilizing Byzantine asynchronous unison, Opinion dynamics in social networks with stubborn agents: an issue-based perspective, A lower bound for the time to assure interactive consistency, Robust and scalable middleware for selfish-computer systems, Threshold protocols in survivor set systems, Randomization can be a healer: consensus with dynamic omission failures, Automation of fault-tolerant graceful degradation, Maximum metric spanning tree made Byzantine tolerant, Modular construction of a Byzantine agreement protocol with optimal message bit complexity, Byzantine-tolerant causal broadcast, A simple voting protocol on quantum blockchain, The complexity of almost-optimal simultaneous coordination, A self-adjusting algorithm for Byzantine agreement, Learning and teaching ``what is mathematics, A full proof of the BGW protocol for perfectly secure multiparty computation, Determining majority in networks with local interactions and very small local memory, Characterization of secure multiparty computation without broadcast, Incentives and the structure of communication, Approximate agreement under mobile Byzantine faults, Machine checked proofs of the design of a fault-tolerant circuit, Doing-it-all with bounded work and communication, The incremental agreement, Distributed fault detection and isolation of continuous-time non-linear systems, Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures, Search on a line with faulty robots, A graph based model for survivability applications, From distributed coordination to field calculus and aggregate computing, Game authority for robust and scalable distributed selfish-computer systems, The Do-All problem with Byzantine processor failures, A simple Byzantine generals protocol, Encapsulating deontic and branching time specifications, P systems and the Byzantine agreement, Synchronous consensus under hybrid process and link failures, Secure and self-stabilizing clock synchronization in sensor networks, Refined quorum systems, Toward an algebraic theory of systems, Round-preserving parallel composition of probabilistic-termination cryptographic protocols, On expected constant-round protocols for Byzantine agreement, A necessary condition for Byzantine \(k\)-set agreement, Security and privacy aspects in MapReduce on clouds: a survey, Low-cost clock synchronization, Simultaneity is harder than agreement, Models of closed multimachine computer systems with transient-fault-tolerance and fault-tolerance on the basis of replication under byzantine faults, A flexible formal framework for masking/demasking faults, Consensus under unreliable transmission, Automating the addition of fault tolerance with discrete controller synthesis, Wait-free implementations in message-passing systems, On the round complexity of Byzantine agreement without initial set-up, 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, How to cope with faulty processors in a completely connected network of communicating processors, Efficient agreement using fault diagnosis., Local majorities, coalitions and monopolies in graphs: A review, Distributed consensus revisited, Automated analysis of fault-tolerance in distributed systems, On the round complexity of randomized Byzantine agreement, Reliable synchronization in distributed systems, Common knowledge and consistent simultaneous coordination, Efficient information-theoretic multi-party computation over non-commutative rings, A fault detection mechanism in Erasure-code Byzantine Fault-tolerance Quorum, On the robust synthesis of logical consensus algorithms for distributed intrusion detection, A logic for extensional protocols, Unnamed Item, The Theta-Model: achieving synchrony without clocks, Lower bound for scalable Byzantine agreement, Generalized Paxos made Byzantine (and less complex), Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults, Unnamed Item, Optimal rendezvous on a line by location-aware robots in the presence of spies*, PoW-Based Distributed Cryptography with No Trusted Setup, Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond, Efficient state management in distributed ledgers, Authenticated broadcast with a partially compromised public-key infrastructure, Computing in social networks, Agreement in synchronous networks with ubiquitous faults, Multi-armed bandit based distributed resilient consensus and its applications in social networks, Communication Patterns and Input Patterns in Distributed Computing, Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n 2) Messages, and Constant Time, Performance study of Byzantine agreement protocol with artificial neural network, The Byzantine Generals Problem in Generic and Wireless Networks, Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems, Genuinely distributed Byzantine machine learning, Round-optimal Byzantine agreement, Our Data, Ourselves: Privacy Via Distributed Noise Generation, Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time, On the Versatility of Bracha’s Byzantine Reliable Broadcast Algorithm, piChain: When a Blockchain meets Paxos, Reliable broadcast with respect to topology knowledge, Synchronous consensus with optimal asynchronous fallback guarantees, Secure consensus with distributed detection via two-hop communication, Towards self-stabilizing blockchain, reconstructing totally erased blockchain, Universally Composable Firewall Architectures Using Trusted Hardware, Broadcast (and Round) Efficient Verifiable Secret Sharing, Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds, Message-optimal protocols for Byzantine Agreement, The Failure Discovery problem, Modular construction of an efficient 1-bit Byzantine agreement protocol, Byzantine preferential voting, An algorithm for identification of maliciously faulty units, Unnamed Item, Of choices, failures and asynchrony: the many faces of set agreement, Communication complexity of Byzantine agreement, revisited, Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback, Revising the Membrane Computing Model for Byzantine Agreement, Unnamed Item, Computational aspects of uncertainty profiles and angel-daemon games, Unnamed Item, Optimal strategies for selecting coordinators, How to Solve Consensus in the Smallest Window of Synchrony, Constant-Space Localized Byzantine Consensus, Bosco: One-Step Byzantine Asynchronous Consensus, An Introduction to the Use of zk-SNARKs in Blockchains, Better Upper Bounds for Searching on a Line with Byzantine Robots, Self-stabilizing defeat status computation: dealing with conflict management in multi-agent systems, Resilient Distributed Field Estimation, Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification, Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic, Secure Message Transmission by Public Discussion: A Brief Survey, A lightweight epistemic logic and its application to planning, Optimistically tuning synchronous Byzantine consensus: another win for null messages, Player-Centric Byzantine Agreement, Reconciling fault-tolerant distributed algorithms and real-time computing, The moduli space of three-qutrit states, The Two-Phase Commitment Protocol in an Extended π-Calculus, Efficient algorithms for anonymous Byzantine agreement, Fault tolerance in distributed systems using fused state machines, Secure multi-party computation made simple, 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, Characterization of Secure Multiparty Computation Without Broadcast, Determining \(r\)- and \((r,s)\)-robustness of digraphs using mixed integer linear programming, Sublinear-round Byzantine agreement under corrupt majority, Strong Separations Between Broadcast and Authenticated Channels, Byzantine Agreement Using Partial Authentication, Resilient output regulation in heterogeneous networked systems under Byzantine agents, Probabilistic Termination and Composability of Cryptographic Protocols, Probabilistic termination and composability of cryptographic protocols, Recent Results on Fault-Tolerant Consensus in Message-Passing Networks, Secure Message Transmission in Asynchronous Directed Graphs, Blockchain technology: issues of analysis and synthesis, Authenticated Byzantine Generals in Dual Failure Model, <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>N</mml:mi></mml:math>-Particle<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>N</mml, Communication-efficient randomized consensus, Quantum Byzantine agreement with tripartite entangled states, Group search of the plane with faulty robots, 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, Resilient group consensus in the presence of Byzantine agents, RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERS, The epigenetic consensus problem, Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era, Efficient constructions for almost-everywhere secure computation
