𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generation of Key Predistribution Schemes using Secret Sharing Schemes

✍ Scribed by Germán Sáez

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
532 KB
Volume
6
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

✦ Synopsis

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 value of the secret. In this paper we present a new construction of a key predistribution scheme using a family of vector space secret sharing schemes. The set of privileged users and the family of forbidden subsets is described in terms of the family of vector space access structures. A generalization using linear secret sharing schemes is given. We s h o w t h a t a particular case of this construction is any k ey predistribution scheme in which pieces of information and secrets are linear combination of random numbers.Using this result we show explicitly that the most important k ey predistribution schemes can be seen as a particular case of this construction. For this construction, the question of when given secrets can be predistributed is discussed.

📜 SIMILAR VOLUMES

On the classification of ideal secret sh
On the classification of ideal secret sharing schemes
✍ Ernest F. Brickell; Daniel M. Davenport 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 693 KB

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

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

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