Skip to main content

GraphSC: Parallel secure computation made easy

Publication ,  Conference
Nayak, K; Wang, XS; Ioannidis, S; Weinsberg, U; Taft, N; Shi, E
Published in: Proceedings - IEEE Symposium on Security and Privacy
July 17, 2015

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.

Duke Scholars

Altmetric Attention Stats
Dimensions Citation Stats

Published In

Proceedings - IEEE Symposium on Security and Privacy

DOI

ISSN

1081-6011

ISBN

9781467369497

Publication Date

July 17, 2015

Volume

2015-July

Start / End Page

377 / 394
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Nayak, K., Wang, X. S., Ioannidis, S., Weinsberg, U., Taft, N., & Shi, E. (2015). GraphSC: Parallel secure computation made easy. In Proceedings - IEEE Symposium on Security and Privacy (Vol. 2015-July, pp. 377–394). https://doi.org/10.1109/SP.2015.30
Nayak, K., X. S. Wang, S. Ioannidis, U. Weinsberg, N. Taft, and E. Shi. “GraphSC: Parallel secure computation made easy.” In Proceedings - IEEE Symposium on Security and Privacy, 2015-July:377–94, 2015. https://doi.org/10.1109/SP.2015.30.
Nayak K, Wang XS, Ioannidis S, Weinsberg U, Taft N, Shi E. GraphSC: Parallel secure computation made easy. In: Proceedings - IEEE Symposium on Security and Privacy. 2015. p. 377–94.
Nayak, K., et al. “GraphSC: Parallel secure computation made easy.” Proceedings - IEEE Symposium on Security and Privacy, vol. 2015-July, 2015, pp. 377–94. Scopus, doi:10.1109/SP.2015.30.
Nayak K, Wang XS, Ioannidis S, Weinsberg U, Taft N, Shi E. GraphSC: Parallel secure computation made easy. Proceedings - IEEE Symposium on Security and Privacy. 2015. p. 377–394.

Published In

Proceedings - IEEE Symposium on Security and Privacy

DOI

ISSN

1081-6011

ISBN

9781467369497

Publication Date

July 17, 2015

Volume

2015-July

Start / End Page

377 / 394