Pages that link to "Item:Q2401120"
From MaRDI portal
The following pages link to Secure multi-party computation in large networks (Q2401120):
Displaying 12 items.
- Batch secret sharing for secure multi-party computation in asynchronous network (Q615211) (← links)
- Secure \(k\)-skyband computation framework in distributed multi-party databases (Q2660865) (← links)
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? (Q2691585) (← links)
- Size-Hiding Computation for Multiple Parties (Q2953801) (← links)
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs (Q3457093) (← links)
- On Secure Multi-party Computation in Black-Box Groups (Q3612572) (← links)
- (Q4249652) (← links)
- From fairness to full security in multiparty computation (Q5916285) (← links)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
- Fast large-scale honest-majority MPC for malicious adversaries (Q6110373) (← links)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)
- Scalable agreement protocols with optimal optimistic efficiency (Q6660395) (← links)