Pages that link to "Item:Q1650437"
From MaRDI portal
The following pages link to On the (in)efficiency of non-interactive secure multiparty computation (Q1650437):
Displaying 9 items.
- Robust non-interactive multiparty computation against constant-size collusion (Q1675732) (← links)
- The price of low communication in secure multi-party computation (Q1675733) (← links)
- Non-interactive multiparty computation without correlated randomness (Q1701442) (← links)
- On the message complexity of secure multiparty computation (Q1749308) (← links)
- An efficient construction of non-interactive secure multiparty computation (Q1989464) (← links)
- Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions (Q2128566) (← links)
- Efficient information-theoretic multi-party computation over non-commutative rings (Q2128567) (← links)
- Blockchains enable non-interactive MPC (Q2697855) (← links)
- Brief announcement: On secure m-party computation, commuting permutation systems and unassisted non-interactive MPC (Q5002786) (← links)