论文部分内容阅读
通信率是密钥共享领域一个极其重要的概念。已有方法构造的理想(t,n)-门限密钥共享方案的通信率ρ=v/(v+t-l)l并不能完全证明满足所给的界。在该方案的基础上,改进重构算法,得到一个更高的通信率ρ’=v/(t-l)(t-1)+tv(,≥ρ)并证明新的通信率大于下界1/t,且当重构密钥的参与者数目为l=t+v-1时,新的通信率可以达到上界v/t+v-1。
Communication rate is an extremely important concept in the field of key sharing. The communication rate ρ = v / (v + t-1) l of the ideal (t, n) -threshold key sharing scheme constructed by the existing method can not fully prove that the given bound is satisfied. On the basis of this scheme, we improve the reconstruction algorithm to get a higher communication rate ρ ’= v / (tl) (t-1) + tv (, ≥ ρ) and prove that the new communication rate is greater than the lower bound 1 / t , And the new communication rate can reach the upper bound v / t + v-1 when the number of participants for reconstructing the key is l = t + v-1.