The following pages link to Asynchronous secure computation (Q5248471):
Displaying 23 items.
- Interplay between (im)perfectness, synchrony and connectivity: the case of reliable message transmission (Q391242) (← links)
- Secure message transmission in asynchronous networks (Q635383) (← links)
- Reducing communication costs in robust peer-to-peer networks (Q963355) (← links)
- Efficient asynchronous verifiable secret sharing and multiparty computation (Q2018817) (← links)
- Topology-hiding computation for networks with unknown delays (Q2055692) (← links)
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback (Q2096546) (← links)
- High-threshold AVSS with optimal communication complexity (Q2147255) (← links)
- Perfectly-secure asynchronous MPC for general adversaries (extended abstract) (Q2152066) (← links)
- Improving the efficiency of optimally-resilient statistically-secure asynchronous multi-party computation (Q2152067) (← links)
- High throughput secure MPC over small population in hybrid networks (extended abstract) (Q2152069) (← links)
- Revisiting asynchronous fault tolerant computation with optimal resilience (Q2166363) (← links)
- Secure multi-party computation in large networks (Q2401120) (← links)
- Optimal extension protocols for Byzantine broadcast and agreement (Q2657277) (← links)
- Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing (Q2827715) (← links)
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions (Q2953803) (← links)
- The Cost of Fault Tolerance in Multi-Party Communication Complexity (Q3189654) (← links)
- Asynchronous Multi-Party Computation with Quadratic Communication (Q3519524) (← links)
- Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience (Q4931669) (← links)
- Cryptography and cryptographic protocols (Q5138490) (← links)
- Reaching consensus for asynchronous distributed key generation (Q6096032) (← links)
- Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries (Q6110376) (← links)
- Categorical composable cryptography: extended version (Q6178713) (← links)
- Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience (Q6204550) (← links)
