IoT System Vulnerability Analysis and Network Hardening with Shortest Attack Trace in a Weighted Attack Graph
Open Access
- 9 May 2023
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 315-326
Abstract
In recent years, Internet of Things (IoT) devices have been extensively deployed in edge networks, including smart homes and offices. Despite the exciting opportunities afforded by the advancements in the IoT, it also introduces new attack vectors and vulnerabilities in the system. Existing studies have shown that the attack graph is an effective model for performing system-level analysis of IoT security. In this paper, we study IoT system vulnerability analysis and network hardening. We first extend the concept of attack graph to weighted attack graph and design a novel algorithm for computing a shortest attack trace in a weighted attack graph. We then formulate the network hardening problem. We prove that this problem is NP-hard, and then design an exact algorithm and a heuristic algorithm to solve it. Extensive experiments on 9 synthetic IoT systems and 2 real-world smart home IoT testbeds demonstrate that our shortest attack trace algorithm is robust and fast, and our heuristic network hardening algorithm is efficient in producing near optimal results compared to the exact algorithm.Keywords
This publication has 20 references indexed in Scilit:
- Insecure to the touch2017
- IoT Goes Nuclear: Creating a ZigBee Chain Reaction2017
- Exploring attack graph for cost-benefit security hardening: A probabilistic approachComputers & Security, 2013
- A Heuristic Approach to Minimum-Cost Network Hardening Using Attack Graph2008
- An Attack Graph-Based Probabilistic Security Metric2008
- A scalable approach to attack graph generation2006
- Automated generation and analysis of attack graphs2005
- Scalable, graph-based network vulnerability analysis2002
- XSB as a deductive database1994
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987