Paper 2014/404

Large-Scale Secure Computation

Elette Boyle, 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.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint. MINOR revision.
Keywords
secure computationbig data
Contact author(s)
eboyle @ alum mit edu
History
2014-06-02: received
Short URL
https://ia.cr/2014/404
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2014/404,
      author = {Elette Boyle and Kai-Min Chung and Rafael Pass},
      title = {Large-Scale Secure Computation},
      howpublished = {Cryptology ePrint Archive, Paper 2014/404},
      year = {2014},
      note = {\url{https://eprint.iacr.org/2014/404}},
      url = {https://eprint.iacr.org/2014/404}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.