Research And Application Of Secret Sharing Scheme

Secretret sharing is an important cryptographic technology,which divides secret into shadow secrets and distributes these shadow secrets to participants for management.It requires the cooperation of t-plus honest participants to recover the correct secret.This technology can prevent the centralization of the secret so as to disperse risks,tolerate intrusions,ensure the security and accuracy of transmission information,thus being widely used in the application fields of data security storage and encryption.This paper analyzes the shortcomings of the current researches on secret sharing,and makes a theoretical research on improving the efficiency of computation and enhancing the security.Three secret sharing schemes are proposed.The main work is as follows:With the foundation of Shamir's secret sharing scheme,a multi-secret sharing scheme based on password is proposed.The multiple secret information which the secret owner hosts to multiple trusted remote servers can be recovered by password.This is a multiple scheme for the distributor only needs to reconstruct the secret polynomial to update the number of Secrets dynamically.According to the analysis results,the time complexity between this scheme and the traditional secret sharing scheme remains the same.(1)Based on RSA encryption algorithm,a verifiable password authorization multi-secret sharing scheme is proposed.In the process of secret sharing,it can effectively prevent the fraud from the distributor and malicious attacks form the participant by verifying the correctness of shadow secret.This scheme realizes the dynamic update of secret number and password authorization of secret owner,which is more secure than the similar schemes.(2)A new verifiable secret sharing scheme is proposed based on the new bilinear mapping.With the random prediction model,it is proved that the security of the scheme depends on the difficulty of Diffie-Hellman problem.The analysis results show that the scheme is superior to any other schemes in terms of security and computational complexity.