Rational Secret Sharing Over an Asynchronous Broadcast Channel With Information Theoretic Security
The authors consider the problem of rational secret sharing introduced by Halpern and Teague, where the players involved in secret sharing play only if it is to their advantage. This can be characterized in the form of preferences. Players would prefer to get the secret than to not get it and secondly with lesser preference, they would like as few other players to get the secret as possible. Several positive results have already been published to efficiently solve the problem of rational secret sharing but only a handful of papers have touched upon the use of an asynchronous broadcast channel.