Round-optimal secure multiparty computation with honest majority
From MaRDI portal
(Redirected from Publication:1784101)
Recommendations
- Round-optimal secure multi-party computation
- Round-optimal secure multi-party computation
- Secure multiparty computation with minimal interaction
- Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)
- Constant-Round MPC with Fairness and Guarantee of Output Delivery
Cited in
(54)- Secure computation with parallel calls to 2-ary functions
- Concrete efficiency improvements for multiparty garbling with an honest majority
- Round-optimal secure multi-party computation
- Beyond honest majority: the round complexity of fair and robust multi-party computation
- Broadcast-optimal two-round MPC
- Broadcast-optimal two round MPC with an honest majority
- On actively-secure elementary MPC reductions
- Beyond honest majority: the round complexity of fair and robust multi-party computation
- On the exact round complexity of secure three-party computation
- Broadcast-optimal four-round MPC in the plain model
- On the round complexity of fully secure solitary MPC with honest majority
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
- Perfect secure computation in two rounds
- Two-round MPC: information-theoretic and black-box
- Round-optimal secure multi-party computation
- Perfect secure computation in two rounds
- Secure multiparty computation with minimal interaction
- Secure computation with minimal interaction, revisited
- Two-round secure MPC from indistinguishability obfuscation
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs
- Best of both worlds in secure computation, with low communication overhead
- Broadcast-optimal secure computation from black-box oblivious transfer
- Honest majority constant-round MPC with linear communication from one-way functions
- Broadcast-optimal two round MPC with asynchronous peer-to-peer channels
- On fully-secure honest majority MPC without \(n^2\) round overhead
- Towards round-optimal secure multiparty computations: multikey FHE without a CRS
- Round-optimal and communication-efficient multiparty computation
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- Round-optimal multi-party computation with identifiable abort
- One-round secure fair meeting location determination based on homomorphic encryption
- Multiparty reusable non-interactive secure computation from LWE
- How to share an NP statement or combiners for zero-knowledge proofs
- A little honesty goes a long way. The two-tier model for secure multiparty computation
- A new approach to round-optimal secure multiparty computation
- Proactive secure multiparty computation with a dishonest majority
- Guaranteed output delivery comes free in honest majority MPC
- Phoenix: secure computation in an unstable network with dropouts and comebacks
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
- Fully-secure MPC with minimal trust
- Adaptively secure MPC with sublinear communication complexity
- The round complexity of statistical MPC with optimal resiliency
- Secure MPC: laziness leads to GOD
- scientific article; zbMATH DE number 2009981 (Why is no real title available?)
- On the exact round complexity of best-of-both-worlds multi-party computation
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation?
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
- Optimal bounded-collusion secure functional encryption
- On the exact round complexity of secure three-party computation
- On communication models and best-achievable security in two-round MPC
- Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)
- On the computational overhead of MPC with dishonest majority
- Round Efficient Unconditionally Secure Multiparty Computation Protocol
- scientific article; zbMATH DE number 1942420 (Why is no real title available?)
- ATLAS: efficient and scalable MPC in the honest majority setting
This page was built for publication: Round-optimal secure multiparty computation with honest majority
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784101)
