Reaching Agreement in the Presence of Faults

DOI10.1145/322186.322188zbMATH Open0434.68031DBLPjournals/jacm/PeaseSL80OpenAlexW2126924915WikidataQ55966961 ScholiaQ55966961MaRDI QIDQ3873545FDOQ3873545

Discrete mathematics in relation to computer science (68R99) Theory of software (68N99) Communication, information (94A99) Theory of operating systems (68N25) Theory of computing (68Q99)

Cited In (only showing first 100 items - show all)

Resilience of mutual exclusion algorithms to transient memory faults
Stopping times of distributed consensus protocols: a probabilistic analysis
Invited talk: Resilient distributed algorithms
Adaptively secure broadcast, revisited
Distributed computing in asynchronous networks with byzantine edges
Stability of long-lived consensus.
Fork sequential consistency is blocking
A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
Managed agreement: generalizing two fundamental distributed agreement problems
Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links
Message-optimal protocols for Byzantine Agreement
Modular construction of an efficient 1-bit Byzantine agreement protocol
Continuous consensus with ambiguous failures
Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures
Combination of clock-state and clock-rate correction in fault-tolerant distributed systems
A simple and communication-efficient omega algorithm in the crash-recovery model
Refined quorum systems
A theorem prover for a computational logic
Byzantine gathering in polynomial time
On specifications and proofs of timed circuits
On the message complexity of binary Byzantine agreement under crash failures
Efficient counting with optimal resilience
Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems
On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
Computational aspects of uncertainty profiles and angel-daemon games
Rapid almost-complete broadcasting in faulty networks
The perfectly synchronized round-based model of distributed computing
Optimal resilient threshold GQ signatures
Renaming in synchronous message passing systems with Byzantine failures
Extracting complexes that ensure sufficient structural conditions for system mutual informational agreement in multicomplex systems
On Optimal Probabilistic Asynchronous Byzantine Agreement
Structuring unreliable radio networks
On expected constant-round protocols for Byzantine agreement
Synchronous counting and computational algorithm design
Tight bound on mobile Byzantine agreement
Near-optimal self-stabilising counting and firing squads
The Failure Discovery problem
Almost-everywhere secure computation with edge corruptions
Asynchronous byzantine agreement protocols
A computer scientist looks at game theory.
Modular construction of a Byzantine agreement protocol with optimal message bit complexity
Two distributed problems involving Byzantine processes
Reliable communication over partially authenticated networks
Efficient agreement using fault diagnosis.
On the round complexity of Byzantine agreement without initial set-up
Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries
The computational structure of progress conditions and shared objects
The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols
How to cope with faulty processors in a completely connected network of communicating processors
A simple proof of a simple consensus algorithm
Secure message transmission by public discussion: a brief survey
The contest between simplicity and efficiency in asynchronous Byzantine agreement
Distributed system diagnosis of Byzantine failures in partially connected multicomputer systems
Toward an algebraic theory of systems
Efficient algorithms for anonymous Byzantine agreement
Continuous Consensus with Failures and Recoveries
Reaching a consensus with limited information
The firing squad problem revisited
The firing squad problem revisited
Serializability theory for replicated databases
Faster information dissemination in dynamic networks via network coding
Tight bounds on information dissemination in sparse mobile networks
Byzantine-resistant total ordering algorithms.
Higher-order quantifier elimination, counter simulations and fault-tolerant systems
Quantum Byzantine agreement for any number of dishonest parties
Fast timing-based algorithms
Quantum multi-valued Byzantine agreement based on d-dimensional entangled states
Global synchronization and consensus using beeps in a fault-prone multiple access channel
Quantum Byzantine agreement with tripartite entangled states
Low-cost clock synchronization
Distributed deterministic edge coloring using bounded neighborhood independence
A simple voting protocol on quantum blockchain
Reaching approximate Byzantine consensus with multi-hop communication
A characterization of dynamic networks where consensus is solvable
Information-theoretic broadcast with dishonest majority for long messages
From bounded to unbounded concurrency objects and back
A simple Byzantine generals protocol
Characterization of secure multiparty computation without broadcast
Characterization of secure multiparty computation without broadcast
Consensus under unreliable transmission
Accuracy of message counting abstraction in fault-tolerant distributed algorithms
Reaching approximate Byzantine consensus with multi-hop communication
Recent results on fault-tolerant consensus in message-passing networks
Yet another compiler for active security or: efficient MPC over arbitrary rings
Tutorial on parameterized model checking of fault-tolerant distributed algorithms
A characterization of oblivious message adversaries for which consensus is solvable
Fault tolerance in large games
Fast agreement in networks with Byzantine nodes
Round-preserving parallel composition of probabilistic-termination cryptographic protocols
Fast consensus in networks of bounded degree.
Necessary and sufficient conditions for broadcast consensus protocols.
Conflict on a communication channel
On the versatility of Bracha's Byzantine reliable broadcast algorithm
Reaching agreement in the presence of contention-related crash failures
Correctness of Tendermint-Core Blockchains
Tight bounds for asynchronous renaming
Probabilistic Termination and Composability of Cryptographic Protocols
A modular approach to shared-memory consensus, with applications to the probabilistic-write model
Communication-efficient and crash-quiescent omega with unknown membership
Lower bounds for weak Byzantine agreement

This page was built for publication: Reaching Agreement in the Presence of Faults

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3873545)