Pages that link to "Item:Q1784101"
From MaRDI portal
The following pages link to Round-optimal secure multiparty computation with honest majority (Q1784101):
Displaying 16 items.
- Two-round MPC: information-theoretic and black-box (Q1629402) (← links)
- Perfect secure computation in two rounds (Q1629404) (← links)
- Multiparty reusable non-interactive secure computation from LWE (Q2056764) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- Broadcast-optimal two round MPC with an honest majority (Q2128559) (← links)
- Optimal bounded-collusion secure functional encryption (Q2175911) (← links)
- On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581) (← links)
- Secure MPC: laziness leads to GOD (Q2691583) (← links)
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? (Q2691585) (← links)
- On actively-secure elementary MPC reductions (Q2695655) (← links)
- On communication models and best-achievable security in two-round MPC (Q2697851) (← links)
- Perfect Secure Computation in Two Rounds (Q5149757) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- Round-optimal secure multi-party computation (Q5918346) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- Beyond honest majority: the round complexity of fair and robust multi-party computation (Q6109085) (← links)
