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)

Byzantine-resistant total ordering algorithms.
Higher-order quantifier elimination, counter simulations and fault-tolerant systems
Fast timing-based algorithms
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.
On Optimal Probabilistic Asynchronous Byzantine Agreement
Conflict on a communication channel
Near-optimal self-stabilising counting and firing squads
On the versatility of Bracha's Byzantine reliable broadcast algorithm
Reaching agreement in the presence of contention-related crash failures
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
Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures
Communication-efficient randomized consensus
Asynchronous Byzantine reliable broadcast with a message adversary
Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
Algorand: a secure and efficient distributed ledger
Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions
Efficient fully secure computation via distributed zero-knowledge proofs
What you always wanted to know about model checking of fault-tolerant distributed algorithms
Fairness versus guaranteed output delivery in secure multiparty computation
Total ordering algorithms for asynchronous Byzantine systems
A resilient distributed optimization strategy against false data injection attacks
Machine checked proofs of the design of a fault-tolerant circuit
Contention-related crash failures: definitions, agreement algorithms, and impossibility results
Optimal time Byzantine agreement for \(t<n/8\) with linear-messages
A tight analysis of the parallel undecided-state dynamics with two colors
The epigenetic consensus problem
Analysis of the Blockchain Protocol in Asynchronous Networks
Synchronous consensus with optimal asynchronous fallback guarantees
Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
Byzantine agreement with homonyms in synchronous systems
Agreement in synchronous networks with ubiquitous faults
Robust gossiping with an application to consensus
Byzantine agreement with homonyms
P systems and the Byzantine agreement
Asynchronous Byzantine agreement with optimal resilience
Using knowledge to optimally achieve coordination in distributed systems
Efficient parallel algorithms can be made robust
The complexity of almost-optimal simultaneous coordination
Coordinated consensus in dynamic networks
The space complexity of long-lived and one-shot timestamp implementations
The customizable fault/error model for dependable distributed systems.
No double discount: condition-based simultaneity yields limited gain
Probabilistic termination and composability of cryptographic protocols
Gathering despite mischief
Consensus in the presence of mortal Byzantine faulty processes
Distributed graph coloring in a few rounds
Hundreds of impossibility results for distributed computing
Distributed sampled-data control of nonholonomic multi-robot systems with proximity networks
Consensus when all processes may be Byzantine for some time
Time-efficient randomized multiple-message broadcast in radio networks
Knowledge and common knowledge in a Byzantine environment: Crash failures
A formal model of asynchronous communication and its use in mechanically verifying a biphase mark protocol
Consensus algorithms with one-bit messages
An axiomatic approach to computing the connectivity of synchronous and asynchronous systems
Toward more localized local algorithms, removing assumptions concerning global knowledge
Computing in totally anonymous asynchronous shared memory systems
Agreement under faulty interfaces
Programming simultaneous actions using common knowledge
Locally checkable proofs
Optimal-time adaptive strong renaming, with applications to counting
On the possibility and impossibility of achieving clock synchronization
Easy impossibility proofs for distributed consensus problems
A tight unconditional lower bound on distributed randomwalk computation
Common knowledge and consistent simultaneous coordination
The Heard-Of model: computing in distributed systems with benign faults
Fault-tolerant algorithms for tick-generation in asynchronous logic: robust pulse generation
Verifiable secret sharing in a total of three rounds
Mutual information reconciliation in non-fully connected heterogeneous multicomputer computational systems
Revisiting the PAXOS algorithm
Consensus in Byzantine asynchronous systems
Error-free multi-valued consensus with Byzantine failures
Unconditional Byzantine agreement for any number of faulty processors (extended abstract)
Minimum congestion mapping in a cloud
Models of closed multimachine computer systems with transient-fault-tolerance and fault-tolerance on the basis of replication under byzantine faults

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)