2-out-of-2 Rational Secret Sharing in Extensive Form

The empty threat is not credible, because the actions are taken simultaneously. To eliminate the empty threat, a non-simultaneous channel is used in this paper. Zhifang Zhang \cite{zzf1} proposes a 2-out-of-2 rational secret sharing in extensive form to eliminate the empty threats while she does not consider the cost when neither players broadcast their shares and uses simultaneous channels in $Norm(k)$. In this paper we give a 2-out-of-2 rational secret sharing in extensive form without simultaneous broadcast channel. Furthermore, we add the reputation effect into the model which influences the probability of the other player's choice. We punish the player who does not send his share after receiving the other player's share. Under the hypocrite strategy, there exists a sequential equilibrium in the extensive game which means that no players can gain higher payoffs after any histories as long as other player insists on the specified strategy.

[1]  C. Pandu Rangan,et al.  Rational Secret Sharing with Repeated Games , 2008, ISPEC.

[2]  Moni Naor,et al.  Games for exchanging information , 2008, STOC.

[3]  Zhifang Zhang,et al.  Rational secret sharing as extensive games , 2013, Science China Information Sciences.

[4]  G. R. BLAKLEY Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[5]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[6]  Shien Jin Ong,et al.  Fairness with an Honest Minority and a , 2008 .

[7]  Jonathan Katz,et al.  Rational Secret Sharing, Revisited , 2006, SCN.

[8]  Abhi Shelat,et al.  Purely Rational Secret Sharing (Extended Abstract) , 2009, TCC.

[9]  Joseph Y. Halpern,et al.  Rational secret sharing and multiparty computation: extended abstract , 2004, STOC '04.

[10]  Adi Shamir,et al.  How to share a secret , 1979, CACM.