Probability of Shares in Secret Sharing Schemes

Abstract A secret sharing scheme is a protocol to share a secret s among a set P of participants in such a way that only qualified subsets, pooling together their information, can reconstruct the secret s , but subsets of participants that are not enabled to recover the secret have no information on it. In this paper we analyze the sample space of shares for any set of participants. In particular, we prove tight bounds on the probability of shares and on the size of the space of shares in terms of the size of the secret set.

[1]  Douglas R. Stinson,et al.  On the Dealer's Randomness Required in Secret Sharing Schemes , 1994, EUROCRYPT.

[2]  Douglas R. Stinson,et al.  An explication of secret sharing schemes , 1992, Des. Codes Cryptogr..

[3]  G. R. BLAKLEY.  Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[4]  Alfredo De Santis,et al.  On Secret Sharing Schemes , 1998, Inf. Process. Lett..

[5]  Alfredo De Santis,et al.  Randomness in Distribution Protocols , 1996, Inf. Comput..

[6]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[7]  Ehud D. Karnin,et al.  On secret sharing systems , 1983, IEEE Trans. Inf. Theory.

[8]  Josh Benaloh,et al.  Generalized Secret Sharing and Monotone Functions , 1990, CRYPTO.

[9]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[10]  Mitsuru Ito,et al.  Secret sharing scheme realizing general access structure , 1989 .