Reaching Agreement in the Presence of Faults
From MaRDI portal
(Redirected from Publication:3873545)
Cited in
(only showing first 100 items - show all)- Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
- Synchronous consensus with optimal asynchronous fallback guarantees
- Communication-efficient failure detection and consensus in omission environments
- Byzantine agreement with homonyms in synchronous systems
- Wait-free implementations in message-passing systems
- Faster information dissemination in dynamic networks via network coding
- Tight bounds on information dissemination in sparse mobile networks
- Analysis of the Blockchain Protocol in Asynchronous Networks
- Defending non-Bayesian learning against adversarial attacks
- Efficient constant-round multi-party computation combining BMR and SPDZ
- Byzantine-resistant total ordering algorithms.
- Stopping times of distributed consensus protocols: a probabilistic analysis
- Higher-order quantifier elimination, counter simulations and fault-tolerant systems
- Resilience of mutual exclusion algorithms to transient memory faults
- General adversary structures in Byzantine agreement and multi-party computation with active and omission corruption
- Agreement in synchronous networks with ubiquitous faults
- Quantum Byzantine agreement for any number of dishonest parties
- Robust gossiping with an application to consensus
- Invited talk: Resilient distributed algorithms
- P systems and the Byzantine agreement
- Verifiable secret sharing from symmetric key cryptography with improved optimistic complexity
- Adaptively secure broadcast, revisited
- Fast timing-based algorithms
- scientific article; zbMATH DE number 7561442 (Why is no real title available?)
- Byzantine agreement with homonyms
- Asynchronous Byzantine agreement with optimal resilience
- Using knowledge to optimally achieve coordination in distributed systems
- Quantum multi-valued Byzantine agreement based on d-dimensional entangled states
- Global synchronization and consensus using beeps in a fault-prone multiple access channel
- On the power of an honest majority in three-party computation without broadcast
- Synchronization modulo P in dynamic networks
- DRAGON: decentralization at the cost of representation after arbitrary GrOupiNg and its applications to sub-cubic DKG and interactive consistency
- Nearly-optimal consensus tolerating adaptive omissions: why a lot of randomness is needed?
- TetraBFT: reducing latency of unauthenticated, responsive BFT consensus
- DARE to agree: Byzantine agreement with optimal resilience and adaptive communication
- Quantum Byzantine agreement with tripartite entangled states
- Authenticated Byzantine generals in dual failure model
- Efficient parallel algorithms can be made robust
- Low-cost clock synchronization
- Player-centric Byzantine agreement
- Distributed computing in asynchronous networks with byzantine edges
- Stability of long-lived consensus.
- The complexity of almost-optimal simultaneous coordination
- A simple voting protocol on quantum blockchain
- Efficient agreement over Byzantine gossip
- No double discount: condition-based simultaneity yields limited gain
- Distributed deterministic edge coloring using bounded neighborhood independence
- Efficient constructions for almost-everywhere secure computation
- Fork sequential consistency is blocking
- The customizable fault/error model for dependable distributed systems.
- Levels of authentication in distributed agreement
- Byzantine generals in the permissionless setting
- Coordinated consensus in dynamic networks
- Compact policy routing
- Managed agreement: generalizing two fundamental distributed agreement problems
- Byzantine agreement with homonyms
- Probabilistic termination and composability of cryptographic protocols
- Asynchronous reference frame agreement in a quantum network
- A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
- Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links
- Reaching approximate Byzantine consensus with multi-hop communication
- Consensus in the presence of mortal Byzantine faulty processes
- The bitcoin backbone protocol: analysis and applications
- Continuous consensus with ambiguous failures
- Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures
- Unbeatable consensus
- On the round complexity of randomized Byzantine agreement
- Good-case early-stopping latency of synchronous Byzantine reliable broadcast: the deterministic case
- Network agnostic MPC with statistical security
- Memory checking for parallel RAMs
- On secure computation of solitary output functionalities with and without broadcast
- On the round complexity of fully secure solitary MPC with honest majority
- MIS on trees
- Combination of clock-state and clock-rate correction in fault-tolerant distributed systems
- Self-stabilizing multivalued consensus in the presence of Byzantine faults and asynchrony
- A deterministic worst-case message complexity optimal solution for resource discovery
- A characterization of dynamic networks where consensus is solvable
- Distributed graph coloring in a few rounds
- Message-optimal protocols for Byzantine Agreement
- Modular construction of an efficient 1-bit Byzantine agreement protocol
- Gathering despite mischief
- Distributed sampled-data control of nonholonomic multi-robot systems with proximity networks
- Consensus when all processes may be Byzantine for some time
- Hundreds of impossibility results for distributed computing
- Information-theoretic broadcast with dishonest majority for long messages
- Communication lower bounds for cryptographic broadcast protocols
- Functional diagnosis of information transmission in computer systems with unknown initial information
- Self-stabilizing defeat status computation: dealing with conflict management in multi-agent systems
- Knowledge and common knowledge in a Byzantine environment: Crash failures
- A simple and communication-efficient omega algorithm in the crash-recovery model
- Refined quorum systems
- Time-efficient randomized multiple-message broadcast in radio networks
- A simple Byzantine generals protocol
- Optimistically tuning synchronous Byzantine consensus: another win for null messages
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
- From bounded to unbounded concurrency objects and back
- Byzantine Agreement Using Partial Authentication
- Characterization of secure multiparty computation without broadcast
- A formal model of asynchronous communication and its use in mechanically verifying a biphase mark protocol
- Permissionless consensus in the resource model
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)
