Secure Secret Sharing With Adaptive Bandwidth in Distributed Cloud Storage Systems

The development of cloud storage technology has brought us great convenience that we can store data in remote servers and access it on any connected device. However, the frequent leakage of private data has brought more and more attention to the protection of private data. To solve related problems, the distributed storage schemes have been proposed. Considering security and fault tolerance, many of those schemes adopt threshold secret sharing techniques which are wildly used in distributed storage systems with disaster tolerance function. Nevertheless, in practical situations, the bandwidth between users and different servers may be unbalanced or even unfixed, which leads to low communication efficiency of the schemes when adopting original secret sharing. To obtain higher communication efficiency under different communication loads, we proposed a novel adaptive bandwidth secret sharing scheme in distribution cloud storage systems. In addition, we consider the scenario in which we use Shamir’s secret sharing scheme and Staircase codes respectively in order to improve the applicability of the adaptive bandwidth scheme. We make the comparative of performance analysis to show the advantages and disadvantages of these two schemes. In general, compared with the non-adaptive schemes, the proposed adaptive bandwidth scheme can make full use of unbalanced bandwidth and achieve higher average communication rate when the upper bound of bandwidth is large enough.

[1]  R. J. McEliece,et al.  On sharing secrets and Reed-Solomon codes , 1981, CACM.

[2]  James S. Plank,et al.  AONT-RS: Blending Security and Performance in Dispersed Storage Systems , 2011, FAST.

[3]  Kristin E. Lauter,et al.  Cryptographic Cloud Storage , 2010, Financial Cryptography Workshops.

[4]  Yongge Wang,et al.  Privacy-Preserving Data Storage in Cloud Using Array BP-XOR Codes , 2015, IEEE Transactions on Cloud Computing.

[5]  Miguel Correia,et al.  SCFS: A Shared Cloud-backed File System , 2014, USENIX Annual Technical Conference.

[6]  Oliver W. Gnilke,et al.  Private Information Retrieval From MDS Coded Data in Distributed Storage Systems , 2018, IEEE Transactions on Information Theory.

[7]  Wentao Huang,et al.  Communication Efficient Secret Sharing , 2015, IEEE Transactions on Information Theory.

[8]  Miguel Correia,et al.  DepSky: Dependable and Secure Storage in a Cloud-of-Clouds , 2013, TOS.

[9]  Salim El Rouayheb,et al.  Staircase codes for secret sharing with optimal communication and read overheads , 2015, 2016 IEEE International Symposium on Information Theory (ISIT).

[10]  John C. S. Lui,et al.  Optimal recovery of single disk failure in RDP code storage systems , 2010, SIGMETRICS '10.

[11]  Ethan L. Miller,et al.  POTSHARDS—a secure, recoverable, long-term archival storage system , 2009, TOS.

[12]  Xiaoqi Jia,et al.  Efficient Ideal Threshold Secret Sharing Schemes Based on EXCLUSIVE-OR Operations , 2010, 2010 Fourth International Conference on Network and System Security.

[13]  Valerio Schiavoni,et al.  A Performance Evaluation of Erasure Coding Libraries for Cloud-Based Data Stores - (Practical Experience Report) , 2016, DAIS.

[14]  Lidan Wang,et al.  Secure distributed estimation against false data injection attack , 2020, Inf. Sci..

[15]  G. R. Blakley,et al.  Safeguarding cryptographic keys , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[16]  Wentao Huang,et al.  Secure RAID schemes for distributed storage , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[17]  Koushik Kar,et al.  MPLOT: A Transport Protocol Exploiting Multipath Diversity Using Erasure Codes , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[18]  Subhash C. Kak,et al.  Space efficient secret sharing for implicit data security , 2011, Inf. Sci..

[19]  Kannan Ramchandran,et al.  A Piggybacking Design Framework for Read-and Download-Efficient Distributed Storage Codes , 2017, IEEE Transactions on Information Theory.

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

[21]  Satoshi Takahashi,et al.  Secret Sharing Scheme Suitable for Cloud Computing , 2013, 2013 IEEE 27th International Conference on Advanced Information Networking and Applications (AINA).

[22]  Xiaodan Shao,et al.  Broken-motifs diffusion LMS algorithm for reducing communication load , 2017, Signal Process..

[23]  Shukai Duan,et al.  Diffusion least logarithmic absolute difference algorithm for distributed estimation , 2018, Signal Process..

[24]  Nihar B. Shah,et al.  Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction , 2010, IEEE Transactions on Information Theory.

[25]  Jehoshua Bruck,et al.  Zigzag Codes: MDS Array Codes With Optimal Rebuilding , 2011, IEEE Transactions on Information Theory.

[26]  Sriram Vishwanath,et al.  Secure Cooperative Regenerating Codes for Distributed Storage Systems , 2012, IEEE Transactions on Information Theory.

[27]  Kannan Ramchandran,et al.  A Solution to the Network Challenges of Data Recovery in Erasure-coded Distributed Storage Systems: A Study on the Facebook Warehouse Cluster , 2013, HotStorage.

[28]  Darrell D. E. Long,et al.  Strong Security for Network-Attached Storage , 2002, FAST.

[29]  Sriram Vishwanath,et al.  Optimal Locally Repairable and Secure Codes for Distributed Storage Systems , 2012, IEEE Transactions on Information Theory.

[30]  Amos Beimel,et al.  Secret-Sharing Schemes: A Survey , 2011, IWCC.

[31]  Jie Li,et al.  A generic transformation for optimal repair bandwidth and rebuilding access in MDS codes , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[32]  R. Michael Buehrer,et al.  Toward Optimal Secure Distributed Storage Systems With Exact Repair , 2016, IEEE Transactions on Information Theory.

[33]  Eitan Yaakobi,et al.  How to Best Share a Big Secret , 2018, SYSTOR.

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

[35]  Yunnan Wu,et al.  A Survey on Network Codes for Distributed Storage , 2010, Proceedings of the IEEE.

[36]  Parimal Parag,et al.  Minimizing latency for secure distributed computing , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[37]  Ashish Gupta,et al.  The RAMCloud Storage System , 2015, ACM Trans. Comput. Syst..