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.
- Wait-free approximate agreement on graphs (Q5925616) (← links)
- A distributed computing perspective of unconditionally secure information transmission in Russian cards problems (Q5925684) (← links)
- Permissionless consensus in the resource model (Q6045237) (← links)
- Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast (Q6047193) (← links)
- Asynchronous Byzantine reliable broadcast with a message adversary (Q6050128) (← links)
- Correction to: ``Topology-hiding communication from minimal assumptions'' (Q6054730) (← links)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
- Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey (Q6073106) (← links)
- A resilient distributed optimization strategy against false data injection attacks (Q6078841) (← links)
- Total ordering algorithms for asynchronous Byzantine systems (Q6084560) (← links)
- Optimal algorithms for synchronous Byzantine \(k\)-set agreement (Q6093586) (← links)
- Reaching agreement in the presence of contention-related crash failures (Q6100185) (← links)
- Gossiping for communication-efficient broadcast (Q6108990) (← links)
- On the power of an honest majority in three-party computation without broadcast (Q6109073) (← links)
- Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries (Q6110376) (← links)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)
- Asymptotically free broadcast in constant expected time via packed VSS (Q6114239) (← links)
- Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast (Q6155246) (← links)
- \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions (Q6157530) (← links)
- Decentralizing information technology: the advent of resource based systems (Q6164495) (← links)
- Reaching a consensus with limited information (Q6174043) (← links)
- On tolerance of discrete systems with respect to transition perturbations (Q6201386) (← links)
- On the Validity of Consensus (Q6202272) (← links)
- Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience (Q6204550) (← links)
- Byzantine-Tolerant Reliable Broadcast in the Presence of Silent Churn (Q6488432) (← links)
- Synchronization Modulo k in Dynamic Networks (Q6488455) (← links)
- A theorem prover for a computational logic (Q6488518) (← links)
- From partial to global asynchronous reliable broadcast (Q6535028) (← links)
- Fast agreement in networks with Byzantine nodes (Q6535029) (← links)
- Scalable and secure computation among strangers: message-competitive Byzantine protocols (Q6535030) (← links)
- Safe environmental envelopes of discrete systems (Q6535638) (← links)
- The consensus machine: formalising consensus in the presence of malign agents (Q6535829) (← links)
- Levels of authentication in distributed agreement (Q6570910) (← links)
- Byzantine generals in the permissionless setting (Q6573944) (← links)
- Good-case early-stopping latency of synchronous Byzantine reliable broadcast: the deterministic case (Q6579853) (← links)
- Network agnostic MPC with statistical security (Q6582167) (← links)
- On secure computation of solitary output functionalities with and without broadcast (Q6582168) (← links)
- On the round complexity of fully secure solitary MPC with honest majority (Q6582169) (← links)
- Memory checking for parallel RAMs (Q6582183) (← links)
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited (Q6587962) (← links)
- Asymmetric distributed trust (Q6601210) (← links)
- Process-commutative distributed objects: from cryptocurrencies to Byzantine-fault-tolerant CRDTs (Q6614029) (← links)
- Proof-of-work-based consensus in expected-constant time (Q6637326) (← links)
- Perfect (parallel) broadcast in constant expected rounds via statistical VSS (Q6637549) (← links)
- Sublinear message bounds of authenticated implicit Byzantine agreement (Q6646446) (← links)
- Detecting causality in the presence of Byzantine processes: the case of synchronous systems (Q6647755) (← links)
- Towards permissionless consensus in the standard model via fine-grained complexity (Q6648203) (← links)
- Universal composable transaction serialization with order fairness (Q6648204) (← links)
- MPC for tech giants (GMPC): enabling Gulliver and the Lilliputians to cooperate amicably (Q6653024) (← links)
- Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions (Q6653026) (← links)
