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

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

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

Abstract

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.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: A major revision of an IACR publication in ASIACRYPT 2013
DOI: 10.1007/978-3-642-42045-0_12
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
History: 2013-12-02: last of 2 revisions; 2013-02-20: received; See all versions
Short URL: https://ia.cr/2013/085
License: CC BY

BibTeX

@misc{cryptoeprint:2013/085,
      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},
      url = {https://eprint.iacr.org/2013/085}
}