Verifiable Rational Multi-secret Sharing Scheme

In this paper we mainly focus on the cheating problem and the incapability problem existed in rational secret sharing schemes. Based on current schemes and the related knowledge of bit commitment agreement, we proposed a verifiable rational multi-secret sharing scheme in which players can verify the identity of the dealer. In this way, it is feasible to prevent the forger from cheating. The correctness of the secret share is also guaranteed by discrete logarithm problem. The secret shares are divided into groups so that the distribution phase is well designed. The game theory model is also adopted to realize the rational multi secret sharing. The efficient of our scheme has remarkably improved in this protocol as well as the security and feasibility.