Distributed Storage based on Secret Sharing Schemes (D4S)

Distributed Storage based on Secret Sharing Schemes

In cryptography, secret sharing means a technique for sharing a secret to a group of members, each of which holds a portion of the secret. The secret can only be retrieved when a certain number of members combine their shares together, while any combination with fewer than shares has no extra information about the secret than 0 shares. In this paper, the development of secret sharing schemes is reviewed and the basic algorithm is introduced in details. Moreover, the secret sharing schemes is applied to study the secret image sharing problem. By using the Shamir threshold scheme, an image is split into n small shadow images. With any combination of t shadow images (t<=n), the original image will be recovered.