Non-interactive multiparty computation without correlated randomness
From MaRDI portal
Recommendations
- Non-interactive secure multiparty computation
- Robust non-interactive multiparty computation against constant-size collusion
- An efficient construction of non-interactive secure multiparty computation
- On the (in)efficiency of non-interactive secure multiparty computation
- On the (in)efficiency of non-interactive secure multiparty computation
Cited in
(16)- Multi-key and multi-input predicate encryption (for conjunctions) from learning with errors
- Multi-key and multi-input predicate encryption from learning with errors
- Non-interactive anonymous router with quasi-linear router computation
- An efficient construction of non-interactive secure multiparty computation
- Best possible information-theoretic MPC
- Robust non-interactive multiparty computation against constant-size collusion
- Additive randomized encodings and their applications
- Security-preserving distributed samplers: how to generate any CRS in one round without random oracles
- Threshold garbled circuits and ad hoc secure computation
- Distributed (correlation) samplers: how to remove a trusted dealer in one round
- Secure non-interactive reduction and spectral analysis of correlations
- Puncturable signature: a generic construction and instantiations
- Robust additive randomized encodings from IO and pseudo-non-linear codes
- Blockchains enable non-interactive MPC
- How to obfuscate MPC inputs
- Compact identity-based signature and puncturable signature from SQISign
This page was built for publication: Non-interactive multiparty computation without correlated randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1701442)
