关键词: 博弈论, 纳什均衡, 重复博弈, 理性秘密分享机制

Abstract: Finitely repeated rational secret sharing scheme is first proposed by Maleka and Shareef who conclude that there does not exist a Repeated Rational Secret Sharing Scheme（RRSSS） within constant rounds. However, RRSSS within infinite rounds is lack of efficiency and has no application value. To achieve an efficient RRSSS within constant rounds, players are set different types. An efficient RRSSS within constant rounds is put forward under incomplete information and then its validity is proved. Compared with other rational secret sharing schemes, given proper conditions, the new scheme has advantages in Nash equilibrium, expected running time and communication channel.

Key words: game theory, Nash equilibrium, finitely repeated games, rational secret sharing scheme