The Research Of Verifiable Anonymous Secret Sharing And Dynamic Weighted Secret Sharing

A secret sharing scheme is a method of sharing a secret among a set of participants such that only qualified subsets of participants can reconstruct the secret whereas any other subsets not belonging to qualified subsets cannot learn anything about the secret.Secret Sharing is an important technical method to guarantee information security and can be seen as a kind of method to divide information into secret shadows according certain rules. Secret sharing can ensure information security without encryption phase and decryption phase, so it has high efficientcy and important research value. Secret sharing is widely used in real life, such as bank insurance library password custody, the missile launch, important meeting key distribution management, electronic auction, and so on. Along with deep research and different application environment of secret sharing, many secret sharing branchs are proposed. In order to sovle the cheating problem between dealer and participants or participants between each other, the first verified secret sharing scheme was proposed. When the secret sharing phase is long, if secret shadow doesn’t change, the scheme’s security performance is low, so, dynamic secret sharing scheme is appeared. Then anonymous secret sharing scheme and weighted secret sharing scheme were proposed by many scholars. These schemes have efficient solutions in different circumstances against specific problems, but these schemes also have some limits. So many scholars comprehensive application of different secret branchs and provide more efficient practical secret sharing schemes.This paper mainly studies problems of anonymous secret sharing scheme and weighted secret sharing scheme, proposed a verifiable anonymous secret sharing scheme and a weighted dynamic secret sharing scheme which we combined verifiable property and dynamic property.The main work of this article is as follows:First, based on BP artificial neural network, we proposed a verifiable anonymous secret sharing scheme by using discrete logarithm difficult problem solution and Elliptic curve encryption method. The scheme can ensure that the shareholders’ identities are completely anonymous when the secret is recovered. Unlike previous schemes, our scheme is an ideal (t,n) threshold scheme which parameter t doesn’t have lower bounds and need less storage space. Furthermore, the shares can be chosen by shareholders and the communication between dealer and participants doesn’t need secure channel. In addition, the participants can verify the correctness of their shares and the secret S.Second, based on trust evaluation, we proposed a weighted secret sharing scheme which the participants’weight can dynamic change. It can overcome the drawback of previous secret sharing schemes which participants’weights are fixed and can’t meet the actual application. In the scheme, the participants’secret shadows are assigned from their different behavior and this will dynamically change their function in secret sharing phase. When corrupted members are deleted, new members are able to be enrolled. Meanwhile, the participants’secret shadows can be renewed without changing the secret. Analysis result shows that the scheme is a secure secret sharing scheme which the participants’weight and secret shadow can dynamically change.