Title :
Decomposition constructions for secret-sharing schemes
Author_Institution :
Dept. of Comput. Sci. & Eng., Nebraska Univ., Lincoln, NE, USA
fDate :
1/1/1994 12:00:00 AM
Abstract :
The paper describes a very powerful decomposition construction for perfect secret-sharing schemes. The author gives several applications of the construction and improves previous results by showing that for any graph G of maximum degree d, there is a perfect secret-sharing scheme for G with information rate 2/(d+1). As a corollary, the maximum information rate of secret-sharing schemes for paths on more than three vertices and for cycles on more than four vertices is shown to be 2/3
Keywords :
channel capacity; cryptography; graph theory; linear programming; decomposition construction; graph; information rate; secret-sharing schemes; Computer science; Cryptography; Information rates; Information science; Mathematical model; Security; Terminology;
Journal_Title :
Information Theory, IEEE Transactions on
