Efficient scalable constant-round MPC via garbled circuits

DOI10.1007/978-3-319-70697-9_17zbMath1417.94042OpenAlexW2770795779MaRDI QIDQ1703935

Eran Omri, Aner Ben-Efraim, Yehuda Lindell

Publication date: 8 March 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-70697-9_17

zbMATH Keywords

concrete efficiencygarbled circuitsconstant round MPCkey-homomorphic PRFs

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Secure multiparty computation with free branching ⋮ Breaking and fixing garbled circuits when a gate has duplicate input wires ⋮ TinyKeys: a new approach to efficient multi-party computation ⋮ Large scale, actively secure computation from LPN and free-XOR garbled circuits ⋮ Efficient constant-round multi-party computation combining BMR and SPDZ

This page was built for publication: Efficient scalable constant-round MPC via garbled circuits