On identification secret sharing schemes
Information and Computation
Secret image sharing with smaller shadow images
Pattern Recognition Letters
A note on secret sharing schemes with three homogeneous access structure
Information Processing Letters
A novel secret image sharing scheme in color images using small shadow images
Information Sciences: an International Journal
Hypergraph decomposition and secret sharing
Discrete Applied Mathematics
Secret sharing schemes on access structures with intersection number equal to one
Discrete Applied Mathematics
Complexity of universal access structures
Information Processing Letters
Finding lower bounds on the complexity of secret sharing schemes by linear programming
Discrete Applied Mathematics
Information Sciences: an International Journal
| Hi-index | 754.84 |
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