𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower bounds for robust secret sharing schemes

✍ Scribed by Carlo Blundo; Alfredo De Santis

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
422 KB
Volume
63
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Combinatorial lower bounds for secret sh
Combinatorial lower bounds for secret sharing schemes
✍ Kaoru Kurosawa; Koji Okada πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 286 KB

In a perfect secret sharing scheme, it holds that log, I%[ > H(S), where S denotes the secret and G denotes the set of the share of user i. On the other hand, it is well known that log213 > H(S) if S is not uniformly distributed, where ? denotes the set of secrets. In this case, log, @I > H(S) < log

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

Recursive constructions for perfect secr
Recursive constructions for perfect secret sharing schemes
✍ Hung-Min Sun; Shiuh-Pyng Shieh πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 595 KB

A secret sharing scheme is a method which allows a secret to be shared among a set of participants in such a way that only qualified subsets of participants can recover the secret. A secret sharing scheme is called perfect if unqualified subsets of participants obtain no information regarding the se

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 extended construction method for visu
An extended construction method for visual secret sharing schemes
✍ Taku Katoh; Hideki Imai πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 348 KB

A visual secret sharing scheme permits a secret to be shared among participants using transparencies. In this paper, we consider an extended scheme for visual secret sharing. We propose an improved method of constructing the visual secret sharing scheme that can conceal some images in a series of t