计算机应用研究2013，Vol.30Issue(7)：2115-2119,2131,6.DOI:10.3969/j.issn.1001-3695.2013.07.049
一类超图存取结构的秘密共享方案的信息率
Information rate of secret sharing schemes of type of access structures based on hypergraphs
摘要
Abstract
This paper studied the realization and optimal information rate of perfect secret sharing schemes of a type of access structures on six participants.It gave the 95 connected hypergraphs corresponding to these access structures,which were based on the relationship between these access structures and their connected hypergraphs.It computed the exact values for the optimal information rate of 57 access structures based on hypergraphs by using ideal hyperstar judgment theorem and other methods,and discussed the constructions for relevant secret sharing schemes.At the same time,it gave the upper and lower bounds on the information rate of other 38 access structures based on hypergraphs by using A-decomposition method and so on.And the hyperstar and hyperpath with n vertices and r ranks have at most n-r + 1 edges.And it theoretically proves that the optimal information rate of the hypergraph with reducible vertex is equal to 1.关键词
秘密共享/存取结构/完全多划分图/超图/超图存取结构/最优信息率Key words
secret sharing/access structure/complete multipartite graph/hypergraph/hypergraph access structure/optimal information rate分类
信息技术与安全科学引用本文复制引用
杨丽杰,李志慧,李婧..一类超图存取结构的秘密共享方案的信息率[J].计算机应用研究,2013,30(7):2115-2119,2131,6.基金项目
国家自然科学基金资助项目(11271237) （11271237）
陕西师范大学研究生创新基金资助目(2012CXS037) （2012CXS037）
