Round-optimal secure multiparty computation with honest majority

DOI10.1007/978-3-319-96881-0_14zbMATH Open1436.94029OpenAlexW2883285857MaRDI QIDQ1784101FDOQ1784101

Authors: Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain, Prabhanjan Ananth 

Publication date: 26 September 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-96881-0_14

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (49)

• 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
• Broadcast-optimal four-round MPC in the plain model
• On the round complexity of fully secure solitary MPC with honest majority
• On the exact round complexity of secure three-party computation
• Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
• Round-optimal secure multi-party computation
• Perfect secure computation in two rounds
• Two-round MPC: information-theoretic and black-box
• Perfect secure computation in two rounds
• Secure multiparty computation with minimal interaction
• Two-round secure MPC from indistinguishability obfuscation
• Secure computation with minimal interaction, revisited
• Broadcast-optimal two round MPC with asynchronous peer-to-peer channels
• On fully-secure honest majority MPC without \(n^2\) round overhead
• Best of both worlds in secure computation, with low communication overhead
• Towards round-optimal secure multiparty computations: multikey FHE without a CRS
• Round-optimal and communication-efficient multiparty computation
• A little honesty goes a long way. The two-tier model for secure 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
• A new approach to round-optimal secure multiparty computation
• Guaranteed output delivery comes free in honest majority MPC
• Phoenix: secure computation in an unstable network with dropouts and comebacks
• Proactive secure multiparty computation with a dishonest majority
• 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
• Title not available (Why is that?)
• Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
• 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?
• On the exact round complexity of secure three-party computation
• Optimal bounded-collusion secure functional encryption
• Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)
• On communication models and best-achievable security in two-round MPC
• On the computational overhead of MPC with dishonest majority
• Round Efficient Unconditionally Secure Multiparty Computation Protocol
• Title not available (Why is that?)
• 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)