The Byzantine generals strike again
From MaRDI portal
Publication:3959472
DOI10.1016/0196-6774(82)90004-9zbMath0495.68093OpenAlexW2014772227WikidataQ60304998 ScholiaQ60304998MaRDI QIDQ3959472
Publication date: 1982
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(82)90004-9
Reliability, availability, maintenance, inspection in operations research (90B25) Applications of graph theory to circuits and networks (94C15) Theory of software (68N99)
Related Items
On the possibility and impossibility of achieving clock synchronization, Easy impossibility proofs for distributed consensus problems, Serializability theory for replicated databases, Invited talk: Resilient distributed algorithms, Agreement under faulty interfaces, Broadcasting with locally bounded byzantine faults, Oblivious transfer in incomplete networks, The Heard-Of model: computing in distributed systems with benign faults, Agreement in the presence of faults, on networks of bounded degree, Instant block confirmation in the sleepy model, Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip, 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, The Byzantine Generals Problem in Generic and Wireless Networks, Feasibility and complexity of broadcasting with random transmission failures, Reliable broadcast with respect to topology knowledge, Is information-theoretic topology-hiding computation possible?, Mutual information reconciliation in non-fully connected heterogeneous multicomputer computational systems, Time is not a healer, Broadcast (and Round) Efficient Verifiable Secret Sharing, Synchronous \(t\)-resilient consensus in arbitrary graphs, Asynchronous Byzantine reliable broadcast with a message adversary, Correction to: ``Topology-hiding communication from minimal assumptions, The Failure Discovery problem, Modular construction of an efficient 1-bit Byzantine agreement protocol, 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, Algorand: a secure and efficient distributed ledger, Distributed computations in fully-defective networks, Synchronous counting and computational algorithm design, An algorithm for identification of maliciously faulty units, Tight bound on mobile Byzantine agreement, Probabilistic reliability and privacy of communication using multicast in general neighbor networks, Efficient Counting with Optimal Resilience, Almost-everywhere secure computation with edge corruptions, Consensus in the presence of mortal Byzantine faulty processes, Submodularity-based false data injection attack scheme in multi-agent dynamical systems, Distributed CONGEST Algorithms against Mobile Adversaries, Multi-verifier signatures, Secure message transmission in asynchronous networks, On private computation in incomplete networks, Computational aspects of uncertainty profiles and angel-daemon games, A lower bound for the time to assure interactive consistency, Constant-Space Localized Byzantine Consensus, Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links, Hundreds of impossibility results for distributed computing, On the impact of link faults on Byzantine agreement, Must the communication graph of MPC protocols be an expander?, Modular construction of a Byzantine agreement protocol with optimal message bit complexity, A self-adjusting algorithm for Byzantine agreement, Incentives and the structure of communication, \(f\)-sensitivity distance oracles and routing schemes, Cryptanalysis of Secure Message Transmission Protocols with Feedback, Synchronous consensus under hybrid process and link failures, Unnamed Item, Lower bounds for weak Byzantine agreement, Resilient consensus for multi-agent systems subject to differential privacy requirements, Efficient reliable communication over partially authenticated networks, Near-optimal self-stabilising counting and firing squads, Byzantine Agreement Using Partial Authentication, Recent Results on Fault-Tolerant Consensus in Message-Passing Networks, Authenticated Byzantine Generals in Dual Failure Model, Reliable communication over partially authenticated networks, On the round complexity of Byzantine agreement without initial set-up, Fault-tolerant algorithms for tick-generation in asynchronous logic, Unnamed Item, How to cope with faulty processors in a completely connected network of communicating processors, Efficient agreement using fault diagnosis., Fast consensus in networks of bounded degree.
