Degree 2 is complete for the round-complexity of malicious MPC

DOI10.1007/978-3-030-17656-3_18OpenAlexW2926359596MaRDI QIDQ2292883

Rotem Tsabary, Benny Applebaum, Zvika Brakerski

Publication date: 6 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-17656-3_18

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer system organization (68Mxx)

Related Items (10)

mrNISC from LWE with polynomial modulus ⋮ mrNISC from LWE with polynomial modulus ⋮ Two-round MPC without round collapsing revisited -- towards efficient malicious protocols ⋮ 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 ⋮ Broadcast-optimal two-round MPC

This page was built for publication: Degree 2 is complete for the round-complexity of malicious MPC