Alena Chang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Alena Chang has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Guoliang Xue
Arizona State University, Tempe, Arizona, USA
2 shared publications - Yinxin Wan
University of Massachusetts Boston, Boston, Massachusetts, USA
2 shared publications - Abdulhakim Sabur
College of Computer Science and Engineering, Taibah University, Madinah 42353, Saudi Arabia
1 shared publication - Arunabha Sen
Arizona State University
1 shared publication - Kuai Xu
Arizona State University, Glendale, Arizona, USA
1 shared publication - Xuanli Lin
Arizona State University, Tempe, AZ, USA
1 shared publication
Latest Publications
- 13 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Network
- Vol. 38 (1) , 79-86
Entanglement Distribution in Satellite-Based Dynamic Quantum Networks
Low Earth Orbit (LEO) satellites present a compelling opportunity for the establishment of a global quantum information network. However, satellite-based entanglement distribution from a networking perspective has not been fully investigated. Existing works often do not account for satellite movement over time when distributing entanglement and/or often do not permit entanglement distribution along inter-satellite links, which are two shortcomings we address in this paper. We first define a system model which considers both satellite movement over time and inter-satellite links. We next formulate the optimal entanglement distribution (OED) problem under this system model and show how to convert the OED problem in a dynamic physical network to one in a static logical graph which can be used to solve the OED problem in the dynamic physical network. We then propose a polynomial time greedy algorithm for computing satellite-assisted multi-hop entanglement paths. We also design an integer linear programming (ILP)-based algorithm to compute optimal solutions as a baseline to study the performance of our greedy algorithm. We present evaluation results to demonstrate the advantage of our model and algorithms.
- 13 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Network
- Vol. 38 (1) , 79-86
Entanglement Distribution in Satellite-Based Dynamic Quantum Networks
Low Earth Orbit (LEO) satellites present a compelling opportunity for the establishment of a global quantum information network. However, satellite-based entanglement distribution from a networking perspective has not been fully investigated. Existing works often do not account for satellite movement over time when distributing entanglement and/or often do not permit entanglement distribution along inter-satellite links, which are two shortcomings we address in this paper. We first define a system model which considers both satellite movement over time and inter-satellite links. We next formulate the optimal entanglement distribution (OED) problem under this system model and show how to convert the OED problem in a dynamic physical network to one in a static logical graph which can be used to solve the OED problem in the dynamic physical network. We then propose a polynomial time greedy algorithm for computing satellite-assisted multi-hop entanglement paths. We also design an integer linear programming (ILP)-based algorithm to compute optimal solutions as a baseline to study the performance of our greedy algorithm. We present evaluation results to demonstrate the advantage of our model and algorithms.
- Open Access
- 9 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 315-326
IoT System Vulnerability Analysis and Network Hardening with Shortest Attack Trace in a Weighted Attack Graph
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.
- 9 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 315-326
Open AccessIoT System Vulnerability Analysis and Network Hardening with Shortest Attack Trace in a Weighted Attack Graph
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.