Title :
Secret sharing in graph-based prohibited structures
Author :
Sun, Hung-Min ; Shieh, Shiuh-Pyng
Author_Institution :
Dept. of Inf. Manage., Chaoyang Inst. of Technol., Taiwan
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 obtain 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 denotes 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
Keywords :
cryptography; graph theory; edge; graph-based prohibited structures; information rate; master key; pre-specified participant subsets; secret sharing; vertex; Chaos; Computer science; Councils; Cryptography; Indium tin oxide; Information management; Information rates; Performance analysis; Sun;
Conference_Titel :
INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution., Proceedings IEEE
Conference_Location :
Kobe
Print_ISBN :
0-8186-7780-5
DOI :
10.1109/INFCOM.1997.644525
