𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some democratic secret sharing schemes

✍ Scribed by Marco Carpentieri

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
377 KB
Volume
59
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On secret sharing schemes
On secret sharing schemes
✍ Carlo Blundo; Alfredo De Santis; Ugo Vaccaro πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 629 KB
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

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