A note on secret sharing schemes with three homogeneous access structure☆
References (14)
- et al.
Tight bounds on the information rate of secret sharing schemes
Des. Codes Cryptogr.
(1997) - et al.
On the information rate of secret sharing schemes
- et al.
Graph decompositions and secret sharing schemes
J. Cryptology
(1995) Some ideal secret sharing schemes
J. Combin. Math. Combin. Comput.
(1989)- et al.
On the classification of ideal secret sharing schemes
J. Cryptology
(1991) - et al.
Some improved bounds on the information rate of perfect secret sharing schemes
J. Cryptology
(1992) - et al.
On the size of shares of secret sharing schemes
J. Cryptology
(1993)
There are more references available in the full text version of this article.
Cited by (9)
Ideal Secret Sharing Schemes on Graph-Based 3-Homogeneous Access Structures
2021, Transactions on CombinatoricsSurvey and analysis of visual secret sharing techniques
2014, International Review on Computers and SoftwareKey management
2013, IT Policy and Ethics: Concepts, Methodologies, Tools, and Applications
- ☆
This work was partially supported by the Spanish Ministerio de Ciencia y Tecnología under project TIC 2003-00866.
Copyright © 2006 Elsevier B.V. All rights reserved.