Dynamic Secret Sharing Schemes Based On Hash Function

The information is playing a more and more important role in the society and has become an important strategy resource of social development. But with the development of the IT and computer networking, information security has become a social problem that the world pays the attention to. To solve the problem the people adopt cryptography, while key management is its hardest part and is usually a deadly weakenss in secret system.The paper expatiates on one important technique of key management-secret sharing scheme's background and current research. This paper analyzes carefully the drawbacks of several current secret sharing schemes-"dynamic secret sharing scheme based on Hash function" and "cheat-proof secret share scheme based on RSA and one-way function". Aiming to make up for those drawbacks this paper improves "dynamic secret sharing scheme based on Hash function" with reference the cheat-proof method of "cheat-proof secret share scheme based on RSA and one-way function" and proposes a cheat-proof dynamic secret sharing scheme based on Hash function (IHDSS) which is a valuable theoretical and practical scheme. In the scheme the system can renew the system secret without renewing the shadows of the participants;When some shadows are revealed, they don't threaten the others;A new shadow can be generated for a new participant without any effect on the others;The shadows can be reused for many times. Except for those the IHDSS scheme also has an effective safeguard that is equal to decrypting RSA against cheating among participants.All research of this paper premises practicability and is grounded on cryptography and secret sharing scheme. It has been simulated under the platform-.NET, and uses a great number of experiment data to test and evaluate the scheme's performance and it turns out IHDSS both of their merits. So secret sharing scheme has a wide prospect and application field.