Welcome to the InfoSci Platform
Reference Hub3
Privacy Preserving and Efficient Outsourcing Algorithm to Public Cloud: A Case of Statistical Analysis

Privacy Preserving and Efficient Outsourcing Algorithm to Public Cloud: A Case of Statistical Analysis

Malay Kumar, Manu Vardhan
Copyright: © 2018 |Volume: 12 |Issue: 2 |Pages: 25
ISSN: 1930-1650|EISSN: 1930-1669|EISBN13: 9781522543077|DOI: 10.4018/IJISP.2018040101
Cite Article Cite Article

MLA

Kumar, Malay, and Manu Vardhan. "Privacy Preserving and Efficient Outsourcing Algorithm to Public Cloud: A Case of Statistical Analysis." IJISP vol.12, no.2 2018: pp.1-25. http://doi.org/10.4018/IJISP.2018040101

APA

Kumar, M. & Vardhan, M. (2018). Privacy Preserving and Efficient Outsourcing Algorithm to Public Cloud: A Case of Statistical Analysis. International Journal of Information Security and Privacy (IJISP), 12(2), 1-25. http://doi.org/10.4018/IJISP.2018040101

Chicago

Kumar, Malay, and Manu Vardhan. "Privacy Preserving and Efficient Outsourcing Algorithm to Public Cloud: A Case of Statistical Analysis," International Journal of Information Security and Privacy (IJISP) 12, no.2: 1-25. http://doi.org/10.4018/IJISP.2018040101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The growth of the cloud computing services and its proliferation in business and academia has triggered enormous opportunities for computation in third-party data management settings. This computing model allows the client to outsource their large computations to cloud data centers, where the cloud server conducts the computation on their behalf. But data privacy and computational integrity are the biggest concern for the client. In this article, the authors attempt to present an algorithm for secure outsourcing of a covariance matrix, which is the basic building block for many automatic classification systems. The algorithm first performs some efficient transformation to protect the privacy and verify the computed result produced by the cloud server. Further, an analytical and experimental analysis shows that the algorithm is simultaneously meeting the design goals of privacy, verifiability and efficiency. Also, found that the proposed algorithm is about 7.8276 times more efficient than the direct implementation.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.