Committed MPC -- maliciously secure multiparty computation from homomorphic commitments

DOI10.1007/978-3-319-76578-5_20zbMath1441.94078OpenAlexW2950393457MaRDI QIDQ1749303

Avishay Yanai, Benny Pinkas, Tore Kasper Frederiksen

Publication date: 16 May 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-76578-5_20

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Highly efficient OT-based multiplication protocols ⋮ More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings ⋮ Low cost constant round MPC combining BMR and oblivious transfer ⋮ Squares of matrix-product codes

This page was built for publication: Committed MPC -- maliciously secure multiparty computation from homomorphic commitments