IEEE Transactions on Information Theory · 1994 · 190 citations · 9 references
ComputingComputer ScienceMathematicsAlgorithmsCryptographyInformation TheoryGraph AlgorithmsGraph TheoryInformation-theoretic CryptographySecret SharingPerfect Secret SharingSecret Sharing Schemes
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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
9
Adi Shamir · Communications of the ACM · 1979 · 13.5K citations · Full text
An explication of secret sharing schemes
Douglas R. Stinson · Designs Codes and Cryptography · 1992 · 401 citations