We consider the concept of rational secret sharing, which was initially introduced by Halpern and Teague \cite{ht04}, where players\u27 preferences are that they prefer to learn the secret than not, and moreover they prefer that as few others learn the secret as possible. This paper is an attempt to introduce a rational secret sharing scheme which defers from previous RSS schemes in that this scheme does not rely on broadcast to send messages but instead uses point to point transmissions. Not only that, but the protocol will not rely on any cryptographic primitives and is coalition resilient except for when the short player colludes with a long player
In the second chapter, the notion of a social secret sharing (SSS) scheme is introduced in which sha...
Achieving fairness and soundness in non-simultaneous rational secret sharing schemes has proved to b...
In a conventional secret sharing scheme a dealer uses secure point-to-point channels to distribute t...
We consider the \textit{rational secret sharing problem} introduced by Halpern and Teague\cite{ht04}...
We consider the problem of rational secret sharing introduced by Halpern and Teague [1], where the p...
We consider the problem of secret sharing among $n$ rational players. This problem was introduced by...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
We consider the classical secret sharing problem in the case where all agents are selfish but ration...
Recent work has attempted to bridge the fields of Cryptography and Game Theory in order to create mo...
Abstract. This paper introduces the Repeated Rational Secret Sharing problem. We borrow the notion o...
Abstract—Rational secret sharing shows that, in a setting with rational players, secret sharing and ...
In order to prevent any arbitrary subsets of coalition in rational secret sharing, we propose a new ...
The field of rational cryptography considers the design of cryptographic protocols in the presence o...
We provide a general construction that converts any rational secret-sharing protocol to a protocol w...
ABSTRACT We consider the problems of secret sharing and multiparty computation, assuming that agents...
In the second chapter, the notion of a social secret sharing (SSS) scheme is introduced in which sha...
Achieving fairness and soundness in non-simultaneous rational secret sharing schemes has proved to b...
In a conventional secret sharing scheme a dealer uses secure point-to-point channels to distribute t...
We consider the \textit{rational secret sharing problem} introduced by Halpern and Teague\cite{ht04}...
We consider the problem of rational secret sharing introduced by Halpern and Teague [1], where the p...
We consider the problem of secret sharing among $n$ rational players. This problem was introduced by...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
We consider the classical secret sharing problem in the case where all agents are selfish but ration...
Recent work has attempted to bridge the fields of Cryptography and Game Theory in order to create mo...
Abstract. This paper introduces the Repeated Rational Secret Sharing problem. We borrow the notion o...
Abstract—Rational secret sharing shows that, in a setting with rational players, secret sharing and ...
In order to prevent any arbitrary subsets of coalition in rational secret sharing, we propose a new ...
The field of rational cryptography considers the design of cryptographic protocols in the presence o...
We provide a general construction that converts any rational secret-sharing protocol to a protocol w...
ABSTRACT We consider the problems of secret sharing and multiparty computation, assuming that agents...
In the second chapter, the notion of a social secret sharing (SSS) scheme is introduced in which sha...
Achieving fairness and soundness in non-simultaneous rational secret sharing schemes has proved to b...
In a conventional secret sharing scheme a dealer uses secure point-to-point channels to distribute t...