Pages that link to "Item:Q3959472"
From MaRDI portal
The following pages link to The Byzantine generals strike again (Q3959472):
Displayed 50 items.
- Agreement under faulty interfaces (Q293206) (← links)
- Consensus in the presence of mortal Byzantine faulty processes (Q424903) (← links)
- Multi-verifier signatures (Q431790) (← links)
- On the impact of link faults on Byzantine agreement (Q476176) (← links)
- Mutual information reconciliation in non-fully connected heterogeneous multicomputer computational systems (Q612038) (← links)
- Secure message transmission in asynchronous networks (Q635383) (← links)
- \(f\)-sensitivity distance oracles and routing schemes (Q692635) (← links)
- Synchronous consensus under hybrid process and link failures (Q719299) (← links)
- Invited talk: Resilient distributed algorithms (Q831782) (← links)
- Broadcasting with locally bounded byzantine faults (Q835004) (← links)
- Feasibility and complexity of broadcasting with random transmission failures (Q868959) (← links)
- Synchronous counting and computational algorithm design (Q896024) (← links)
- Tight bound on mobile Byzantine agreement (Q897904) (← links)
- Almost-everywhere secure computation with edge corruptions (Q901366) (← links)
- On the round complexity of Byzantine agreement without initial set-up (Q1044183) (← links)
- How to cope with faulty processors in a completely connected network of communicating processors (Q1060840) (← links)
- On the possibility and impossibility of achieving clock synchronization (Q1077930) (← links)
- Easy impossibility proofs for distributed consensus problems (Q1079947) (← links)
- Serializability theory for replicated databases (Q1083230) (← links)
- A lower bound for the time to assure interactive consistency (Q1168726) (← links)
- Modular construction of a Byzantine agreement protocol with optimal message bit complexity (Q1186809) (← links)
- A self-adjusting algorithm for Byzantine agreement (Q1189860) (← links)
- Reliable communication over partially authenticated networks (Q1292432) (← links)
- Efficient agreement using fault diagnosis. (Q1312601) (← links)
- Fast consensus in networks of bounded degree. (Q1312604) (← links)
- Agreement in the presence of faults, on networks of bounded degree (Q1351635) (← links)
- Oblivious transfer in incomplete networks (Q1629424) (← links)
- Incentives and the structure of communication (Q1753690) (← links)
- On private computation in incomplete networks (Q1954202) (← links)
- Instant block confirmation in the sleepy model (Q2147229) (← links)
- Is information-theoretic topology-hiding computation possible? (Q2175925) (← links)
- Lower bounds for weak Byzantine agreement (Q2277850) (← links)
- Resilient consensus for multi-agent systems subject to differential privacy requirements (Q2280733) (← links)
- The Heard-Of model: computing in distributed systems with benign faults (Q2377130) (← links)
- Communications in unknown networks: preserving the secret of topology (Q2382672) (← links)
- Agreement in synchronous networks with ubiquitous faults (Q2382676) (← links)
- Performance study of Byzantine agreement protocol with artificial neural network (Q2384832) (← links)
- Reliable broadcast with respect to topology knowledge (Q2407628) (← links)
- Algorand: a secure and efficient distributed ledger (Q2422025) (← links)
- Probabilistic reliability and privacy of communication using multicast in general neighbor networks (Q2425532) (← links)
- Computational aspects of uncertainty profiles and angel-daemon games (Q2441541) (← links)
- Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip (Q2637656) (← links)
- Recent Results on Fault-Tolerant Consensus in Message-Passing Networks (Q2835019) (← links)
- The Byzantine Generals Problem in Generic and Wireless Networks (Q2926152) (← links)
- Broadcast (and Round) Efficient Verifiable Secret Sharing (Q2948264) (← links)
- Byzantine Agreement Using Partial Authentication (Q3095344) (← links)
- Authenticated Byzantine Generals in Dual Failure Model (Q3406476) (← links)
- Constant-Space Localized Byzantine Consensus (Q3540228) (← links)
- The Failure Discovery problem (Q4031322) (← links)
- Modular construction of an efficient 1-bit Byzantine agreement protocol (Q4031323) (← links)