The optimal attack-defense scheme for secret sharing

The attack-defense issue of secret sharing has been a pressing cryptography research need. For solving this issue, this study proposes an optimal secret-share attack-defense model with game theory and information theory. This study constructs an attack channel for attackers and a defense channel for defenders. Then, we propose a game model that utilizes mutual information to measure the attack and defensive capabilities of attackers and defenders. Next, this study proves that there is a Nash equilibrium in this game model by analyzing the strategies of each attacker/defender. Finally, we analyze the change of k value and attack and defensive capabilities. Moreover, we also prove the best attack and defensive strategies.