๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Secret sharing schemes for graph-based prohibited structures

โœ Scribed by Hung-Min Sun; Shiuh-Pyng Shieh

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
636 KB
Volume
36
Category
Article
ISSN
0898-1221

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

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

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