RATIONAL SECRET SHARING OVER AN ASYNCHRONOUS BROADCAST CHANNEL WITH INFORMATION THEORETIC SECURITY
William K. Moses Jr. and C. Pandu Rangan
Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India
ABSTRACT
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 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. [2] used cryptographic primitives, [3] used an interactive dealer, and [4] used an honest minority of players in order to handle an asynchronous broadcast channel.
KEYWORDS
Cryptographic Protocols, Rational Secret Sharing, Information Theoretic Security
Original Source Link : http://airccse.org/journal/nsa/1111nsa01.pdf
No comments:
Post a Comment