Games Based Study of Nonblind Confrontation

Abstract EN

Security confrontation is the second cornerstone of the General Theory of Security.

And it can be divided into two categories: blind confrontation and nonblind confrontation between attackers and defenders.

In this paper, we study the nonblind confrontation by some well-known games.

We show the probability of winning and losing between the attackers and defenders from the perspective of channel capacity.

We establish channel models and find that the attacker or the defender wining one time is equivalent to one bit transmitted successfully in the channel.

This paper also gives unified solutions for all the nonblind confrontations.