Three-level storage and nested MDS codes for perfect secrecy in multiple clouds

The problem of storing data reliably and securely in multiple cloud storage providers (CSPs) with minimum cost is investigated. A jointly optimal coding and storage allocation scheme, which achieves perfect secrecy with minimum cost, is derived. The optimal coding scheme is shown to be the nested maximum-distance-separable code and the optimal amounts of data to be stored in the CSPs is proven to exhibit a three-level structure. The exact parameters of the code and the exact storage amount to each CSP can be determined numerically by simple one-dimensional search.

[1]  Weiyi Zhang,et al.  A secured cost-effective multi-cloud storage in cloud computing , 2011, 2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[2]  Muriel Médard,et al.  Coding for Trusted Storage in Untrusted Networks , 2012, IEEE Transactions on Information Forensics and Security.

[3]  Lawrence H. Ozarow,et al.  Wire-tap channel II , 1984, AT&T Bell Lab. Tech. J..

[4]  Wen-Guey Tzeng,et al.  A Secure Erasure Code-Based Cloud Storage System with Secure Data Forwarding , 2012, IEEE Transactions on Parallel and Distributed Systems.

[5]  Krishna R. Narayanan,et al.  Weakly Secure Network Coding , 2005 .

[6]  Kannan Ramchandran,et al.  Securing Dynamic Distributed Storage Systems Against Eavesdropping and Adversarial Attacks , 2010, IEEE Transactions on Information Theory.

[7]  Adi Shamir,et al.  How to share a secret , 1979, CACM.