References
- A. Beimel, T. Tassa, and E. Weinreb, Characterizing ideal weighted threshold secret sharing, SIAM J. Discrete Math. 22 (2008), pp. 360–397. doi: 10.1137/S0895480104445654
- G.R. Blakley, Safeguarding cryptographic keys, Proc. of the 1979 AFIPS National Computer Conference of AFIPS Conference proceedings, AFIPS Press 48 (1979), pp. 313–317.
- C. Blundo, A. De Santis, D.R. Stinson, and U. Vaccaro, Graph decomposition and secret sharing schemes, J. Cryptol. 8(1) (1995), pp. 39–64. doi: 10.1007/BF00204801
- C. Blundo, A. De Santis, L. Gargano, and U. Vaccaro, On the information rate of secret sharing schemes, Theoret. Comput. Sci. 154(2) (1996), pp. 283–306. doi: 10.1016/0304-3975(95)00065-8
- E.F. Brickell, Some ideal secret sharing schemes, J. Combin. Math. Combin. Comput. 6 (1989), pp. 105–113.
- E.F. Brickell and D.R. Stinson, Some improved bounds on the information rate of perfect secret sharing schemes, J. Cryptol. 5 (1992), pp. 153–166. doi: 10.1007/BF02451112
- G.J. Chang, Algorithmic aspects of domination in graphs, in Handbook of Combinatorial Optimization, Vol. 3, D.-Z. Du and P.M. Pardalos, eds., Kluwer Academic Publishers, Boston, MA, 1998, pp. 339–405.
- G. Di Crescenzo and C. Galdi, Hypergraph decomposition and secret sharing, Discrete Appl. Math. 157 (2009), pp. 928–946. doi: 10.1016/j.dam.2008.04.001
- P.A. Dreyer, Applications and variations of domination in graph, Ph.D. thesis, The State University of New Jersey, 2000.
- S. Iftene, Secret sharing schemes with applications in security protocols, Ph.D. thesis, Al. I. Cuza University of Ia'si, 2007.
- M. Ito, A. Saito, and T. Nishizeki, Secret sharing scheme realizing general access structure, Proc. IEEE Globecom ’87, 1987, pp. 99–102.
- M. Liu, L. Xiao, and Z. Zhang, Multiplicative linear secret sharing schemes based on connectivity of graphs, IEEE Trans. Inform. Theory 53 (2007), pp. 3973–3978. doi: 10.1109/TIT.2007.907505
- A. Shamir, How to share a secret, Commun. ACM 22 (1979), pp. 612–613. doi: 10.1145/359168.359176
- D.R. Stinson, New general lower bounds on the information rate of secret sharing schemes, Lecture Notes in Comput. Sci. 740 (1993), pp. 170–184.
- H. Sun and B. Chen, On the decomposition constructions for perfect secret sharing schemes, Proceeding of Information and Communication Security, ICICS’97, Beijing, China, 1997, pp. 11–14.
- H. Sun and S. Shieh, Recursive constructions for perfect secret sharing schemes, Comput. Math. Appl. 37 (1999), pp. 87–96. doi: 10.1016/S0898-1221(99)00049-8
- H. Sun and S. Shieh, Constructing perfect secret sharing schemes for general and uniform access structures, J. Inf. Sci. Eng. 15 (1999), pp. 679–689.
- H. Sun, H. Wang, B. Ku, and J. Pieprzyk, Decomposition construction for secret sharing schemes with graph access structures in polynomial time, SIAM J. Discrete Math. 24(2) (2010), pp. 617–638. doi: 10.1137/080733802
- J.M. Tarr, Domination in graphs, Master thesis, University of South Florida, 2010.