The Research Of Dynamic Verifiable Secret Sharing

Secret sharing is an important branch in modern cryptography and an important research field in information. Secret sharing is first proposed for the decentralized mamagement of private key. It plays an key role in safely preserving, transmitting and legally using the important information and the secret data. The use of secret sharing keeping a secret, which utilizing verifiable secret sharing to keep secrets is not only prevented power from being kept centralized, but also kept security and integrity of informations.In addition, the shares can check up cheating in order to keep the standard shares recovering the shared secret. In 1979, Shamir and Blakley first developed the concepts of the (t,n)thereshold secret sharing (SS) scheme. However, as these schemes are discussed, there are many drawbacks in both these secret sharing schemes as follows:(1) Only one secret can be shared during one secret sharing process: (2) A dishonest dealer may distribute a fake shadow to a certain participant, and then that participant would subsequently never obtain the true secret:(3) A malicious participant may provide a fake share to other participants, which may make the malicious participant the only one who gets to reconstruct the true secret. So the design of practical and efficient secret sharing scheme has become a hot topic.This paper is researching the secret sharing scheme and its applications. The main results are as follows:1 By analyzing the security of GCC scheme, we show that their scheme cannot prevent both participants from cheating. So the scheme does not meet verifiability.2 By analyzing the security of LHC scheme, we found that everyone can recover the sharing secerets. From public information, we give an improvement on the scheme, which overcome the security scheme of the original scheme, and the improvement one is a safe verifiable secret sharing scheme.3 Aiming at the existing ID-Based signature schemes all need trust private key generator. We give an ID-Based sigcryption without trusted party.4 By analyzing the security of WJZ scheme, we show that their scheme have the problem of computational mechanics, and we give an improvement on the scheme.