On the (in)efficiency of non-interactive secure multiparty computation
From MaRDI portal
Publication:2806770
Recommendations
- On the (in)efficiency of non-interactive secure multiparty computation
- An efficient construction of non-interactive secure multiparty computation
- Non-interactive secure multiparty computation
- Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions
- Brief announcement: On secure m-party computation, commuting permutation systems and unassisted non-interactive MPC
Cited in
(11)- Non-interactive secure multiparty computation
- On the message complexity of secure multiparty computation
- An efficient construction of non-interactive secure multiparty computation
- On the (in)efficiency of non-interactive secure multiparty computation
- Robust non-interactive multiparty computation against constant-size collusion
- The price of low communication in secure multi-party computation
- Blockchains enable non-interactive MPC
- Efficient information-theoretic multi-party computation over non-commutative rings
- Brief announcement: On secure m-party computation, commuting permutation systems and unassisted non-interactive MPC
- Non-interactive multiparty computation without correlated randomness
- Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions
This page was built for publication: On the (in)efficiency of non-interactive secure multiparty computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806770)