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.
Rational secret sharing and multiparty computation: extended abstract
Joseph Y. Halpern,Vanessa Teague
Published 2004 in Symposium on the Theory of Computing
ABSTRACT
PUBLICATION RECORD
- Publication year
2004
- Venue
Symposium on the Theory of Computing
- Publication date
2004-06-13
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-19 of 19 references · Page 1 of 1