Rational Secret Sharing Protocol with Fairness

To solve the question that players will deviate from secret sharing protocol for their own benefits, we apply game theory to the protocol. It is the first time to use the model of dynamic game of incomplete information, by controlling the probability parameter, the designated strategies will be a computational perfect k-resilient Nash equilibrium. Using this protocol, to achieve fairness, we don't have to assume the number of malicious players is no more than half of the total number which is important in traditional protocols, our protocol can prevent deviating behaviors effectively to achieve extreme fairness.