題名: Cost Minimization for Thwarting Network Attacks
作者: Chen, Wen-Huei
關鍵字: network security
attack graph
atomic attacks
integer programming
期刊名/會議名稱: 2002 ICS會議
摘要: An Attack Graph is a graphical representation of possible ways that an intruder can attack a network system through atomic attacks. Based on such graphs, Sheyer et al. have formulated a problem of thwarting a minimum set of atomic attacks (i.e., set T’) to guarantee that the network system won’t be attacked. As thwarting different atomic attacks usually involve different cost, we extend their problem to find a minimum-cost T’. Unlike their approach of using the greedy method to obtain approximate solution of this NP-hard problem, we reduce the minimum-cost problem to solving a set of Integer Programming equations. A Branch and Bound Algorithm can efficiently solve these equations for small cases. For larger cases, the algorithm takes the solution of the greedy method as the initial solution, iteratively improving this solution until that the software program is terminated.
日期: 2006-10-16T03:44:24Z
分類:2002年 ICS 國際計算機會議

文件中的檔案:
檔案 描述 大小格式 
ce07ics002002000077.PDF25.55 kBAdobe PDF檢視/開啟


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。