Rational Secret Sharing and Multiparty Computation (Extended Abstract) (2004)
| Citations: | 43 - 8 self |
BibTeX
@MISC{Halpern04rationalsecret,
author = {Joseph Halpern and Vanessa Teague},
title = {Rational Secret Sharing and Multiparty Computation (Extended Abstract)},
year = {2004}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Joseph Halpern Cornell University Ithaca, NY 14853 halpern@cs.cornell.edu Vanessa Teague Stanford University Stanford, CA 94305-9025 vteague@cs.stanford.edu ABSTRACT We consider the problems of secret sharing and multiparty computation, assuming that agents prefer to get the secret (resp., function value) to not getting it, and secondarily, prefer that as few as possible of the other agents get it. We show that, under these assumptions, neither secret sharing nor multiparty function computation is possible using a mechanism that has a fixed running time. However, we show that both are possible using randomized mechanisms with constant expected running time.
