Rational Secret Sharing, Revisited

S. Dov Gordon and Jonathan Katz

Abstract

We consider the problem of secret sharing among $n$ rational players. This problem was introduced by Halpern and Teague (STOC 2004), who claim that a solution is impossible for $n=2$ but show a solution for the case $n\geq 3$. Contrary to their claim, we show a protocol for rational secret sharing among $n=2$ players; our protocol extends to the case $n\geq 3$, where it is simpler than the Halpern-Teague solution and also offers a number of other advantages. We also show how to avoid the continual involvement of the dealer, in either our own protocol or that of Halpern and Teague. Our techniques extend to the case of rational players trying to securely compute an arbitrary function, under certain assumptions on the utilities of the players.

Note: (none)

Available format(s)
Category
Cryptographic protocols
Publication info
Published elsewhere. Accepted for presentation at NetEcon 2006; full version accepted to SCN 2006
Keywords
game theory
Contact author(s)
jkatz @ cs umd edu
History
2006-07-11: last of 4 revisions
See all versions
Short URL
https://ia.cr/2006/142

CC BY

BibTeX

@misc{cryptoeprint:2006/142,
author = {S.  Dov Gordon and Jonathan Katz},
title = {Rational Secret Sharing, Revisited},
howpublished = {Cryptology ePrint Archive, Paper 2006/142},
year = {2006},
note = {\url{https://eprint.iacr.org/2006/142}},
url = {https://eprint.iacr.org/2006/142}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.