https://scholars.lib.ntu.edu.tw/handle/123456789/457555
標題: | Near optimal attack strategies for the maximization of information theft | 作者: | Tseng, C.-I YEONG-SUNG LIN Tsang, P.-H. |
關鍵字: | Information Theft; Lagrangean Relaxation; Network Attack; Optimization Problem; Resource Allocation; Scale-free Networks | 公開日期: | 2007 | 卷: | 2 | 起(迄)頁: | 140-145 | 來源出版物: | WMSCI 2007 - The 11th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 13th International Conference on Information Systems Analysis and Synthesis, ISAS 2007 | 摘要: | With the prevalence and varied applications of the Internet, new cyber-crimes are mushrooming all over cyberspace. The crimes are characterized by their "silent" attack behavior, which enables an attacker to exploit the vulnerabilities of a system and steal information, without actually crashing the system. Information theft is a relatively new cyber-crime that not only causes property damage and monetary loss to its victims, but can also ruin their reputations. To detect and analyze the serious impact of information theft, we model it as a mathematical programming problem, defined by the AS model. In the model, an attacker applies his limited attack power intelligently to the targeted network in order to steal as much valuable information as possible. A Lagrangean relaxation-based algorithm is adopted to solve the AS problem, and the "susceptibility" metric is used to evaluate the effect of the attack. |
URI: | https://scholars.lib.ntu.edu.tw/handle/123456789/457555 | SDG/關鍵字: | Information thefts; Lagrangean Relaxation; Network attack; Optimization problems; Scale free networks; Crime; Cybernetics; Economics; Information science; Information systems; Management information systems; Mathematical programming; Problem solving; Resource allocation; Systems analysis; Computer crime |
顯示於: | 資訊管理學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。