Cryptology ePrint Archive: Report 2014/404

Large-Scale Secure Computation

Elette Boyle and Kai-Min Chung and Rafael Pass

Abstract: We are interested in secure computation protocols in settings where the number of parties is huge and their data even larger. Assuming the existence of a single-use broadcast channel (per player), we demonstrate statistically secure computation protocols for computing (multiple) arbitrary dynamic RAM programs over parties' inputs, handling (1/3-eps) fraction static corruptions, while preserving up to polylogarithmic factors the computation and memory complexities of the RAM program. Additionally, our protocol is load balanced and has polylogarithmic communication locality.

Category / Keywords: cryptographic protocols / secure computation, big data

Date: received 31 May 2014, last revised 31 May 2014

Contact author: eboyle at alum mit edu

Available format(s): PDF | BibTeX Citation

Version: 20140602:071125 (All versions of this report)

Short URL: ia.cr/2014/404

Discussion forum: Show discussion | Start new discussion