Pages that link to "Item:Q2695652"
From MaRDI portal
The following pages link to Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback (Q2695652):
Displaying 9 items.
- Synchronous consensus with optimal asynchronous fallback guarantees (Q2175907) (← links)
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience (Q2697681) (← links)
- Fully Polynomial Byzantine Agreement for <i>n</i> > 3<i>t</i> Processors in <i>t</i> + 1 Rounds (Q4388871) (← links)
- Jolteon and Ditto: network-adaptive efficient consensus with asynchronous fallback (Q6045206) (← links)
- Synchronous perfectly secure message transmission with optimal asynchronous fallback guarantees (Q6573950) (← links)
- Network agnostic MPC with statistical security (Q6582167) (← links)
- Network-agnostic multi-party computation revisited (extended abstract) (Q6635768) (← links)
- Closing the efficiency gap between synchronous and network-agnostic consensus (Q6637554) (← links)
- Towards achieving asynchronous MPC with linear communication and optimal resilience (Q6653027) (← links)