Ideal Homogeneous Access Structures Constructed from Graphs

Starting from a new relation between graphs and secret sharing schemes introduced by xiao, liu and zhang, we show a method to construct more general ideal homogeneous access structures. the method has some advantages: it efficiently gives an ideal homogeneous access structure for the desired rank, and some conditions can be imposed (such as forbidden or necessary subsets of players), even if the exact composition of the resulting access structure cannot be fully controlled. the number of homogeneous access structures that can be constructed in this way is quite limited; for example, we show that (t, (l)-threshold access structures can be constructed from a graph only when t = 1, t = (l) − 1 or t = (l).