Pages that link to "Item:Q4376159"
From MaRDI portal
The following pages link to An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement (Q4376159):
Displayed 37 items.
- A full proof of the BGW protocol for perfectly secure multiparty computation (Q514468) (← links)
- Tight bound on mobile Byzantine agreement (Q897904) (← links)
- On expected constant-round protocols for Byzantine agreement (Q1004599) (← links)
- Perfect information leader election in \(\log^*n+O(1)\) rounds (Q1604211) (← links)
- Perennial secure multi-party computation of universal Turing machine (Q1737594) (← links)
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
- Sublinear-round Byzantine agreement under corrupt majority (Q2055693) (← links)
- How Byzantine is a send corruption? (Q2096642) (← links)
- On the round complexity of randomized Byzantine agreement (Q2121502) (← links)
- Round-optimal Byzantine agreement (Q2169994) (← links)
- Synchronous consensus with optimal asynchronous fallback guarantees (Q2175907) (← links)
- Optimistically tuning synchronous Byzantine consensus: another win for null messages (Q2241306) (← links)
- Asynchronous Byzantine agreement with optimal resilience (Q2251153) (← links)
- Probabilistic termination and composability of cryptographic protocols (Q2318087) (← links)
- Efficient constant-round multi-party computation combining BMR and SPDZ (Q2318094) (← links)
- Lower bound for scalable Byzantine agreement (Q2377258) (← links)
- Improving the round complexity of VSS in point-to-point networks (Q2389350) (← links)
- Algorand: a secure and efficient distributed ledger (Q2422025) (← links)
- Secure multi-party computation made simple (Q2489932) (← links)
- Optimal extension protocols for Byzantine broadcast and agreement (Q2657277) (← links)
- Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) (← links)
- Secure Message Transmission by Public Discussion: A Brief Survey (Q3005585) (← links)
- Resilient Distributed Field Estimation (Q3300776) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Randomized protocols for asynchronous consensus (Q5138489) (← links)
- Cryptography and cryptographic protocols (Q5138490) (← links)
- Resilient-optimal interactive consistency in constant time (Q5138494) (← links)
- Spatial reference frame agreement in quantum networks (Q5143242) (← links)
- Efficient perfectly secure computation with optimal resilience (Q5918515) (← links)
- Efficient perfectly secure computation with optimal resilience (Q5925697) (← links)
- Reaching consensus for asynchronous distributed key generation (Q6096032) (← links)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)
- Fault-tolerant graph realizations in the congested clique (Q6112001) (← links)
- Asymptotically free broadcast in constant expected time via packed VSS (Q6114239) (← links)
- Multidimensional Byzantine agreement in a synchronous setting (Q6122408) (← links)
- Distributed CONGEST Algorithms against Mobile Adversaries (Q6202259) (← links)
- Brief Announcement: Improved Consensus in Quantum Networks (Q6202264) (← links)