Research Of Dynamic Multi-secret Sharing

Secret sharing is an important component of cryptography,it provides a new idea for secret management,and plays a important role at secret preservation, transmission and utilizing legally.Secret sharing is used for saving secret information,on the one hand,it has right to prevent over-concentration and abuse,on the other hand,it guarantees the security and integrity of secret.Therefore,research of secret sharing not only has important theoretical significance,but also has broad application prospects.Firstly,this dissertation introduces emergence,development and research of secret sharing,and then detailed discussion of the verifiable secret sharing scheme,dynamic secret sharing and multi-secret sharing scheme,problems is found in these scheme.In response to these problems,a new dyanmic multi-secret sharing is proposed.There are some features in our scheme as follow:(1)Participant can choose sub-secrets,trust center receives a shadow of sub-secrets,it is not feasible from shadow of sub-secrets to sub-secrets in calculation.(2)Updating share of sub-secrets is compoised by participant and trust center,either of updating share is leaked,security of scheme will not be affected. Participants need not to interact at updateing stage,volume of data transmission is reduced.(3)The scheme bases on Ellipitc Curve Cryptosystem,ECC that is compared with the RSA and Elgamal cryptosystem,which can use shorter keys to achieve the same security,so security and efficiency is further enhanced.The dissertation use VC++6.0 and miracl library to design a prototype system in Windows XP,it is detailedly introduced for component of prototype system and the experimental results.The result shows that scheme is feasibility and right.