Study on cloudy storage model based on secret sharing

Study on cloudy storage model based on secret sharing

Fan Quanlong, East China University of Technology

This paper uses the idea of an independent redundant disk array to store a piece of data in multiple cloud storage providers to solve the problem of using a single cloud storage provider. At present, most of the cloudy storage models use the reed Solomon algorithm to partition data to improve the redundancy of data. However, the data obtained by the algorithm are displayed in plaintext, so the confidentiality of the data is not guaranteed. In order to ensure the confidentiality of the data, some cloudy storage models use Shamir secret sharing algorithm. This algorithm can not only guarantee the usability, but also provide the guarantee of confidentiality. But this algorithm will bring a huge increase in storage space, resulting in increased user costs. In order to solve the above problems, based on the Shamir secret sharing algorithm, this paper puts forward a new algorithm short Secret sharing Based on Reed Solomon (sssbors), which can guarantee the redundancy of data and the confidentiality of data, Also reduces storage space. Based on the sssbors algorithm, this paper proposes a cloudy storage model Sssborsstorage, and realizes a prototype system of the model, which can effectively protect the user's data from being leaked, ensure that the user can get the service continuously, and reduce the cost of the user. This paper evaluates the performance of the system from space and time, the experiment shows that the sssbors algorithm can not only reduce the data storage space, but also reduce the response time when uploading the files, thus reducing the cost of users using multiple cloud storage providers, improving the confidentiality of the cloudy storage mode, Redundancy and availability.

Study on cloudy storage model based on secret sharing