東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁 到查詢結果 [ null ]

切換: 標籤 | MARC模式 | ISBD

Attack Countermeasure Trees: A Non-s...

Roy, Arpan.

FindBook

Google Book

Amazon

博客來

Attack Countermeasure Trees: A Non-state-space Approach Towards Analyzing Security and Finding Optimal Countermeasure Sets.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Attack Countermeasure Trees: A Non-state-space Approach Towards Analyzing Security and Finding Optimal Countermeasure Sets./
作者:	Roy, Arpan.
面頁冊數:	74 p.
附註:	Source: Masters Abstracts International, Volume: 49-03, page: 1968.
Contained By:	Masters Abstracts International49-03.
標題:	Engineering, Computer. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1484116
ISBN:	9781124406718

Attack Countermeasure Trees: A Non-state-space Approach Towards Analyzing Security and Finding Optimal Countermeasure Sets.
Roy, Arpan.

Attack Countermeasure Trees: A Non-state-space Approach Towards Analyzing Security and Finding Optimal Countermeasure Sets. - 74 p.

Source: Masters Abstracts International, Volume: 49-03, page: 1968.

Thesis (M.S.)--Duke University, 2010.

Attack tree (AT) is one of the widely used combinatorial models in security analysis. The basic formalism of AT does not take into account defense mechanisms. Defense trees (DTs) have been developed to investigate the effect of defense mechanisms using measures such as attack cost, security investment cost, return on attack (ROA) and return on investment (ROI). DT, however, places defense mechanisms only at the leaf nodes and the corresponding ROI/ROA analysis does not incorporate the probabilities of attack. In attack response tree (ART), attack and response are both captured but ART suffers from the problem of state-space explosion, since solution of ART is obtained by means of a partially observable Markov Decision Process model. In this thesis, we present a novel attack tree paradigm called attack countermeasure tree (ACT) which takes a purely noon-state-space approach to security analysis taking into account attacks as well as countermeasures (in the form of detection and mitigation techniques). In ACT, detection and mitigation are allowed not just at the leaf node but also at the intermediate nodes while at the same time the state-space explosion problem is avoided in its analysis. We propose algorithms to perform single and multiobjective optimization to find optimal countermeasure sets under different sets of budgetary constraints. We illustrate the features of ACT using several case studies.

ISBN: 9781124406718Subjects--Topical Terms:

1669061
Engineering, Computer.

Attack Countermeasure Trees: A Non-state-space Approach Towards Analyzing Security and Finding Optimal Countermeasure Sets.
LDR:02451nam 2200313 4500 001 1401183
005 20111013150318.5
008 130515s2010 ||||||||||||||||| ||eng d
020 $a 9781124406718
035 $a (UMI)AAI1484116
035 $a AAI1484116
040 $a UMI $c UMI
100 1 $a Roy, Arpan. $3 1680301
245 1 0 $a Attack Countermeasure Trees: A Non-state-space Approach Towards Analyzing Security and Finding Optimal Countermeasure Sets.
300 $a 74 p.
500 $a Source: Masters Abstracts International, Volume: 49-03, page: 1968.
500 $a Adviser: Kishor S. Trivedi.
502 $a Thesis (M.S.)--Duke University, 2010.
520 $a Attack tree (AT) is one of the widely used combinatorial models in security analysis. The basic formalism of AT does not take into account defense mechanisms. Defense trees (DTs) have been developed to investigate the effect of defense mechanisms using measures such as attack cost, security investment cost, return on attack (ROA) and return on investment (ROI). DT, however, places defense mechanisms only at the leaf nodes and the corresponding ROI/ROA analysis does not incorporate the probabilities of attack. In attack response tree (ART), attack and response are both captured but ART suffers from the problem of state-space explosion, since solution of ART is obtained by means of a partially observable Markov Decision Process model. In this thesis, we present a novel attack tree paradigm called attack countermeasure tree (ACT) which takes a purely noon-state-space approach to security analysis taking into account attacks as well as countermeasures (in the form of detection and mitigation techniques). In ACT, detection and mitigation are allowed not just at the leaf node but also at the intermediate nodes while at the same time the state-space explosion problem is avoided in its analysis. We propose algorithms to perform single and multiobjective optimization to find optimal countermeasure sets under different sets of budgetary constraints. We illustrate the features of ACT using several case studies.
590 $a School code: 0066.
650 4 $a Engineering, Computer. $3 1669061
650 4 $a Engineering, Electronics and Electrical. $3 626636
650 4 $a Computer Science. $3 626642
690 $a 0464
690 $a 0544
690 $a 0984
710 2 $a Duke University. $b Electrical and Computer Engineering. $3 1032075
773 0 $t Masters Abstracts International $g 49-03.
790 1 0 $a Trivedi, Kishor S., $e advisor
790 1 0 $a Dwyer, Chris L. $e committee member
790 1 0 $a Lee, Benjamin C. $e committee member
790 $a 0066
791 $a M.S.
792 $a 2010
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1484116