一类完善秘密共享方案的最优信息率  

Optimal Information Rate of a Type of Perfect Secret Sharing Schemes

作　　者：宋云[1] 李志慧[1] 

机构地区：[1]陕西师范大学数学与信息科学学院,西安710062

出　　处：《计算机工程》2012年第12期9-12,16,共5页Computer Engineering

基　　金：国家自然科学基金资助项目(10571112)

摘　　要：研究参与者人数为7的一类存取结构的完善秘密共享方案及其最优信息率。利用存取结构与连通图之间的关系,给出其对应的111种图存取结构。对其中的91种图存取结构计算它们最优信息率的精确值,并讨论达到此信息率的秘密共享方案的具体构造方法。对余下20种图存取结构给出最优信息率的上下界,并从理论上证明,满足一定条件且顶点数为7信息率的上界为3/5。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.

关 键 词：完善秘密共享方案 单调的存取结构 完全多划分图 信息率 完全多划分覆盖 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]