| Summary: | 碩士 === 國立臺灣大學 === 資訊管理學研究所 === 94 === Dependency on the Internet is giving cyber criminals increasing opportunities to steal information. Information theft, one of the most damaging cyber-crimes, not only causes property damage and monetary loss to victims, it can also ruin their reputations. As a result, research into developing defense strategies against information theft on the Internet is a pressing need.
In this paper, we model an offence-defense scenario as a two-level mathematical programming problem. In the inner problem, defined by the AS model, an attacker allocates his limited attack power intelligently to the targeted network in order to steal as much valuable information as possible. Meanwhile, in the outer problem, defined by the DRAS model, the operator of the targeted network allocates limited defense resources appropriately to minimize the damage incurred by information theft. The Lagrangean relaxation-based algorithm is adopted to solve the AS problem, and a subgradient-based algorithm is proposed to solve the DRAS problem.
|
|---|
