Cryptology ePrint Archive: Report 2020/240

MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture

T-H. Hubert Chan and Kai-Min Chung and Wei-Kai Lin and Elaine Shi

Abstract: Massively Parallel Computation (MPC) is a model of computation widely believed to best capture realistic parallel computing architectures such as large-scale MapReduce and Hadoop clusters. Motivated by the fact that many data analytics tasks performed on these platforms involve sensitive user data, we initiate the theoretical exploration of how to leverage MPC architectures to enable efficient, privacy-preserving computation over massive data. Clearly if a computation task does not lend itself to an efficient implementation on MPC even without security, then we cannot hope to compute it efficiently on MPC with security. We show, on the other hand, that any task that can be efficiently computed on MPC can also be securely computed with comparable efficiency. Specifically, we show the following results: any MPC algorithm can be compiled to a communication-oblivious counterpart while asymp- totically preserving its round and space complexity, where communication-obliviousness ensures that any network intermediary observing the communication patterns learn no information about the secret inputs; assuming the existence of Fully Homomorphic Encryption with a suitable notion of compact- ness and other standard cryptographic assumptions, any MPC algorithm can be compiled to a secure counterpart that defends against an adversary who controls not only intermediate network routers but additionally up to 1/3 − η fraction of machines (for an arbitrarily small constant η) moreover, this compilation preserves the round complexity tightly, and preserves the space complexity upto a multiplicative security parameter related blowup. As an initial exploration of this important direction, our work suggests new definitions and proposes novel protocols that blend algorithmic and cryptographic techniques.

Category / Keywords: foundations / Massively Parallel Computation, Multi-Party Computation

Original Publication (with minor differences): ITCS 2020

Date: received 22 Feb 2020

Contact author: runting at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20200225:203226 (All versions of this report)

Short URL: ia.cr/2020/240


[ Cryptology ePrint archive ]