论文部分内容阅读
针对秘密共享方案提出了一种为新个体分配秘密份额的算法.该算法具有无需信任中心、无需改动原有秘密份额、仅需t个成员合作(t为门限)、6t次广播等优点.最后还证明了该算法具有高安全性,并且在可靠性和密钥管理方面优于Shuffling方案和Wong TM等人的算法.
Aiming at the secret sharing scheme, an algorithm is proposed to allocate secret shares to new individuals. The algorithm has the advantages of no trust center, no need to change the original secret share, only t members cooperation (t is threshold), 6t broadcast, etc. Finally The algorithm is also proved to be highly secure and superior to the Shuffling scheme and the Wong (TM) et al. Algorithm in terms of reliability and key management.