(m+n,t+1)-门限秘密共享方案

(m+n,t+1)-Threshold Secret Sharing Scheme

秘密共享方案一般集中于Shamir(k,n)-门限方案的研究.有时考虑到参与者地位的特殊性,需要修改(k,n)-门限方案,以使其满足特殊的需要.(m+n,t+1)-门限方案就是一类特殊的门限方案.通过对(m+n,t+1)-门限方案进行的研究,构造了一类(m+n,t+1)-秘密共享矩阵;并且利用此矩阵,给出了一种实现(m+n,t+1)-门限方案的方法.

ecret sharing programs are generally focused on the studies of Shamir（k,n）-threshold scheme.Sometimes,the special status of the participants must be taken into consideration.This need to modify the （k,n）-threshold scheme to meet specific needs.（m ＋ n,t ＋1）-threshold scheme is a special threshold secret sharing scheme.Based on（m ＋ n,t ＋1）-threshold scheme,this artide construct a（m ＋ n,t ＋1）-Secret sharing matrix.This matrix could achieve the（m ＋ n,t ＋1）-threshold scheme.