On the message complexity of secure multiparty computation

DOI10.1007/978-3-319-76578-5_24zbMath1441.94081OpenAlexW2793740528MaRDI QIDQ1749308

Manika Mittal, Rafail Ostrovsky, Yuval Ishai

Publication date: 16 May 2018

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

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Two-round MPC: information-theoretic and black-box ⋮ On the Bottleneck Complexity of MPC with Correlated Randomness ⋮ Secure Multiparty Matrix Multiplication Based on Strassen-Winograd Algorithm

This page was built for publication: On the message complexity of secure multiparty computation