Cryptology ePrint Archive: Report 2008/488

Efficient Rational Secret Sharing in Standard Communication Networks

Georg Fuchsbauer and Jonathan Katz and David Naccache

Abstract: We propose a new methodology for rational secret sharing leading to various instantiations (in both the two-party and multi-party settings) that are simple and efficient in terms of computation, share size, and round complexity. Our protocols do not require physical assumptions or simultaneous channels, and can even be run over asynchronous, point-to-point networks.

We also propose new equilibrium notions (namely, computational versions of strict Nash equilibrium and stability with respect to trembles) and prove that our protocols satisfy them. These notions guarantee, roughly speaking, that at each point in the protocol there is a unique legal message a party can send. This, in turn, ensures that protocol messages cannot be used as subliminal channels, something achieved in prior work only by making strong assumptions on the communication network.

Category / Keywords: Protocols, Game Theory

Publication Info: This is the full version of the paper to appear at TCC 2010

Date: received 20 Nov 2008, last revised 5 Dec 2009

Contact author: jkatz at cs umd edu

Available format(s): PDF | BibTeX Citation

Version: 20091206:032939 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]