• DOI:10.1007/11832072_16
Corpus ID: 217509

Rational Secret Sharing, Revisited

@inproceedings{Gordon2006RationalSS,
  title={Rational Secret Sharing, Revisited},
  author={S. D. Gordon and Jonathan Katz},
  booktitle={SCN},
  year={2006}
}

• S. D. Gordon, Jonathan Katz
• Published in SCN 2006
• Computer Science

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≥3. Contrary to their claim, we show a protocol for rational secret sharing among n=2 players; our protocol extends to the case n≥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… Expand

View via Publisher

eprint.iacr.org

Save to Library

Create Alert

Cite

Launch Research Feed