International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Efficient Rational Secret Sharing in the Standard Communication Model

Authors:
Georg Fuchsbauer
Jonathan Katz
Eric Levieil
David Naccache
Download:
URL: http://eprint.iacr.org/2008/488
Search ePrint
Search Google
Abstract: We propose a new methodology for rational secret sharing leading to various instantiations 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. Of additional interest, we propose new equilibrium notions for this setting (namely, computational versions of strict Nash equilibrium and stability with respect to trembles), show relations between them, and prove that our protocols satisfy them.
BibTeX
@misc{eprint-2008-18058,
  title={Efficient Rational Secret Sharing in the Standard Communication Model},
  booktitle={IACR Eprint archive},
  keywords={cryptographic protocols / game theory, rational secret sharing, VRFs},
  url={http://eprint.iacr.org/2008/488},
  note={(none) jkatz@cs.umd.edu 14307 received 20 Nov 2008, last revised 4 Mar 2009},
  author={Georg Fuchsbauer and Jonathan Katz and Eric Levieil and David Naccache},
  year=2008
}