𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the classification of ideal secret sharing schemes

✍ Scribed by Ernest F. Brickell; Daniel M. Davenport

Publisher
Springer
Year
1991
Tongue
English
Weight
693 KB
Volume
4
Category
Article
ISSN
0933-2790

No coin nor oath required. For personal study only.

✦ Synopsis

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 determine the key if and only if that subset is in F. The share of a participant is the information sent by the dealer in private to the participant. A secret sharing scheme is ideal if any subset of participants who can use their shares to determine any information about the key can in fact actually determine the key, and if the set of possible shares is the same as the set of possible keys. In this paper we show a relationship between ideal secret sharing schemes and matroids.

πŸ“œ SIMILAR VOLUMES

On secret sharing schemes
On secret sharing schemes
✍ Carlo Blundo; Alfredo De Santis; Ugo Vaccaro πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 629 KB
On the size of shares for secret sharing
On the size of shares for secret sharing schemes
✍ R. M. Capocelli; A. De Santis; L. Gargano; U. Vaccaro πŸ“‚ Article πŸ“… 1993 πŸ› Springer 🌐 English βš– 574 KB

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

Generation of Key Predistribution Scheme
Generation of Key Predistribution Schemes using Secret Sharing Schemes
✍ GermΓ‘n SΓ‘ez πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 532 KB

In a key predistribution scheme a trusted authority distributes pieces of information among a set of users in such a way that speci ed privileged subsets of users can compute a secret key individually. In such a scheme, a family of forbidden subsets of users cannot obtain any information about the v

Lower bounds on the information rate of
Lower bounds on the information rate of secret sharing schemes with homogeneous access structure
✍ Carles PadrΓ³; GermΓ‘n SΓ‘ez πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 81 KB

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

An efficient multi-use multi-secret shar
An efficient multi-use multi-secret sharing scheme based on hash function
✍ Angsuman Das; Avishek Adhikari πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 244 KB

In this work, a renewable, multi-use, multi-secret sharing scheme for general access structure based on the one-way collision resistant hash function is presented in which each participant has to carry only one share. As it applies the collision resistant oneway hash function, the proposed scheme is