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.

Abstract licence: CC BY-NC-ND

40 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.