Maximization of network robustness considering the effect of escalation and accumulated experience of intelligent attackers

Frank Yeong Sung Lin, Po Hao Tsang, Pei-yu Chen, Huan Ting Chen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

In this paper, we propose a mathematical programming model to describe a network attack scenario. In this problem, the attacker's objective is to compromise multiple core nodes at minimum total attack cost. During the attack actions, the attacker may gain some experience from previous attacks to further reduce the attack costs in the future. Moreover, he can also pay extra fee to escalate his authority on a compromised node to get higher user privileges, so that he will have higher authority to access more information on the node. We measure the impact incurred by information leakage in our model, and adopt some Simulated Annealing-based algorithms to solve the problem.

Original languageEnglish (US)
Title of host publicationWMSCI 2009 - The 13th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 15th International Conference on Information Systems Analysis and Synthesis, ISAS 2009 - Proc.
Pages57-62
Number of pages6
Volume4
StatePublished - 2009
Externally publishedYes
Event13th World Multi-Conference on Systemics, Cybernetics and Informatics, WMSCI 2009, Jointly with the 15th International Conference on Information Systems Analysis and Synthesis, ISAS 2009 - Orlando, FL, United States
Duration: Jul 10 2009Jul 13 2009

Other

Other13th World Multi-Conference on Systemics, Cybernetics and Informatics, WMSCI 2009, Jointly with the 15th International Conference on Information Systems Analysis and Synthesis, ISAS 2009
CountryUnited States
CityOrlando, FL
Period7/10/097/13/09

Fingerprint

Mathematical programming
Simulated annealing
Costs

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Networks and Communications
  • Information Systems

Cite this

Lin, F. Y. S., Tsang, P. H., Chen, P., & Chen, H. T. (2009). Maximization of network robustness considering the effect of escalation and accumulated experience of intelligent attackers. In WMSCI 2009 - The 13th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 15th International Conference on Information Systems Analysis and Synthesis, ISAS 2009 - Proc. (Vol. 4, pp. 57-62)

Maximization of network robustness considering the effect of escalation and accumulated experience of intelligent attackers. / Lin, Frank Yeong Sung; Tsang, Po Hao; Chen, Pei-yu; Chen, Huan Ting.

WMSCI 2009 - The 13th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 15th International Conference on Information Systems Analysis and Synthesis, ISAS 2009 - Proc.. Vol. 4 2009. p. 57-62.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lin, FYS, Tsang, PH, Chen, P & Chen, HT 2009, Maximization of network robustness considering the effect of escalation and accumulated experience of intelligent attackers. in WMSCI 2009 - The 13th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 15th International Conference on Information Systems Analysis and Synthesis, ISAS 2009 - Proc.. vol. 4, pp. 57-62, 13th World Multi-Conference on Systemics, Cybernetics and Informatics, WMSCI 2009, Jointly with the 15th International Conference on Information Systems Analysis and Synthesis, ISAS 2009, Orlando, FL, United States, 7/10/09.
Lin FYS, Tsang PH, Chen P, Chen HT. Maximization of network robustness considering the effect of escalation and accumulated experience of intelligent attackers. In WMSCI 2009 - The 13th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 15th International Conference on Information Systems Analysis and Synthesis, ISAS 2009 - Proc.. Vol. 4. 2009. p. 57-62
Lin, Frank Yeong Sung ; Tsang, Po Hao ; Chen, Pei-yu ; Chen, Huan Ting. / Maximization of network robustness considering the effect of escalation and accumulated experience of intelligent attackers. WMSCI 2009 - The 13th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 15th International Conference on Information Systems Analysis and Synthesis, ISAS 2009 - Proc.. Vol. 4 2009. pp. 57-62
@inproceedings{ee71c77a11bb481fbeb31fc54fc0359f,
title = "Maximization of network robustness considering the effect of escalation and accumulated experience of intelligent attackers",
abstract = "In this paper, we propose a mathematical programming model to describe a network attack scenario. In this problem, the attacker's objective is to compromise multiple core nodes at minimum total attack cost. During the attack actions, the attacker may gain some experience from previous attacks to further reduce the attack costs in the future. Moreover, he can also pay extra fee to escalate his authority on a compromised node to get higher user privileges, so that he will have higher authority to access more information on the node. We measure the impact incurred by information leakage in our model, and adopt some Simulated Annealing-based algorithms to solve the problem.",
author = "Lin, {Frank Yeong Sung} and Tsang, {Po Hao} and Pei-yu Chen and Chen, {Huan Ting}",
year = "2009",
language = "English (US)",
isbn = "1934272620",
volume = "4",
pages = "57--62",
booktitle = "WMSCI 2009 - The 13th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 15th International Conference on Information Systems Analysis and Synthesis, ISAS 2009 - Proc.",

}

TY - GEN

T1 - Maximization of network robustness considering the effect of escalation and accumulated experience of intelligent attackers

AU - Lin, Frank Yeong Sung

AU - Tsang, Po Hao

AU - Chen, Pei-yu

AU - Chen, Huan Ting

PY - 2009

Y1 - 2009

N2 - In this paper, we propose a mathematical programming model to describe a network attack scenario. In this problem, the attacker's objective is to compromise multiple core nodes at minimum total attack cost. During the attack actions, the attacker may gain some experience from previous attacks to further reduce the attack costs in the future. Moreover, he can also pay extra fee to escalate his authority on a compromised node to get higher user privileges, so that he will have higher authority to access more information on the node. We measure the impact incurred by information leakage in our model, and adopt some Simulated Annealing-based algorithms to solve the problem.

AB - In this paper, we propose a mathematical programming model to describe a network attack scenario. In this problem, the attacker's objective is to compromise multiple core nodes at minimum total attack cost. During the attack actions, the attacker may gain some experience from previous attacks to further reduce the attack costs in the future. Moreover, he can also pay extra fee to escalate his authority on a compromised node to get higher user privileges, so that he will have higher authority to access more information on the node. We measure the impact incurred by information leakage in our model, and adopt some Simulated Annealing-based algorithms to solve the problem.

UR - http://www.scopus.com/inward/record.url?scp=84867279654&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867279654&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84867279654

SN - 1934272620

SN - 9781934272626

VL - 4

SP - 57

EP - 62

BT - WMSCI 2009 - The 13th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 15th International Conference on Information Systems Analysis and Synthesis, ISAS 2009 - Proc.

ER -