A verifiable rational secret sharing scheme based on bilinear pairing

To correct the problem that traditional secret sharing scheme can not take precautions against cheat, in this paper, we propose a rational secret sharing scheme. The proposed scheme based on bilinear pairing is verifiable and the participants' cheat can not work. The dealer doesn't need a secret share distribution. Therefore, the scheme greatly improves the efficiency of secret distribution. In addition, the trusted party is eliminated in the secret reconstruction phase. The gain of following the protocol is more than the gain of deviating, so rational player has an incentive to abide by the protocol. Finally, every player can obtain the secret fairly. Moreover, the scheme can withstand the conspiracy attack with at most m-1 players. By analysis, we find the scheme is secure and effective.