International Association for Cryptologic Research

International Association
for Cryptologic Research


Paper: Maliciously Secure Matrix Multiplication with Applications to Private Deep Learning

Hao Chen
Miran Kim
Ilya Razenshteyn
Dragos Rotaru
Yongsoo Song
Sameer Wagh
DOI: 10.1007/978-3-030-64840-4_2
Search ePrint
Search Google
Abstract: Computing on data in a manner that preserve the privacy is of growing importance. Multi-Party Computation (MPC) and Homomorphic Encryption (HE) are two cryptographic techniques for privacy-preserving computations. In this work, we have developed efficient UC-secure multiparty protocols for matrix multiplications and two-dimensional convolutions. We built upon the SPDZ framework and integrated the state-of-the-art HE algorithms for matrix multiplication. Our protocol achieved communication cost linear only in the input and output dimensions and not on the number of multiplication operations. We eliminate the ''triple sacrifice'' step of SPDZ to improve efficiency and simplify the zero-knowledge proofs. We implemented our protocols and benchmarked them against the SPDZ LowGear variant (Keller et al. Eurocrypt'18). For multiplying two square matrices of size 128, we reduced the communication cost from 1.54 GB to 12.46 MB, an improvement of over two orders of magnitude that only improves with larger matrix sizes. For evaluating all convolution layers of the ResNet-50 neural network, the communication reduces cost from 5 TB to 41 GB.
Video from ASIACRYPT 2020
  title={Maliciously Secure Matrix Multiplication with Applications to Private Deep Learning},
  booktitle={Advances in Cryptology - ASIACRYPT 2020},
  author={Hao Chen and Miran Kim and Ilya Razenshteyn and Dragos Rotaru and Yongsoo Song and Sameer Wagh},