Pages that link to "Item:Q1989464"
From MaRDI portal
The following pages link to An efficient construction of non-interactive secure multiparty computation (Q1989464):
Displaying 11 items.
- Constructions and bounds for unconditionally secure non-interactive commitment schemes (Q1611358) (← links)
- On the (in)efficiency of non-interactive secure multiparty computation (Q1650437) (← links)
- Robust non-interactive multiparty computation against constant-size collusion (Q1675732) (← links)
- Non-interactive multiparty computation without correlated randomness (Q1701442) (← links)
- Characterization of secure multiparty computation without broadcast (Q1753172) (← links)
- Efficient constructions for almost-everywhere secure computation (Q2119011) (← 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)
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol (Q5756545) (← links)