Rational Secret Sharing over an Asynchronous Broadcast Channel with Information Theoretic Security


We consider the problem of rational secret sharing introduced by Halpern and Teague [1], 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… (More)
DOI: 10.5121/ijnsa.2011.3601


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics