The following pages link to (Q4035733):
Displayed 4 items.
- Fast large-scale honest-majority MPC for malicious adversaries (Q6110373) (← links)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)
- Concurrently composable non-interactive secure computation (Q6135409) (← links)
- Oblivious transfer with constant computational overhead (Q6138086) (← links)