Tight Bounds on the Information Rate of Secret Sharing Schemes
β Scribed by Carlo Blundo; Alfredo De Santis; Roberto De Simone; Ugo Vaccaro
- Book ID
- 110260294
- Publisher
- Springer
- Year
- 1997
- Tongue
- English
- Weight
- 701 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0925-1022
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We present some new lower bounds on the optimal information rate and on the optimal average information rate of secret sharing schemes with homogeneous access structure. These bounds are found by using some covering constructions and a new parameter, the k-degree of a participant, that is introduced
In a secret sharing scheme a dealer has a secret key. There is a finite set P of participants and a set F of subsets of P. A secret sharing scheme with F as the access structure is a method which the dealer can use to distribute shares to each participant so that a subset of participants can determi
AbstracL A secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of participants can recover the secret, but any nonqualified subset has absolutely no information on the secret. The set of all qualified subsets defines the access structure t