Round-optimal secure multiparty computation with honest majority

DOI10.1007/978-3-319-96881-0_14zbMath1436.94029OpenAlexW2883285857MaRDI QIDQ1784101

Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain, Prabhanjan V. Ananth

Publication date: 26 September 2018

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

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (18)

Broadcast-optimal two round MPC with an honest majority ⋮ Two-round MPC: information-theoretic and black-box ⋮ Perfect secure computation in two rounds ⋮ Optimal bounded-collusion secure functional encryption ⋮ Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) ⋮ Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ Secure MPC: laziness leads to GOD ⋮ Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? ⋮ On actively-secure elementary MPC reductions ⋮ On communication models and best-achievable security in two-round MPC ⋮ Perfect Secure Computation in Two Rounds ⋮ Beyond honest majority: the round complexity of fair and robust multi-party computation ⋮ On the exact round complexity of secure three-party computation ⋮ Round-optimal secure multi-party computation ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Multiparty reusable non-interactive secure computation from LWE ⋮ Broadcast-optimal two-round MPC

This page was built for publication: Round-optimal secure multiparty computation with honest majority