✦ LIBER ✦

Recursive constructions for perfect secret sharing schemes

✍ Scribed by Hung-Min Sun; Shiuh-Pyng Shieh

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 595 KB
Volume: 37
Category: Article
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(99)00049-8

No coin nor oath required. For personal study only.

✦ Synopsis

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 secret. The information rate of a secret sharing scheme is defined to be the ratio between the size of secret and the maximum size of the shares. In this paper, we propose some recursive constructions for perfect secret sharing schemes with access structures of constant rank. Compared with the best previous constructions, our constructions have some improved lower bounds on the information rate.

📜 SIMILAR VOLUMES

Some recursive constructions for perfect

Some recursive constructions for perfect hash families

✍ M. Atici; S. S. Magliveras; D. R. Stinson; W.-D. Wei 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 452 KB

An (n, m, w)-perfect hash family is a set of functions F such that f : (1

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

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 for robust secret sharing s

Lower bounds for robust secret sharing schemes

✍ Carlo Blundo; Alfredo De Santis 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 422 KB

Secret sharing schemes for graph-based p

Secret sharing schemes for graph-based prohibited structures

✍ Hung-Min Sun; Shiuh-Pyng Shieh 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 636 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