Pages that link to "Item:Q3873545"
From MaRDI portal
The following pages link to Reaching Agreement in the Presence of Faults (Q3873545):
Displaying 50 items.
- Contention-related crash failures: definitions, agreement algorithms, and impossibility results (Q2078617) (← links)
- Practical quantum Byzantine protocol via nearly optimal entanglement resources (Q2105946) (← links)
- Quantum Byzantine agreement for any number of dishonest parties (Q2107116) (← links)
- Synchronization modulo \(P\) in dynamic networks (Q2110375) (← links)
- The epigenetic consensus problem (Q2117720) (← links)
- Efficient constructions for almost-everywhere secure computation (Q2119011) (← links)
- Unbeatable consensus (Q2121062) (← links)
- On the round complexity of randomized Byzantine agreement (Q2121502) (← links)
- Valency-based consensus under message adversaries without limit-closure (Q2140525) (← links)
- Byzantine gathering in polynomial time (Q2146872) (← links)
- Instant block confirmation in the sleepy model (Q2147229) (← links)
- Efficient state management in distributed ledgers (Q2147249) (← links)
- High-threshold AVSS with optimal communication complexity (Q2147255) (← links)
- Decentralized asset custody scheme with security against rational adversary (Q2152140) (← links)
- Synchronous consensus with optimal asynchronous fallback guarantees (Q2175907) (← links)
- Byzantine preferential voting (Q2190409) (← links)
- Optimistically tuning synchronous Byzantine consensus: another win for null messages (Q2241306) (← links)
- Asynchronous Byzantine agreement with optimal resilience (Q2251153) (← links)
- Computer science and decision theory (Q2271874) (← links)
- Lower bounds for weak Byzantine agreement (Q2277850) (← links)
- Quantum multi-valued Byzantine agreement based on d-dimensional entangled states (Q2280627) (← links)
- Global synchronization and consensus using beeps in a fault-prone multiple access channel (Q2285154) (← links)
- Probabilistic termination and composability of cryptographic protocols (Q2318087) (← links)
- Efficient constant-round multi-party computation combining BMR and SPDZ (Q2318094) (← links)
- Defending non-Bayesian learning against adversarial attacks (Q2318111) (← links)
- Quantum Byzantine agreement with tripartite entangled states (Q2323766) (← links)
- The firing squad problem revisited (Q2326403) (← links)
- A deterministic worst-case message complexity optimal solution for resource discovery (Q2345458) (← links)
- A characterization of oblivious message adversaries for which consensus is solvable (Q2345460) (← links)
- Byzantine gathering in networks (Q2359766) (← links)
- Common knowledge and consistent simultaneous coordination (Q2365570) (← links)
- The Heard-Of model: computing in distributed systems with benign faults (Q2377130) (← links)
- Agreement in synchronous networks with ubiquitous faults (Q2382676) (← links)
- Performance study of Byzantine agreement protocol with artificial neural network (Q2384832) (← links)
- Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems (Q2398211) (← links)
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time (Q2406433) (← links)
- Algorand: a secure and efficient distributed ledger (Q2422025) (← links)
- A Paxos based algorithm to minimize the overhead of process recovery in consensus (Q2422778) (← links)
- Computational aspects of uncertainty profiles and angel-daemon games (Q2441541) (← links)
- Functional diagnosis of information transmission in computer systems with unknown initial information (Q2457482) (← links)
- Self-stabilizing defeat status computation: dealing with conflict management in multi-agent systems (Q2457665) (← links)
- Efficient algorithms for anonymous Byzantine agreement (Q2480748) (← links)
- Distributed system diagnosis of Byzantine failures in partially connected multicomputer systems (Q2487496) (← links)
- Authenticated broadcast with a partially compromised public-key infrastructure (Q2637312) (← links)
- Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip (Q2637656) (← links)
- Optimal extension protocols for Byzantine broadcast and agreement (Q2657277) (← links)
- Towards self-stabilizing blockchain, reconstructing totally erased blockchain (Q2672262) (← links)
- Efficient fully secure computation via distributed zero-knowledge proofs (Q2691587) (← links)
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback (Q2695652) (← links)
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience (Q2697681) (← links)
