Rational Secret Sharing and Multiparty Computation: Extended Abstract

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
Appears in STOC, 2004

Keywords

Computer Science and Game Theory, Cryptography and Security, Distributed, Parallel, and Cluster Computing, F.m

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/116121

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0609035
 http://arxiv.org/abs/cs/0609035

Collections

arXiv