Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2016, Vol. 39 ›› Issue (3): 136-142.doi: 10.13190/j.jbupt.2016.03.025

• Reports • Previous Articles    

The General Theory of Security (10)——Winning Number's Limitations for the Attacking and Defensing

YANG Yi-xian, NIU Xin-xin   

  1. Information Security Center, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2016-07-20 Online:2016-06-28 Published:2016-06-28

Abstract:

In actual network confrontations, attack and defense is, in fact, combined in one body, i.e., each person is not only the attacking side (hackers), but also the defending side(the Honker). In addition to the most common "1 to 1" and "one to many" attack-and-defense, there are also the 2-group cases, i.e., the persons are divided into two groups (for example, the historical NATO and the Warsaw Pact) such that one group attacks and defenses the other group. Of course, the more general cases are the "all parties attack-and-defense", i.e., all persons attack and defense each other. In this paper, the reachable limitations of all "dictatorship evaluate" events are listed for all of these possible confrontations, under the assumption of "any person not deceive ourselves".

Key words: Hacker, Honker, offensive, defensive, channel

CLC Number: