CryptoDB
Rational Secret Sharing, Revisited
| Authors: | |
|---|---|
| Download: | |
| 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. |
BibTeX
@misc{eprint-2006-21635,
title={Rational Secret Sharing, Revisited},
booktitle={IACR Eprint archive},
keywords={cryptographic protocols / game theory},
url={http://eprint.iacr.org/2006/142},
note={Accepted for presentation at NetEcon 2006; full version accepted to SCN 2006 jkatz@cs.umd.edu 13340 received 11 Apr 2006, last revised 11 Jul 2006},
author={S. Dov Gordon and Jonathan Katz},
year=2006
}