Non-interactive secure multiparty computation
From MaRDI portal
Recommendations
- On the (in)efficiency of non-interactive secure multiparty computation
- On the (in)efficiency of non-interactive secure multiparty computation
- Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions
- An efficient construction of non-interactive secure multiparty computation
- Robust non-interactive multiparty computation against constant-size collusion
Cited in
(41)- On fully secure MPC with solitary output
- Reusable non-interactive secure computation
- Distribution design
- Multi-key and multi-input predicate encryption (for conjunctions) from learning with errors
- Multi-key and multi-input predicate encryption from learning with errors
- On secure computation of solitary output functionalities with and without broadcast
- An efficient construction of non-interactive secure multiparty computation
- Best possible information-theoretic MPC
- Robust non-interactive multiparty computation against constant-size collusion
- Survey of information security
- Non-interactive multiparty computation without correlated randomness
- Characterization of secure multiparty computation without broadcast
- Multi-input functional encryption and its application in outsourcing computation
- Multi-input functional encryption with unbounded-message security
- Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity
- Topology-hiding computation beyond logarithmic diameter
- On the bottleneck complexity of MPC with correlated randomness
- On the (in)efficiency of non-interactive secure multiparty computation
- On the (in)efficiency of non-interactive secure multiparty computation
- Additive randomized encodings and their applications
- Private simultaneous messages based on quadratic residues
- Threshold garbled circuits and ad hoc secure computation
- scientific article; zbMATH DE number 1418292 (Why is no real title available?)
- Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions
- Ad hoc PSM protocols: secure computation without coordination
- Distributed (correlation) samplers: how to remove a trusted dealer in one round
- Multiparty reusable non-interactive secure computation from LWE
- Topology-hiding computation on all graphs
- Additive randomized encodings from public key encryption
- Secure multiparty computation of symmetric functions with polylogarithmic bottleneck complexity and correlated randomness
- Can Alice and Bob guarantee output to Carol?
- Is information-theoretic topology-hiding computation possible?
- Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials
- On cryptographic anonymity and unpredictability in secret sharing
- Efficient multiparty private simultaneous messages for symmetric functions
- Robust additive randomized encodings from IO and pseudo-non-linear codes
- Blockchains enable non-interactive MPC
- How to obfuscate MPC inputs
- Non-interactive secure computation from one-way functions
- Towards practical topology-hiding computation
- Brief announcement: On secure m-party computation, commuting permutation systems and unassisted non-interactive MPC
This page was built for publication: Non-interactive secure multiparty computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874549)
