摘要
首先指出从Ｓｈａｎｎｏｎ信息论出发给出的（ｋ，ｎ）门限通信密钥分散保管系统（简称（ｋ，ｎ）门限方案）定义并不十分完美，这会将一些有价值的门限方案排除在定义之外．为了便于评价一个（ｋ，ｎ）门限方案的好坏，给出了（ｋ，ｎ）门限方案的新定义，并且讨论了很多方案的性能优劣以及它们之间的联系．对任意一个（ｋ，ｎ）门限方案，给出了使它具有查验身份功能的一般方法．此外。
The definition of (k,n) threshold communication secret sharing systems (denoted by (k,n) TCSSS for short) is first studied. It is pointed out that the definition is not very good since it may exclude some very valuable schemes. A new definition of (k,n) TCSSS is given. This new definition can be conveniently used to evaluate any sheme of (k,n)TCSSS. Many shemes of (k,n) TCSSS that were given in recent years are discussed, and their relationships are proposed in this paper. In order to identify the legality of the persons who grasp the subcryptographic key, a general method is presented, which can be conveniently used. In the end, the multiple assignment scheme is simply considered for sharing secret.
出处
《北京邮电大学学报》
EI
CAS
CSCD
1996年第3期44-52,共9页
Journal of Beijing University of Posts and Telecommunications
基金
国家自然科学基金
关键词
密码学
通信密钥
密钥管理
cryptography
communication secret key
secret key management
