Paper 2020/550

Practical MPC+FHE with Applications in Secure Multi-PartyNeural Network Evaluation

Ruiyu Zhu, Changchang Ding, and Yan Huang


The theoretical idea of using FHE to realize MPC has been therefor over a decade. Existing threshold (and multi-key) FHE schemes were constructed by modifying and analyzing a traditional single-keyFHE in a case-by-case manner, thus technically highly-demanding.This work explores a new approach to build threshold FHE (therebyMPC schemes) through tailoring generic MPC protocols to the base FHE scheme while requiring no effort in FHE redesign. We applied our approach to two representative Ring-LWE-based FHE schemes: CKKS and GHS, producing GMPFHE-CKKS and GMPFHE-GHS. We developed MPC protocols based on GMPFHE-CKKS and GMPFHE-GHS which are secure against any number of passive but colluding adversaries. The online cost of our MPC protocol is $O(|C|)$, as opposed to $O(|C|·n^2)$ for existing MPC protocols, and our offline cost is independent of $|C|$. We experimentally show that the GMPFHE-CKKS-based MPC protocol offers unparalleled amortized performance on multi-party neural network evaluation.

Available format(s)
Publication info
Preprint. MINOR revision.
Contact author(s)
rynzhu @ gmail com
dingchan @ indiana edu
yhuang @ cs umd edu
2020-06-27: revised
2020-05-15: received
See all versions
Short URL
Creative Commons Attribution


      author = {Ruiyu Zhu and Changchang Ding and Yan Huang},
      title = {Practical {MPC}+{FHE} with Applications in Secure Multi-{PartyNeural} Network Evaluation},
      howpublished = {Cryptology ePrint Archive, Paper 2020/550},
      year = {2020},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.