File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

장봉수

Jang, Bongsoo
Computational Mathematical Science Lab.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.conferencePlace KO -
dc.citation.endPage 101 -
dc.citation.startPage 90 -
dc.citation.title 17th International Workshop on Information Security Applications (WISA 2016) -
dc.citation.volume 10144 LNCS -
dc.contributor.author Kown, Su-kyung -
dc.contributor.author Jang, Bongsoo -
dc.contributor.author Lee, Byoung-Dai -
dc.contributor.author Do, Younghae -
dc.contributor.author Baek, Hunki -
dc.contributor.author Choi, Yoon-Ho -
dc.date.accessioned 2023-12-19T20:10:01Z -
dc.date.available 2023-12-19T20:10:01Z -
dc.date.created 2017-05-22 -
dc.date.issued 2016-08-25 -
dc.description.abstract 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. -
dc.identifier.bibliographicCitation 17th International Workshop on Information Security Applications (WISA 2016), v.10144 LNCS, pp.90 - 101 -
dc.identifier.doi 10.1007/978-3-319-56549-1_8 -
dc.identifier.issn 0302-9743 -
dc.identifier.scopusid 2-s2.0-85017600010 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/39728 -
dc.identifier.url https://link.springer.com/chapter/10.1007%2F978-3-319-56549-1_8 -
dc.language 영어 -
dc.publisher International Workshop on Information Security Applications -
dc.title Influence evaluation of centrality-based random scanning strategy on early worm propagation rate -
dc.type Conference Paper -
dc.date.conferenceDate 2016-08-25 -

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.