Abstract
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.
Highlights
In recent years, with the rise of cloud computing and software-as-a-service, cloud storage has become a research hotspot in the field of information storage [1]–[3]
In this paper, we investigate the problem of adaptive bandwidth of secret sharing in distributed cloud storage systems
We propose a novel adaptive bandwidth scheme which can be constructed from Shamir’s secret sharing scheme or Staircase codes
Summary
With the rise of cloud computing and software-as-a-service, cloud storage has become a research hotspot in the field of information storage [1]–[3]. We will introduce the generation of bandwidth matrix as follows: 1) BANDWIDTH MATRIX OF SHAMIR’s SCHEME In order to obtain the combination of sub-secrets, we let the matrix MB of m × n dimension constructed from 0’s and 1’s denote the matrix of bandwidth, where each row contains k 1’s, and the sum of each column equals to the bandwidth from the corresponding server to the user. Compared with the time complexity of the non-adaptive scheme to recover the secret process, for example, that of non-adaptive Shamir’s scheme is (k2) (Lagrangian interpolation), that of non-adaptive Staircase codes is O(n3) (mainly calculated as multidimensional matrix inversion), the time complexity of constructing bandwidth matrix is trivial
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
