We consider the rational secret sharing problem introduced by Halpern and Teague[l]. Some positive results have been derived by Kol and Naor[3] by considering that players only prefer to learn.The solution considers that players are of two types; one player is the short player and the rest of the players are long players. But their protocol is susceptible to coalitions if the short player colludes with any of the long players. We extend their protocol, and propose a completely collusion free, ε-Nash equilibrium protocol, when n > 1m -1, where n is the number of players and m is the number of shares needed to construct the secret.
展开▼
