Pages that link to "Item:Q4376159"
From MaRDI portal
The following pages link to An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement (Q4376159):
Displaying 13 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)
- 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)
- Reaching consensus for asynchronous distributed key generation (Q6096032) (← links)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)
- Multidimensional Byzantine agreement in a synchronous setting (Q6122408) (← links)
