Contact Project Developer Ashish D. Tiwari [astiwz@gmail.com]
Download Synopsis Abstract

Optimal Coding and Allocation for Perfect Secrecy in Multiple Clouds

This paper is the first one whichconsiders the problem as a whole and derives a jointly optimalcoding and storage allocation scheme, which achieves perfectsecrecy with minimum cost
Abstract-Synopsis-Documentation

Abstract

For a user to store data in the cloud, usingservices provided by multiple cloud storage providers (CSPs)is a promising approach to increase the level of data availabilityand confidentiality, as it is unlikely that different CSPs areout of service at the same time or collude with each otherto extract information of a user. This paper investigates theproblem of storing data reliably and securely in multiple CSPsconstrained by given budgets with minimum cost. Previous works,with variations in problem formulations, typically tackle theproblem by decoupling it into sub-problems and solve themseparately. While such a decoupling approach is simple, theresultant solution is suboptimal. This paper is the first one whichconsiders the problem as a whole and derives a jointly optimalcoding and storage allocation scheme, which achieves perfectsecrecy with minimum cost. The analytical result reveals that theoptimal coding scheme is the nested maximum-distance-separablecode and the optimal amount of data to be stored in the CSPsexhibits a certain structure. The exact parameters of the codeand the exact storage amount to each CSP can be determinednumerically by simple 2-D search.

View

Comment is Only Available for registered users! Create Account or Login Now!