计算机工程与应用2012，Vol.48Issue(14)：112-116,225,6.DOI:10.3778/j.issn.1002-8331.2012.14.024
参与者人数为八的一类图存取结构的信息率
Information rate of a type of access structures based on graphs on eight participants
摘要
Abstract
Through transforming the access structures on eight participants to a total of 110 connected graphs on eight vertices, the paper studies the optimal information rate and the construction of perfect secret sharing schemes corresponding to these access structures are given in terms of the relationship between certain access structures and connected graphs. The exact values for the optimal information rate of the 101 access structures are computed and the relevant construction of perfect secret sharing schemes is discussed. At the same time, the upper and lower bounds for the information rate of other 9 access structures are computed and the upper bound on the information rate of connected graphs on eight vertices is proved.关键词
秘密共享方案/完善的秘密共享方案/单调的存取结构/完全多划分图/信息率Key words
secret sharing schemes/ perfect secret sharing schemes/ monotone access structure/ complete multipartite graph/ information rate分类
信息技术与安全科学引用本文复制引用
宋云,李志慧..参与者人数为八的一类图存取结构的信息率[J].计算机工程与应用,2012,48(14):112-116,225,6.基金项目
国家自然科学基金(No.60873119) （No.60873119）
中央高校基本科研业务费专项资金(No.10871123). （No.10871123）
