Full metadata record
DC FieldValueLanguage
dc.contributor.authorYiğit, Beytüllah-
dc.contributor.authorGür, Gürkan-
dc.contributor.authorAlagöz, Fatih-
dc.contributor.authorTellenbach, Bernhard-
dc.date.accessioned2019-02-26T17:26:11Z-
dc.date.available2019-02-26T17:26:11Z-
dc.date.issued2019-
dc.identifier.issn1570-8705de_CH
dc.identifier.issn1570-8713de_CH
dc.identifier.urihttps://digitalcollection.zhaw.ch/handle/11475/15675-
dc.description.abstractThe Internet of Things (IoT) contains a diverse set of sensors, actuators and other Internet-connected devices communicating, processing data and performing a multitude of functions. It is emerging as an integral part of societal infrastructure enabling smart services. However, these connected objects might have various vulnerabilities that can lead to serious security compromises and breaches. Securing and hardening of IoT systems is thus of vital importance. In that regard, attack graphs provide analytical support to prevent multistep network attacks by showing all possible sequences of vulnerabilities and their interactions. Since attack graphs generally consist of a very large number of nodes, it is computationally challenging to analyze them for network hardening. In this paper, we propose a greedy algorithm using compact attack graphs to find a cost-effective solution to protect IoT systems. First, we extract all possible attack paths which reach predetermined critical resources embedded in the network. Then, exploit or initial condition with minimum effective cost is selected to be removed. This cost is calculated as a function of contribution to attack paths (the higher, the better) and removal cost (the lower, the better). This process continues iteratively until the total cost exceeds the allocated budget. The experimental results show that our algorithm scales almost linearly with the network size and it can be applied to large-scale graphs with a very large number of IoT nodes. In addition to network-hardening, our proposal measures the security level of the network in every step to demonstrate the vulnerability grade of the system.de_CH
dc.language.isoende_CH
dc.publisherElsevierde_CH
dc.relation.ispartofAd Hoc Networksde_CH
dc.rightsLicence according to publishing contractde_CH
dc.subject.ddc004: Informatikde_CH
dc.titleCost-aware securing of IoT systems using attack graphsde_CH
dc.typeBeitrag in wissenschaftlicher Zeitschriftde_CH
dcterms.typeTextde_CH
zhaw.departementSchool of Engineeringde_CH
zhaw.organisationalunitInstitut für Informatik (InIT)de_CH
dc.identifier.doi10.1016/j.adhoc.2018.10.024de_CH
zhaw.funding.euNode_CH
zhaw.originated.zhawYesde_CH
zhaw.pages.end35de_CH
zhaw.pages.start23de_CH
zhaw.publication.statuspublishedVersionde_CH
zhaw.volume86de_CH
zhaw.publication.reviewPeer review (Publikation)de_CH
zhaw.webfeedInformation Securityde_CH
Appears in collections:Publikationen School of Engineering

Files in This Item:
There are no files associated with this item.
Show simple item record
Yiğit, B., Gür, G., Alagöz, F., & Tellenbach, B. (2019). Cost-aware securing of IoT systems using attack graphs. Ad Hoc Networks, 86, 23–35. https://doi.org/10.1016/j.adhoc.2018.10.024
Yiğit, B. et al. (2019) ‘Cost-aware securing of IoT systems using attack graphs’, Ad Hoc Networks, 86, pp. 23–35. Available at: https://doi.org/10.1016/j.adhoc.2018.10.024.
B. Yiğit, G. Gür, F. Alagöz, and B. Tellenbach, “Cost-aware securing of IoT systems using attack graphs,” Ad Hoc Networks, vol. 86, pp. 23–35, 2019, doi: 10.1016/j.adhoc.2018.10.024.
YIĞIT, Beytüllah, Gürkan GÜR, Fatih ALAGÖZ und Bernhard TELLENBACH, 2019. Cost-aware securing of IoT systems using attack graphs. Ad Hoc Networks. 2019. Bd. 86, S. 23–35. DOI 10.1016/j.adhoc.2018.10.024
Yiğit, Beytüllah, Gürkan Gür, Fatih Alagöz, and Bernhard Tellenbach. 2019. “Cost-Aware Securing of IoT Systems Using Attack Graphs.” Ad Hoc Networks 86: 23–35. https://doi.org/10.1016/j.adhoc.2018.10.024.
Yiğit, Beytüllah, et al. “Cost-Aware Securing of IoT Systems Using Attack Graphs.” Ad Hoc Networks, vol. 86, 2019, pp. 23–35, https://doi.org/10.1016/j.adhoc.2018.10.024.


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