GraphSC: Parallel secure computation made easy

Conference Paper

We propose introducing modern parallel programming paradigms to secure computation, enabling their secure execution on large datasets. To address this challenge, we present Graph SC, a framework that (i) provides a programming paradigm that allows non-cryptography experts to write secure code, (ii) brings parallelism to such secure implementations, and (iii) meets the need for obliviousness, thereby not leaking any private information. Using Graph SC, developers can efficiently implement an oblivious version of graph-based algorithms (including sophisticated data mining and machine learning algorithms) that execute in parallel with minimal communication overhead. Importantly, our secure version of graph-based algorithms incurs a small logarithmic overhead in comparison with the non-secure parallel version. We build Graph SC and demonstrate, using several algorithms as examples, that secure computation can be brought into the realm of practicality for big data analysis. Our secure matrix factorization implementation can process 1 million ratings in 13 hours, which is a multiple order-of-magnitude improvement over the only other existing attempt, which requires 3 hours to process 16K ratings.

Full Text

Duke Authors

Cited Authors

  • Nayak, K; Wang, XS; Ioannidis, S; Weinsberg, U; Taft, N; Shi, E

Published Date

  • July 17, 2015

Published In

Volume / Issue

  • 2015-July /

Start / End Page

  • 377 - 394

International Standard Serial Number (ISSN)

  • 1081-6011

International Standard Book Number 13 (ISBN-13)

  • 9781467369497

Digital Object Identifier (DOI)

  • 10.1109/SP.2015.30

Citation Source

  • Scopus