Secret Sharing in Graph-Based Prohibited Structures

Authors:
Hung-Min Sun;Shiuh-Pyng Shieh
Affiliations:
-;-
Venue:
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Year:
1997

Citing 8
Cited 0

Some improved bounds on the information rate of perfect secret sharing schemes

Journal of Cryptology
Multisecret threshold schemes

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
On the information rate of perfect secret sharing schemes

Designs, Codes and Cryptography
How to share a secret

Communications of the ACM
Generalized Secret Sharing and Monotone Functions

CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
On the Size of Shares for Secret Sharing Schemes

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
New General Lower Bounds on the Information Rate of Secret Sharing Schemes

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Coding and Information Theory

Coding and Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

A secret sharing scheme for the prohibited structure is a method of sharing a master key among a finite set of participants in such a way that only certain pre-specified subsets of participants cannot recover the master key. A secret sharing scheme is called perfect if any subset of participants who cannot recover the master key obtains no information regarding the master key. In this paper, we propose an efficient construction of perfect secret sharing schemes for graph-based prohibited structures where a vertex denotes a participant and an edge does a pair of participants who cannot recover the master key. The information rate of our scheme is 2/n, where n is the number of participants.