A Special Type of Hypergraph and Ideal Secret Sharing Scheme
WU Chun-yin · Jisuanji gongcheng · 2013
On the general access structures,this paper presents an ideal secret sharing scheme on a special type of hypergraphs by establishing a one-to-one correspondence between access structures and hypergraphs.The designed distribution algorithm and reconstruction algorithm are mainly based on the thought of vector space construction and(t,t) threshold scheme.Find the longest path in the given acyclic hypergraphs,increase the number of vertex in 2-regions,add the ears onto the hypergraphs,and finish the construction of the scheme.Meanwhile,the information rate of the scheme can reach its maximum 1.