Paper 2013/085

Between a Rock and a Hard Place: Interpolating Between MPC and FHE

Ashish Choudhury, Jake Loftus, Emmanuela Orsini, Arpita Patra, and Nigel P. Smart


We present a computationally secure MPC protocol for threshold adversaries which is parametrized by a value L. When L=2 we obtain a classical form of MPC protocol in which interaction is required for multiplications, as L increases interaction is reduced in that one requires interaction only after computing a higher degree function. When L approaches infinity one obtains the FHE based protocol of Gentry, which requires no interaction. Thus one can trade communication for computation in a simple way. Our protocol is based on an interactive protocol for ``bootstrapping'' a somewhat homomorphic encryption scheme. The key contribution is that our presented protocol is highly communication efficient enabling us to obtain reduced communication when compared to traditional MPC protocols for relatively small values of L.

Available format(s)
Public-key cryptography
Publication info
A major revision of an IACR publication in ASIACRYPT 2013
Contact author(s)
Ashish Choudhary @ bristol ac uk
Emmanuela Orsini @ bristol ac uk
Arpita Patra @ bristol ac uk
loftus @ cs bris ac uk
nigel @ cs bris ac uk
2013-12-02: last of 2 revisions
2013-02-20: received
See all versions
Short URL
Creative Commons Attribution


      author = {Ashish Choudhury and Jake Loftus and Emmanuela Orsini and Arpita Patra and Nigel P.  Smart},
      title = {Between a Rock and a Hard Place: Interpolating Between MPC and FHE},
      howpublished = {Cryptology ePrint Archive, Paper 2013/085},
      year = {2013},
      doi = {10.1007/978-3-642-42045-0_12},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.