Pages that link to "Item:Q1675737"
From MaRDI portal
The following pages link to A new approach to round-optimal secure multiparty computation (Q1675737):
Displaying 11 items.
- What security can we achieve within 4 rounds? (Q2010586) (← links)
- Towards accountability in CRS generation (Q2056795) (← links)
- Reverse firewalls for actively secure MPCs (Q2096547) (← links)
- On the round complexity of secure quantum computation (Q2120084) (← links)
- Three-round secure multiparty computation from black-box two-round oblivious transfer (Q2128560) (← links)
- On the round complexity of black-box secure MPC (Q2128561) (← links)
- Round-optimal multi-party computation with identifiable abort (Q2170005) (← links)
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement (Q2175906) (← links)
- From FE combiners to secure MPC and back (Q2175912) (← links)
- On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581) (← links)
- Two-round maliciously secure computation with super-polynomial simulation (Q2695653) (← links)
