完整後設資料紀錄
DC 欄位語言
dc.contributor.authorChen, Wen-Huei
dc.date.accessioned2009-08-23T04:41:09Z
dc.date.accessioned2020-05-25T06:37:42Z-
dc.date.available2009-08-23T04:41:09Z
dc.date.available2020-05-25T06:37:42Z-
dc.date.issued2006-10-16T01:44:12Z
dc.date.submitted2002-12-18
dc.identifier.urihttp://dspace.lib.fcu.edu.tw/handle/2377/1331-
dc.description.abstractAn 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.
dc.description.sponsorship東華大學,花蓮縣
dc.format.extent9p.
dc.format.extent26160 bytes
dc.format.mimetypeapplication/pdf
dc.language.isozh_TW
dc.relation.ispartofseries2002 ICS會議
dc.subjectnetwork security
dc.subjectattack graph
dc.subjectatomic attacks
dc.subjectinteger programming
dc.subject.otherCryptography and Information Security
dc.titleCost Minimization for Thwarting Network Attacks
分類:2002年 ICS 國際計算機會議

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


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