密钥重构过程中的通信率

Communication rate in the secret reconstruction phase

通信率是密钥共享领域一个极其重要的概念。已有方法构造的理想(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 secret sharing.It was proved that the communication rate ρ= v（v ＋t -l）l of the ideal （t,n）-threshold secret sharing scheme constructed by the existing solu-tion couldnt meet the bound.Based on this scheme,an improved reconstruction algorithm was proposed and a higher communication rate ρ′=v （t -l）（t -1）＋tv（≥ρ）was figured out.The result proves that ρ′is greater than the lower bound 1t and can achieve the upper bound vt ＋v -1 when l =t ＋v -1.