用图实现的通用攻击结构的高效秘密共享方案  

An efficient secret sharing scheme for graph-based generalized adversary structure

作　　者：许静芳[1] 马晓普[1] 崔国华[1] 程琦[2] 

机构地区：[1]华中科技大学计算机科学与技术学院,湖北武汉430074 [2]武汉数字工程研究所,湖北武汉430074

出　　处：《华中科技大学学报（自然科学版）》2010年第1期43-46,共4页Journal of Huazhong University of Science and Technology(Natural Science Edition)

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

摘　　要：构造了一种用图实现的通用攻击结构的高效秘密共享方案,图中每个顶点对应一个参与者,最大攻击结构中的每个非授权集对应图中的一个着色完全子图.该方案满足完善秘密共享所要求的秘密重构和完善保密特性,并给出了完善保密性的证明过程.该方案适用于任意一个攻击结构,而已有的方案仅适用于特殊的攻击结构;同时,对于同一个结构而言,该方案具有更高的计算性能和存储性能.Guo方案成为该方案的一种特殊情况.An efficient secret sharing scheme was propsposed to realize generalized adversary structures by graph, in which a vertex denotes a participant and a colored complete subgraph corresponds to an unauthorized subset of participants in the maximal adversary structure. A major advantage of this scheme is that it is perfect and applies to any adversary structure, rather than only structures representable as previous graphs. For a given access structure, the scheme requires less computational costs and storage overhead than that of existing ones. Guo scheme becomes a special case of this scheme and the corrected security proof of was given.

关 键 词：密码学 秘密共享方案 数据安全 通用攻击结构 完全子图 

分 类 号：TN918.1[电子电信—通信与信息系统]