安全通论(10)——攻防一体的输赢次数极限  

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

作　　者：杨义先[1] 钮心忻[1] YANG Yi-xian NIU Xin-xin(Information Security Center,Beijing University of Posts and Telecommunications, Beijing 100876, China)

机构地区：[1]北京邮电大学信息安全中心,北京100876

出　　处：《北京邮电大学学报》2016年第3期136-142,共7页Journal of Beijing University of Posts and Telecommunications

摘　　要：在实际的网络对抗中,攻与防其实是一体的,即每个当事人既是攻方(黑客)又是守方(红客).而且,除了最常见的"1对1"的对抗之外,还有"1对多",以及多人分为两个集团(如历史上的北约和华约集团)之间的对抗;当然,更一般地,还有所有当事人之间的混战.笔者针对所有这些可能的对抗场景,在"任何人不会自己骗自己"的假定下,给出了全部"独裁评估事件"可达理论极限.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＂.

关 键 词：黑客 红客 进攻 防御 信道 

分 类 号：TP212[自动化与计算机技术—检测技术与自动化装置]