摘要： 改进基于图的秘密共享方案，提出一种基于平面的通用访问结构秘密共享方案。判断图中3个参与者之间是否存在两两的边关联，若存在则参与者的集合属于禁止结构，无法恢复主秘密，否则其集合属于访问结构，可恢复主秘密。分析结果表明，该方案比现有方案具有更高安全性、更小存储开销。

关键词: 平面, 秘密共享, 访问结构, 禁止结构, 混合结构

Abstract: This paper proposes a plane-based general access structure for secret sharing scheme, which improves the graph-based secret sharing scheme. In a graph, if any two participants in a set of three participants contain an edge in the graph, the set of the three participants belongs to prohibited structure, which can not recover the master key. Otherwise, it belongs to access structure, which can recover the master key. The analysis results show that compared with existing schemes, this scheme needs less storage spending and has higher security.

Key words: plane, secret sharing, access structure, prohibited structure, mixed structure

中图分类号: 

• TP309