Maximization of Network Survival Time upon Intelligent and Malicious Attacks
Date Issued
2007
Date
2007
Author(s)
DOI
en-US
Abstract
No information system in a network is absolutely secure. Sophisticated attackers may adopt various types of hacking techniques, such as staff abuses, system vulnerabilities, dictionary attacks, or brute force attacks, to penetrate and damage the system. Therefore, it is essential that effective defense strategies be devised by network administrators to maximize the survival time of critical/core components in networks upon attacks so as to achieve the longest response time.
In this thesis, the problem of maximization of the core node survival time upon intelligent and malicious attacks is considered. The time for an attacker to compromise a node in the network is considered as a random variable, of which the associated CDF is assumed to be a function of the allocated defense resource. The problem is formulated as a mini-max integer programming problem, where the inner (maximization) problem is for the attacker to determine an optimal attack path to the core node so as to maximize his/her success probability under a given time constraint and a given defense resource allocation policy, while the outer (minimization) problem is for the network administrator to adjust his/her defense resource allocation policies so as to minimize the success probability of the attacker. The basic approach to the algorithm development is Lagrangean relaxation and the subgradient method. The efficiency and effectiveness of the proposed algorithms will be evaluated by computational experiments.
Subjects
防禦資源配置策略
網路攻防
存活時間
拉格蘭日鬆弛法
最佳化
Defense Resource Allocation Strategy
Information Security
Network Attack and Defense
Survival Time
Lagrangean Relaxation Method
Optimization
Type
other
File(s)![Thumbnail Image]()
Loading...
Name
ntu-96-R94725021-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):59daa23b4377e97ce76f9b1ac3583d69