Secret Sharing Scheme Suitable for Cloud Computing

A (t,n) secret sharing divides a secret into n shares in such a way that any t or more than t shares can reconstruct the secret; but fewer than t shares cannot reconstruct the secret. In this paper, we extend the idea of a (t,n) secret sharing scheme ...

Shamir proposed the first (t, n) threshold secret sharing scheme. Shamir's scheme is ideal and perfect. In this paper, we propose two modifications of Shamir's secret sharing scheme. In our first modification, each shareholder keeps both $x$-coordinate ...

In Shamir's (t, n) threshold secret sharing scheme, one secret s is divided into n shares by a dealer and all shares are shared among n shareholders, such that knowing t or more than t shares can reconstruct this secret; but knowing fewer than t shares ...