Concrete efficiency improvements for multiparty garbling with an honest majority

DOI10.1007/978-3-030-25283-0_16zbMath1454.94048OpenAlexW2962995847MaRDI QIDQ2303112

Aner Ben-Efraim, Eran Omri

Publication date: 2 March 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-25283-0_16

zbMATH Keywords

concrete efficiencygarbled circuitsconstant round MPChonest majority

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

MPClan: protocol suite for privacy-conscious computations ⋮ On multiparty garbling of arithmetic circuits ⋮ PC-SyncBB: a privacy preserving collusion secure DCOP algorithm ⋮ TinyKeys: a new approach to efficient multi-party computation ⋮ Block cipher invariants as eigenvectors of correlation matrices

This page was built for publication: Concrete efficiency improvements for multiparty garbling with an honest majority