Rational Secret Sharing and Multiparty Computation: Extended Abstract

Details Rational Secret Sharing and Multiparty Computation: Extended Abstract Rational Secret Sharing and Multiparty Computation: Extended Abstract

2006-09-07

arxiv.org/abs/cs/0609035v1

Computer Science

Computer Science and Game Theory

Appears in STOC, 2004

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Rational Secret Sharing and Multiparty Computation: Extended Abstract does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Rational Secret Sharing and Multiparty Computation: Extended Abstract, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rational Secret Sharing and Multiparty Computation: Extended Abstract will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-111984