Presentation 2010-12-03
Constant-round reconstruction for rational secret sharing
Akinori KAWACHI, Yoshio OKAMOTO, Keisuke TANAKA, Kenji YASUNAGA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We study the problem of designing rational secret sharing, in which players behave according to their payoff. We propose a rational secret sharing protocol, in which the players can reconstruct the secret in two rounds with high probability as long as every player follows the strategy in any symmetric Nash equilibrium. The communication is via a simultaneous broadcast channel. This article is a technical report without peer review, and its polished version will be published elsewhere.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Rational secret sharing / symmetric Nash equilibrium / simultaneous broadcast channel
Paper # COMP2010-41
Date of Issue

Conference Information
Committee COMP
Conference Date 2010/11/26(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Constant-round reconstruction for rational secret sharing
Sub Title (in English)
Keyword(1) Rational secret sharing
Keyword(2) symmetric Nash equilibrium
Keyword(3) simultaneous broadcast channel
1st Author's Name Akinori KAWACHI
1st Author's Affiliation Tokyo Institute of Technology()
2nd Author's Name Yoshio OKAMOTO
2nd Author's Affiliation Japan Advanced Institute of Science and Technology
3rd Author's Name Keisuke TANAKA
3rd Author's Affiliation Tokyo Institute of Technology
4th Author's Name Kenji YASUNAGA
4th Author's Affiliation Tokyo Institute of Technology
Date 2010-12-03
Paper # COMP2010-41
Volume (vol) vol.110
Number (no) 325
Page pp.pp.-
#Pages 7
Date of Issue