|
|||||
|
|
| 一种基于树的秘密共享方案 | |
| 引用本文： | 何振华,单虹,高继森. 一种基于树的秘密共享方案[J]. 南华大学学报(自然科学版), 2008, 22(3): 85-88 |
| 作者姓名： | 何振华 单虹 高继森 |
| 作者单位： | 1. 兰州交通大学,电子信息工程学院,甘肃,兰州,730070;湖南交通工程职业技术学院,湖南,衡阳,421001 2. 湖南交通工程职业技术学院,湖南,衡阳,421001 3. 兰州交通大学,电子信息工程学院,甘肃,兰州,730070 |
| 摘 要： | 本文提出了一种基于树的秘密共享方案,该方案基于树的禁止结构.树中的一个节点代表一个秘密共享的参与者,树中没有父子关系的两个节点是授权子集,即树中没有父子关系的成员可以恢复主秘密,而其他成员组合不能得到主秘密的任何信息.分析表明该方案具有存储负载小、安全性高的特点. |
| 关 键 词： | 树 秘密共享 访问结构 禁止结构 |
| 收稿时间： | 2008-05-08 |
A Tree-based Scheme for Secret Sharing |
|
| HE Zhen-hu,SHAN Hong,GAO Ji-sen. A Tree-based Scheme for Secret Sharing[J]. Journal of Nanhua University(Science and Technology), 2008, 22(3): 85-88 | |
| Authors: | HE Zhen-hu SHAN Hong GAO Ji-sen |
| Affiliation: | 1.School of Electronic and Information Engineering,Lanzhou Jiaotong University,Lanzhou,Ganshu 730070 China;2.Hunan Technical College of Communications & Engineering,Hengyang,Hunan 421001,China |
| Abstract: | This paper proposes a tree-based scheme for secret sharing,which is based on the mixed structure.In the scheme,a vertex denotes a participant,and the subset includes the parent vertex and the child vertex in not less than three vertexes which are both authorized subsets,namely the subsets including two filiations participants and the subsets including not less than three participants which can both recover the master key,while other subsets cannot recover the master key and obtain no information.The analysis shows that the scheme has the properties of less storage and high safety. |
| Keywords: | |
| 本文献已被 维普 万方数据 等数据库收录！ | |
| 点击此处可从《南华大学学报(自然科学版)》浏览原始摘要信息 | |
| 点击此处可从《南华大学学报(自然科学版)》下载全文 | |