Sciweavers

Share
INFOCOM
1997
IEEE

Secret Sharing in Graph-Based Prohibited Structures

9 years 2 months ago
Secret Sharing in Graph-Based Prohibited Structures
A secret sharing schemefor 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 subsetsof 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 eflcient 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.
Hung-Min Sun, Shiuh-Pyng Shieh
Added 06 Aug 2010
Updated 06 Aug 2010
Type Conference
Year 1997
Where INFOCOM
Authors Hung-Min Sun, Shiuh-Pyng Shieh
Comments (0)
books