Title: Repeated rational secret sharing, revisited

Authors: Yilei Wang; Hao Wang; Qiuliang Xu

Addresses: School of Computer Science and Technology, Shandong University, Jinan 250101, China; School of Information Science and Engineering, Ludong University, Yantai 264025, China. ' School of Computer Science and Technology, Shandong University, Jinan 250101, China. ' School of Computer Science and Technology, Shandong University, Jinan 250101, China

Abstract: Rational Secret Sharing Scheme (RSSS) disposes the dilemma that several selfish players come together and willingly pool their shares to reconstruct a secret without a compulsory execution measure, while cooperation is not a strict optimisation. This paper introduces four punishment strategies and expands the perfect conclusions in infinitely repeated RSSS to show that cooperation will recur by means of some strategies. For finitely repeated RSSS, this paper verifies that there is no way for players to cooperate under perfect and complete information for backward induction. To overcome this difficulty, this paper relaxes conditions such as the types of players and the randomised strategies. It is proved that, given the different types and incomplete information, players will insist on cooperation in finitely repeated RSSS. In addition, we discuss repeated games in an extensive form and propose a 2-out-of-2 RSSS.

Keywords: backward induction; game theory; mutual cooperation; Nash equilibrium; rational secret sharing; stage games; punishment strategies; repeated RSSS.

DOI: 10.1504/IJGUC.2012.045696

International Journal of Grid and Utility Computing, 2012 Vol.3 No.1, pp.12 - 24

Received: 11 Aug 2011
Accepted: 11 Aug 2011
Published online: 20 Dec 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article