NDLI: GraphSC: Parallel Secure Computation Made Easy

Content Provider	IEEE Xplore Digital Library
Author	Nayak, K. Xiao Shaun Wang Ioannidis, S. Weinsberg, U. Taft, N. Shi, E.
Copyright Year	2015
Abstract	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.
Starting Page	377
Ending Page	394
File Size	544465
Page Count	18
File Format	PDF
ISBN	9781467369497
ISSN	10816011
DOI	10.1109/SP.2015.30
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-05-17
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Programming Parallel processing Computational modeling Data mining Clustering algorithms Machine learning algorithms parallel algorithms secure computation oblivious algorithms graph algorithms
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

GraphSC: Parallel Secure Computation Made Easy

GraphSC: Parallel Secure Computation Made Easy (2015)

Lonestar: A suite of parallel irregular programs

A Unifying Programming Model for Parallel Graph Algorithms

A machine independent approach to parallel algorithm design on image computation

Exploring Computation Locality of Graph Mining Algorithms on MapReduce

Data-oblivious graph algorithms for secure computation and outsourcing

MatrixMap: Programming Abstraction and Implementation of Matrix Computation for Big Data Applications

Design and evaluation of a parallel HOP clustering algorithm for cosmological simulation

GraphSC: Parallel Secure Computation Made Easy

Similar Documents

GraphSC: Parallel Secure Computation Made Easy

GraphSC: Parallel Secure Computation Made Easy (2015)

Lonestar: A suite of parallel irregular programs

A Unifying Programming Model for Parallel Graph Algorithms

A machine independent approach to parallel algorithm design on image computation

Exploring Computation Locality of Graph Mining Algorithms on MapReduce

Data-oblivious graph algorithms for secure computation and outsourcing

MatrixMap: Programming Abstraction and Implementation of Matrix Computation for Big Data Applications

Design and evaluation of a parallel HOP clustering algorithm for cosmological simulation

GraphSC: Parallel Secure Computation Made Easy