TY - GEN
T1 - Influence evaluation of centrality-based random scanning strategy on early worm propagation rate
AU - Kown, Su Kyung
AU - Jang, Bongsoo
AU - Lee, Byoung Dai
AU - Do, Younghae
AU - Baek, Hunki
AU - Choi, Yoon Ho
N1 - Publisher Copyright:
© Springer International Publishing AG 2017.
PY - 2017
Y1 - 2017
N2 - Smart devices interconnected through Internet became one of everyday items. In particular, we are now able to access Internet anywhere and anytime with our smartphones. To support the ad-hoc access to Internet by using smartphones, the computer network structure has become more complex. Also, a certain network node is highly connected to support the diverse Internet services. In this paper, we note that when a node is infected by malicious programs, their propagation speeds from the node with a high level of centrality will be faster than those from the node with a low level of centrality, which identifies the most important nodes within a network. From experiments under diverse worm propagation parameters and the well-known network topologies, we evaluate the influence of Centrality-based random scanning strategy on early worm propagation rate. Therefore, we show that centrality-based random scanning strategy, where an initial infected node selects the victim based on the level of centrality, can make random scanning worms propagate rapidly compared to Anonymity-based random scanning strategy, where an initial infected node selects the victim uniformly.
AB - Smart devices interconnected through Internet became one of everyday items. In particular, we are now able to access Internet anywhere and anytime with our smartphones. To support the ad-hoc access to Internet by using smartphones, the computer network structure has become more complex. Also, a certain network node is highly connected to support the diverse Internet services. In this paper, we note that when a node is infected by malicious programs, their propagation speeds from the node with a high level of centrality will be faster than those from the node with a low level of centrality, which identifies the most important nodes within a network. From experiments under diverse worm propagation parameters and the well-known network topologies, we evaluate the influence of Centrality-based random scanning strategy on early worm propagation rate. Therefore, we show that centrality-based random scanning strategy, where an initial infected node selects the victim based on the level of centrality, can make random scanning worms propagate rapidly compared to Anonymity-based random scanning strategy, where an initial infected node selects the victim uniformly.
KW - Anonymity-based random scanning strategy
KW - Centrality theory
KW - Centrality-based random scanning strategy
KW - Worm propagation
UR - http://www.scopus.com/inward/record.url?scp=85017600010&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-56549-1_8
DO - 10.1007/978-3-319-56549-1_8
M3 - Conference contribution
AN - SCOPUS:85017600010
SN - 9783319565484
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 90
EP - 101
BT - Information Security Applications - 17th International Workshop, WISA 2016, Revised Selected Papers
A2 - Choi, Dooho
A2 - Guilley , Sylvain
PB - Springer Verlag
T2 - 17th International Workshop on Information Security Applications, WISA 2016
Y2 - 25 August 2016 through 25 August 2016
ER -