Degree 2 is complete for the round-complexity of malicious MPC
From MaRDI portal
Publication:2292883
Recommendations
Cited in
(11)- mrNISC from LWE with polynomial modulus
- Beyond honest majority: the round complexity of fair and robust multi-party computation
- Broadcast-optimal two-round MPC
- On actively-secure elementary MPC reductions
- On the exact round complexity of secure three-party computation
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
- Perfect secure computation in two rounds
- The round complexity of statistical MPC with optimal resiliency
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation?
- On communication models and best-achievable security in two-round MPC
- mrNISC from LWE with polynomial modulus
This page was built for publication: Degree 2 is complete for the round-complexity of malicious MPC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292883)