Social Secret Sharing Scheme With Dynamic Tuning And Cheater Detection

The social secret sharing scheme researches on the rational participants,the dynamic tuning of the scheme and the cooperation of the reputation system in social networks.The dynamic tuning refers to the change of the number of participants,the secret value and the reputation due to the interaction between the participants.It is a research hotspot at present.Due to the complexity of the dynamic tuning of the secret sharing scheme in the social network,it is of theoretical and practical significance to study the dynamic tuning and cheater detection in the social secret sharing scheme.In many existing dynamic tuning schemes,after dynamic tuning of participants,the deleted participant can still take part in the process of secret reconstruction by using old shares.In reputation tuning,schemes only research on reconstructing a single secret.In the process of secret reconstruction,there is cheating behavior that the dishonest participants force to obtain the secret using the false shares.Therefore,this paper studies the above problems and proposes a social secret sharing scheme with dynamic tuning and cheater detection on the basis of existing schemes.The main work are as follows.(1)This paper focuses on the problem in the social secret sharing scheme that the old shares are still available in the dynamic tuning of the participant and the secret.The scheme changes the secret by re-constructing the linear combination to distribute the secret.When the number of participants is increased,each participant uses the Lagrange interpolation polynomial to distribute the new share to the increased participant without the dealer.The scheme can delete the participant by updating the random factor.When the deleted participant forced to take part in secret reconstruction,the honest participant can detect the illegal behavior using the ElGamal signature algorithm.Furthermore,the scheme uses the encryption algorithm to verify that the deleted participant cannot recover the secret.(2)This paper focuses on the single secret reputation tuning in the social secret sharing scheme.By constructing the binary asymmetric polynomial,multi-secret values can be distributed at one time.The dealer distributes the corresponding shares based on the reputation values held by the participants.In secret reconstruction each participant does not show their shares directly but the sub-secrets by computing.According to the interaction of the participants in the reconstruction stage,the scheme will execute the reputation tuning.So,the cooperative participants have a higher reputation than the non-cooperative participants and receive more shares.The scheme uses asymmetry to prove the asynchronous reconstruction between multi-secret.(3)This paper focuses on that the participant does not present the share information or presents the false information,when the reconstruction participants are greater than the threshold in secret sharing scheme.In the scheme,participants construct identity information in the form of index and the dealer distributes the secret by the linear combination form.In the secret reconstruction stage,the scheme uses the ElGamal signature to verify the identity of the correctness of sub-secret information.If the verification is correct,the participants can recover the secret using the Lagrange polynomial.The ElGamal signature scheme is used to encrypt the information before transmission,ensuring that sub-secret is not eavesdropped and tampered by the external adversary in the transmission.