A New Protocol of Member Expansion in a Secret Sharing Scheme
Huang Xiao-lin · Xihua Daxue xuebao. Zhexue shehui kexue ban · 2010
The previous protocols of member expansion in a secret sharing scheme have some drawbacks,for instance,the cheating behavior of the original group members can not be detected;the original group members must wait for distrubuting the share secret for the new member in turn;the broadcasts and the broadcasted datum are excessive etc.In this paper,a new protocol of member expansion in a secret sharing scheme is proposed.In the proposed protocol,the ideas of using random numbers to hide the original group members' share secrets and random numbers pretreatment are adopted.The proposed protocol can ensure the original group members' share secrets to be kept fixed,and the original group members can distribute the shared secret for the new member at the same time without waiting.The validity of the broadcasted information can be verified,the cheating behavior of oringial group members can be detected.The shared secret of the new member can be verified.The proposed protocol only need t+1 broadcasts,and 2t+1 broadcasted datum.It is more efficient than the previous protocols of member expansion.