Verifiable Secret Sharing Scheme To Study More

With the rapid development of computer network technology, more and more information need be safely preserved and transferred. On the one hand, because of the vulnerability of the computer hardware technology, it is very easy to make stored information can be damaged, changed or lost, on the other hand, a lot of sensitive information are transferred through an open network, it is also easy to be intercepted, replayed, altered or forged, so how to ensure the safety and the integrity of information, it become a urgent problem in information security field.Secret sharing, an important research content, plays an important role in information security and data confidentiality. In1979, Shamir and Blakley introduced the threshold secret sharing scheme, which can realize the key security preservation. Since then much work has been widely studied about such schemes, finding Shamir’s scheme has the following defect:(1) the cheat can’t be prevented between the dealer and the participants;(2) the system need a secure channel;(3)only one secret can be shared during one secret sharing process. Later scholars have proposed verifiable multi-secret sharing scheme, which has important application in the secure multi-party computation and electronic cash and electronic commerce.In this thesis, the verifiable multi-secret sharing scheme is the priority research area, and it will mainly solve the problems which need a secure channel and also can not detect the cheater in the existed secret sharing schemes.The main results are as follows:1. In view of the security defect of the X-Y-W scheme, that is it can’t prevent the participants are cheaters, a new efficient and practical verifiable multi-secret sharing scheme based on certificate and double secret shadow is proposed, which can recover the shared secret by only a secret shadow in the recovery phase. In the new scheme, a double secret shadow is used to avoid the dealer to be a cheater, which can improve the security. The proposed scheme has some merits, such as the system does not need a secure channel, it can reduce the communication costs and can avoid the dealer or the participants to be cheaters, it also can increase the new shared secret dynamically and so on. Compared with the existed schemes, the less communication costs and storage is need in the new scheme, and it is more efficient than others.2. For the security defect that the participants are unable to ensure the effectiveness of the public parameters in the secret sharing scheme based on homogeneous linear recursion, in this paper, the DM scheme is analyzed and an attack is given, then a new multi-secret sharing scheme based on Shamir’s threshold and homogeneous linear recursion is proposed, which can make up for lack of the original scheme and improve the security.