Rational Secret Sharing and Multiparty Computation: Extended Abstract

Simple item page
dc.creatorHalpern, Joseph Y.
dc.creatorTeague, Vanessa
dc.date2006-09-07
dc.date.accessioned2026-07-07T07:23:48Z
dc.date.available2026-07-07T07:23:48Z
dc.descriptionWe 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.
dc.descriptionAppears in STOC, 2004
dc.identifierhttps://arxiv.org/abs/cs/0609035
dc.identifierhttp://arxiv.org/abs/cs/0609035
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/116121
dc.subjectComputer Science and Game Theory
dc.subjectCryptography and Security
dc.subjectDistributed, Parallel, and Cluster Computing
dc.subjectF.m
dc.titleRational Secret Sharing and Multiparty Computation: Extended Abstract
dc.typetext

Files

Collections

arXiv