【摘要】 为了提高(t,n)门限秘密分享在添加新参与者阶段的通信效率，该文对Asmuth和Bloom提出的门限秘密分享方案进行研究。该文通过添加随机数的方法，设计了一种新的无分发者参与实现添加新参与者的方案，且不改变秘密值和原有参与者的份额。该方案参与者之间的总通信次数仅为t次，该文还分析了方案的正确性和安全性。更多还原

【Abstract】 In order to improve the communication efficiency of the(t,n)threshold secret sharing in the stage of registering new participants, this article studies the threshold secret sharing scheme proposed by Asmuth and Bloom. By adding random numbers, this article designs a new scheme for registering new participants without the dealer, and does not change the secret value and the shares of the original participants. The total number of communications between participants in the scheme is only t times. This article also analyzes the correctness and security of the scheme.更多还原