| 判定不是（k,n）门限方案的简易方法 |
| |
| 引用本文： | 岳殿武 胡正名. 判定不是（k,n）门限方案的简易方法[J]. 通信学报, 1996, 17(5): 126-131 |
| |
| 作者姓名： | 岳殿武 胡正名 |
| |
| 作者单位： | 北京邮电大学 |
| |
| 基金项目： | 国家自然科学基金资助课题 |
| |
| 摘 要： | 文献［１～４］给出了通信密钥分散管理的几个方案。而经文献［５～７］分析研究，指出这几个方案并不是（ｋ，ｎ）门限方案。本文首先给出了判定不是（ｋ，ｎ）门限方案的简易方法，然后分析这几个方案不是（ｋ，ｎ）门限方案的原因，并对这几个方案给予修改，使得它们确实是（ｋ，ｎ）门限方案。最后对［８～１０］给予讨论，指出它们存在的问题。此外还指出了其中一些方案其实是多密钥的（ｋ，ｎ）ＴＣＳＳＳ。
|
| 关 键 词： | 密码学 密钥分享 密钥管理 |
A Simple Method of Determining a Non-(k, n) TCSSS |
| |
| Yue Dianwu Hu Zhengming. A Simple Method of Determining a Non-(k, n) TCSSS[J]. Journal on Communications, 1996, 17(5): 126-131 |
| |
| Authors: | Yue Dianwu Hu Zhengming |
| |
| Abstract: | The authors of papers gave some schemes used for distributive management of communication secret keys, and considered them as satisfying with the requirements on (k,n) threshold communication secret sharing systems (denoted by (k,n) TCSSS for short). However, in the papers , Li and Wang pointed out that the schemes don't meet the requirements on (k, n) TCSSS, So the schemes aren't (k, n) TCSSS. In this paper, we give a method of determining a non-(k, n) TCSSS, which is simple and convenient, and We improve upon the schemes in order to make them meet the requiements. Lastly, we discuss some schemes in . |
| |
| Keywords: | cryptography secret sharing cryptography key management |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
