摘要
本文在文献[1]的基础上,进一步研究了(k,n)门限密钥管理方案与线性分组码的关系,给出了(n,k)MDS码用于构造(k,n)门限密钥管理方案的充要条件及具体方法。最后,运用(k,n)门限密钥管理方案的定义及本文结果,分析了已有的几种密钥管理办案,指出了这些方案所存在的共同问题。
In this paper, some relationships between (k, n) threshold secret sharing schemes and linear block codes are further studied, based on paper [1]. Conditions and ways are given which (n, k) MDS codes are used to construct (k, n) threshold secret sharing schemes. Finally, some known secret sharing schemes are analysed, and the common problems in the schemes are pointed out, using the defination of (k, n) threshold secret sharing scheme and the results of the paper.
出处
《通信学报》
EI
CSCD
北大核心
1993年第3期22-28,共7页
Journal on Communications
基金
国家自然科学基金