计算机工程2012，Vol.38Issue(12)：9-12,16,5.DOI:10.3969/j.issn.1000-3428.2012.12.003
一类完善秘密共享方案的最优信息率
Optimal Information Rate of a Type of Perfect Secret Sharing Schemes
摘要
Abstract
This paper studies the optimal information rate of perfect secret sharing schemes of a type of access structures on seven participants. Based on the relationship between these access structures and their connected graphs, 111 connected graphs corresponding to these access structures are given. The exact values of the optimal information rate of 91 access structures based on graphs are computed and the secret sharing schemes attaining the optimal information rate are discussed in Table 1, where the upper and lower bounds on the information rate of the rest 20 are also calculated. The upper bound on the information rate of connected graphs on seven vertices is theoretically proved.关键词
完善秘密共享方案/单调的存取结构/完全多划分图/信息率/完全多划分覆盖Key words
perfect secret sharing scheme/ monotone access structure/ complete multipartite graph/ information rate/ complete multipartite covering分类
信息技术与安全科学引用本文复制引用
宋云,李志慧..一类完善秘密共享方案的最优信息率[J].计算机工程,2012,38(12):9-12,16,5.基金项目
国家自然科学基金资助项目(10571112) （10571112）
