# Is there a secret sharing scheme which allows sharing of a secret (one-out-of-n)

Is there a secret sharing scheme where the knowledge of just one share is sufficient to find the secret, in other words a (one-out-of-n) sharing scheme ? Plz I need to know if it is possible to make such operation with secter sharing

-
I'm curious, could you give an example of when such a scheme would be of any practical use? –  mikeazo Nov 1 '11 at 19:08

Assuming each participant $i$ has a key-pair $(x_i,y_i)$ for an asymmetric encryption scheme (with $x_i$ being the private and $y_i$ the public key), you can divide your secret as

$$S_i := \operatorname{Enc}(y_i, S).$$

Then each participant can retrieve the secret as

$$S = \operatorname{Dec}(x_i, S_i).$$

Of course, simply giving each participant $S$ fulfills the same purpose.

-
this is a Good Idea –  Hamouid Nov 1 '11 at 19:22