學術產出-會議論文
文章檢視/開啟
書目匯出
-
題名 Near Optimal Protection Strategies Against Targeted Attacks on the Core Node of a Network 作者 林義倫
Lin, Yi-Luen
Lin, Frank Yeong-Sung
Tsang, Po-Hao貢獻者 資博學一 日期 2007-04 上傳時間 2022-01-06 摘要 The issue of information security has attracted increasing attention in recent years. In network attack and defense scenarios, attackers and defenders constantly change their respective strategies. Given the importance of improving information security, a growing number of researchers are now focusing on how to combine the concepts of network survivability and protection against malicious attacks. As defense resources are limited, we propose effective resource allocation strategies that maximize an attacker`s costs and minimize the probability that the "core node" of a network will be compromised, thereby improving its protection. The two problems are analyzed as a mixed, nonlinear, integer programming optimization problem. The solution approach is based on the Lagrangean relaxation method, which solves this complicated problem effectively. We also evaluate the survivability of real networks, such as scale-free networks 關聯 Proceedings of the Second International Conference on Availability, Reliability and Security (ARES`07), IEEE, pp.213-222 資料類型 conference DOI https://doi.org/10.1109/ARES.2007.107 dc.contributor 資博學一 dc.creator (作者) 林義倫 dc.creator (作者) Lin, Yi-Luen dc.creator (作者) Lin, Frank Yeong-Sung dc.creator (作者) Tsang, Po-Hao dc.date (日期) 2007-04 dc.date.accessioned 2022-01-06 - dc.date.available 2022-01-06 - dc.date.issued (上傳時間) 2022-01-06 - dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/138641 - dc.description.abstract (摘要) The issue of information security has attracted increasing attention in recent years. In network attack and defense scenarios, attackers and defenders constantly change their respective strategies. Given the importance of improving information security, a growing number of researchers are now focusing on how to combine the concepts of network survivability and protection against malicious attacks. As defense resources are limited, we propose effective resource allocation strategies that maximize an attacker`s costs and minimize the probability that the "core node" of a network will be compromised, thereby improving its protection. The two problems are analyzed as a mixed, nonlinear, integer programming optimization problem. The solution approach is based on the Lagrangean relaxation method, which solves this complicated problem effectively. We also evaluate the survivability of real networks, such as scale-free networks dc.format.extent 262006 bytes - dc.format.mimetype application/pdf - dc.relation (關聯) Proceedings of the Second International Conference on Availability, Reliability and Security (ARES`07), IEEE, pp.213-222 dc.title (題名) Near Optimal Protection Strategies Against Targeted Attacks on the Core Node of a Network dc.type (資料類型) conference dc.identifier.doi (DOI) 10.1109/ARES.2007.107 dc.doi.uri (DOI) https://doi.org/10.1109/ARES.2007.107
