Probability of shares in secret sharing schemes

https://doi.org/10.1016/S0020-0190(99)00153-2Get rights and content

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.

References (14)

  • C. Blundo et al.

    On secret sharing schemes

    Inform. Process. Lett.

    (1998)
  • C. Blundo et al.

    Randomness in distribution protocols

    Inform. and Comput.

    (1996)
  • J.C. Benaloh et al.

    Generalized secret sharing and monotone functions

  • G.R. Blakley

    Safeguarding cryptographic keys

  • C. Blundo et al.

    On the dealer's randomness required in secret sharing schemes

  • E.F. Brickell et al.

    On the classification of ideal secret sharing schemes

    J. Cryptology

    (1991)
  • E.F. Brickell et al.

    Improved bounds on the information rate of perfect secret sharing schemes

    J. Cryptology

    (1992)
There are more references available in the full text version of this article.

Cited by (4)

Partially supported by Italian Ministry of University and Scientific Research (M.U.R.S.T.).

View full text