Paper 2010/250
Collusion Free Protocol for Rational Secret Sharing
Amjed Shareef
Abstract
We consider the \textit{rational secret sharing problem} introduced by Halpern and Teague\cite{ht04}, where players prefer to get the secret rather than not to get the secret and with lower preference, prefer that as few of the other players get the secret. Some positive results have been derived by Kol and Naor\cite{stoc08} by considering that players only prefer to learn. They have proposed an efficient
Metadata
- Available format(s)
- PDF PS
- Category
- Foundations
- Publication info
- Published elsewhere. Accepted as Brief Announcment in PODC 2010
- Keywords
- Rational Cryprography
- Contact author(s)
- amjedshareef @ gmail com
- History
- 2010-05-16: revised
- 2010-05-02: received
- See all versions
- Short URL
- https://ia.cr/2010/250
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2010/250, author = {Amjed Shareef}, title = {Collusion Free Protocol for Rational Secret Sharing}, howpublished = {Cryptology {ePrint} Archive, Paper 2010/250}, year = {2010}, url = {https://eprint.iacr.org/2010/250} }