Weighted Threshold Secret Sharing Research

Secret sharing is an important branch of modern cryptography. It is a significant way to protecting information security and data encryption. Secret sharing is used for saving secret information. It prevents excessive concentration of power being abused and can disperse responsibility. On the other hand, it guarantees the security and integrity of data. Therefore, research of secret sharing has important theoretical significance and broad application prospects.Firstly, the backgrounds, status and related Mathematical tools of secret sharing are presented in the dissertation. In succession, several current research areas of threshold secret sharing are discussed. Some classical threshold secret sharing schemes are analyzed. Then, the features of current weighted threshold secret sharing are researched. A new weighted threshold secret sharing scheme is proposed. There are some features in the scheme as follows:(1) The participants are allowed to own different weight value. Only when the total weight value of the participants is greater or equal to the threshold value, the participants could recover the secret, otherwise they can do nothing.(2) Mignotte sequence is introduced and extended in the scheme. No matter how much the weight value of the participant is, each participant only needs to save one share. It can greatly reduce the transmission quantity of confidential information and enhance the security of information.(3) No additional data is required in the scheme, which simplifies the structure and reduces the computational difficulty.Finally, the generation and realization algorithms of the large prime number are introduced in the dissertation. A prototype system is implemented by using VC++6.0. The functions of component of the prototype system are detailed analyzed. The experimental results show that the scheme is correct and feasible and has good security and applicability.