4.7 Article

Man-in-the-middle attack against cyber-physical systems under random access protocol

Journal

INFORMATION SCIENCES
Volume 576, Issue -, Pages 708-724

Publisher

ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2021.07.083

Keywords

Cyber-physical systems; Man-in-the-middle attack; Kalman filter; Kullback-Leibler divergence; Linear quadratic Gaussian; Random access protocol

Funding

  1. Funds of the National Natural Science Foundation of China [61621004, U1908213]
  2. National Key Research and Development Program of China [2020YFE0201100]
  3. Research Fund of State Key Laboratory of Synthetical Automation for Process Industries [2018ZCX03]

Ask authors/readers for more resources

This paper investigates a man-in-the-middle attack against cyber-physical systems under a random access protocol scheduling. A novel attack model is proposed to overcome protocol-induced effects, with strictly stealthy and epsilon-stealthy attacks designed to achieve optimal attack performance. The attack parameters are obtained through solving linear matrix inequalities, semi-definite programming problems, and convex optimization problems.
This paper investigates the man-in-the-middle (MITM) attack against cyber-physical systems (CPSs) under the random access protocol (RAP) scheduling, where an attacker intercepts and modifies the transmitted data and then forwards them on to degrade the system performance. The RAP schedules the sensing devices to avoid data collisions, where only one node is allowed to access the shared communication channel at each time instant. Hence, it makes the existing stealthy attacks invalid. To overcome the protocol-induced effects, a novel attack model utilizing only part of the measurements at each time instant is proposed, based on which the strictly stealthy and epsilon-stealthy attacks are designed. For strictly stealthy attack, the Kullback-Leibler divergence (KLD)-based stealthy constraint is converted into a linear matrix inequality and then a semi-definite program problem is constructed to obtain the optimal attack parameters. In such case, the attack performance is optimal but limited. Furthermore, an epsilon-stealthy attack is proposed to achieve higher attack performance, where the analytical attack parameters are obtained by solving an off-line convex optimization problem. Finally, simulations are provided to verify the results. (C) 2021 Elsevier Inc. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

Article Computer Science, Theory & Methods

A real-time scratchpad-centric OS with predictable inter/intra-core communication for multi-core embedded systems

Rohan Tabish, Renato Mancuso, Saud Wasly, Rodolfo Pellizzoni, Marco Caccamo

REAL-TIME SYSTEMS (2019)

Article Chemistry, Analytical

Intelligent Sensing Using Multiple Sensors for Material Characterization

Ali M. Albishi, Seyed H. Mirjahanmardi, Abdulbaset M. Ali, Vahid Nayyeri, Saud M. Wasly, Omar M. Ramahi

SENSORS (2019)

Article Automation & Control Systems

Distributed Predefined-Time Dual-Mode Energy Management for a Microgrid Over Event-Triggered Communication

Li-Ning Liu, Guang-Hong Yang, Saud Wasly

Summary: This article investigates the coordination dual-mode energy management problem for a microgrid, proposing a novel distributed algorithm that adaptively responds to mode switching and obtains optimal operation in a distributed way. Compared with existing algorithms, this algorithm has a predefined convergence time and an event-triggered communication strategy, greatly reducing communication resource consumption.

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS (2023)

Proceedings Paper Computer Science, Artificial Intelligence

ERAsim: A Flexible Python-based Architectural Modeling and Simulation Framework

Saud Wasly

Summary: This paper introduces a system-level hardware modeling and simulation framework based on Python with an emphasis on ease of use, utilizing meta-tracing JIT compilation techniques to improve simulation speed. The framework supports modeling components of different accuracies and combines time-driven simulation with transaction-level modeling to enable precise timing estimates.

2020 8TH INTERNATIONAL CONFERENCE ON INTELLIGENT AND ADVANCED SYSTEMS (ICIAS) (2021)

Proceedings Paper Computer Science, Theory & Methods

HopliteBuf: FPGA NoCs with Provably Stall-Free FIFOs

Tushar Garg, Saud Wasly, Rodolfo Pellizzoni, Nachiket Kapre

PROCEEDINGS OF THE 2019 ACM/SIGDA INTERNATIONAL SYMPOSIUM ON FIELD-PROGRAMMABLE GATE ARRAYS (FPGA'19) (2019)

Proceedings Paper Computer Science, Hardware & Architecture

Bundled Scheduling of Parallel Real-time Tasks

Saud Wasly, Rodolfo Pellizzoni

25TH IEEE REAL-TIME AND EMBEDDED TECHNOLOGY AND APPLICATIONS SYMPOSIUM (RTAS 2019) (2019)

Proceedings Paper Computer Science, Information Systems

HopliteRT: An Efficient FPGA NoC for Real-time Applications

Saud Wasly, Rodolfo Pellizzoni, Nachiket Kapre

2017 INTERNATIONAL CONFERENCE ON FIELD PROGRAMMABLE TECHNOLOGY (ICFPT) (2017)

Proceedings Paper Computer Science, Hardware & Architecture

A Reliable and Predictable Scratchpad-Centric OS for Multi-Core Embedded Systems

Rohan Tabish, Renato Mancuso, Saud Wasly, Sujit S. Phatak, Rodolfo Pellizzoni, Marco Caccamo

PROCEEDINGS OF THE 23RD IEEE REAL-TIME AND EMBEDDED TECHNOLOGY AND APPLICATIONS SYMPOSIUM (RTAS 2017) (2017)

Proceedings Paper Computer Science, Hardware & Architecture

Memory Efficient Global Scheduling of Real-time Tasks

Ahmed Alhammad, Saud Wasly, Rodolfo Pellizzoni

21ST IEEE REAL-TIME AND EMBEDDED TECHNOLOGY AND APPLICATIONS SYMPOSIUM (RTAS 2015) (2015)

Article Computer Science, Information Systems

A consensus model considers managing manipulative and overconfident behaviours in large-scale group decision-making

Xia Liang, Jie Guo, Peide Liu

Summary: This paper investigates a novel consensus model based on social networks to manage manipulative and overconfident behaviors in large-scale group decision-making. By proposing a novel clustering model and improved methods, the consensus reaching is effectively facilitated. The feedback mechanism and management approach are employed to handle decision makers' behaviors. Simulation experiments and comparative analysis demonstrate the effectiveness of the model.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

CGN: Class gradient network for the construction of adversarial samples

Xiang Li, Haiwang Guo, Xinyang Deng, Wen Jiang

Summary: This paper proposes a method based on class gradient networks for generating high-quality adversarial samples. By introducing a high-level class gradient matrix and combining classification loss and perturbation loss, the method demonstrates superiority in the transferability of adversarial samples on targeted attacks.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

Distinguishing latent interaction types from implicit feedbacks for recommendation

Lingyun Lu, Bang Wang, Zizhuo Zhang, Shenghao Liu

Summary: Many recommendation algorithms only rely on implicit feedbacks due to privacy concerns. However, the encoding of interaction types is often ignored. This paper proposes a relation-aware neural model that classifies implicit feedbacks by encoding edges, thereby enhancing recommendation performance.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

Proximity-based density description with regularized reconstruction algorithm for anomaly detection

Jaehong Yu, Hyungrok Do

Summary: This study discusses unsupervised anomaly detection using one-class classification, which determines whether a new instance belongs to the target class by constructing a decision boundary. The proposed method uses a proximity-based density description and a regularized reconstruction algorithm to overcome the limitations of existing one-class classification methods. Experimental results demonstrate the superior performance of the proposed algorithm.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

Non-iterative border-peeling clustering algorithm based on swap strategy

Hui Tu, Shifei Ding, Xiao Xu, Haiwei Hou, Chao Li, Ling Ding

Summary: Border-Peeling algorithm is a density-based clustering algorithm, but its complexity and issues on unbalanced datasets restrict its application. This paper proposes a non-iterative border-peeling clustering algorithm, which improves the clustering performance by distinguishing and associating core points and border points.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

A two-stage denoising framework for zero-shot learning with noisy labels

Long Tang, Pan Zhao, Zhigeng Pan, Xingxing Duan, Panos M. Pardalos

Summary: In this work, a two-stage denoising framework (TSDF) is proposed for zero-shot learning (ZSL) to address the issue of noisy labels. The framework includes a tailored loss function to remove suspected noisy-label instances and a ramp-style loss function to reduce the negative impact of remaining noisy labels. In addition, a dynamic screening strategy (DSS) is developed to efficiently handle the nonconvexity of the ramp-style loss.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

Selection of a viable blockchain service provider for data management within the internet of medical things: An MCDM approach to Indian healthcare

Raghunathan Krishankumar, Sundararajan Dhruva, Kattur S. Ravichandran, Samarjit Kar

Summary: Health 4.0 is gaining global attention for better healthcare through digital technologies. This study proposes a new decision-making framework for selecting viable blockchain service providers in the Internet of Medical Things (IoMT). The framework addresses the limitations in previous studies and demonstrates its applicability in the Indian healthcare sector. The results show the top ranking BSPs, the importance of various criteria, and the effectiveness of the developed model.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

Q-learning with heterogeneous update strategy

Tao Tan, Hong Xie, Liang Feng

Summary: This paper proposes a heterogeneous update idea and designs HetUp Q-learning algorithm to enlarge the normalized gap by overestimating the Q-value corresponding to the optimal action and underestimating the Q-value corresponding to the other actions. To address the limitation, a softmax strategy is applied to estimate the optimal action, resulting in HetUpSoft Q-learning and HetUpSoft DQN. Extensive experimental results show significant improvements over SOTA baselines.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

Dyformer: A dynamic transformer-based architecture for multivariate time series classification

Chao Yang, Xianzhi Wang, Lina Yao, Guodong Long, Guandong Xu

Summary: This paper proposes a dynamic transformer-based architecture called Dyformer for multivariate time series classification. Dyformer captures multi-scale features through hierarchical pooling and adaptive learning strategies, and improves model performance by introducing feature-map-wise attention mechanisms and a joint loss function.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

ESSENT: an arithmetic optimization algorithm with enhanced scatter search strategy for automated test case generation

Xiguang Li, Baolu Feng, Yunhe Sun, Ammar Hawbani, Saeed Hammod Alsamhi, Liang Zhao

Summary: This paper proposes an enhanced scatter search strategy, using opposition-based learning, to solve the problem of automated test case generation based on path coverage (ATCG-PC). The proposed ESSENT algorithm selects the path with the lowest path entropy among the uncovered paths as the target path and generates new test cases to cover the target path by modifying the dimensions of existing test cases. Experimental results show that the ESSENT algorithm outperforms other state-of-the-art algorithms, achieving maximum path coverage with fewer test cases.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

An attention based approach for automated account linkage in federated identity management

Shirin Dabbaghi Varnosfaderani, Piotr Kasprzak, Aytaj Badirova, Ralph Krimmel, Christof Pohl, Ramin Yahyapour

Summary: Linking digital accounts belonging to the same user is crucial for security, user satisfaction, and next-generation service development. However, research on account linkage is mainly focused on social networks, and there is a lack of studies in other domains. To address this, we propose SmartSSO, a framework that automates the account linkage process by analyzing user routines and behavior during login processes. Our experiments on a large dataset show that SmartSSO achieves over 98% accuracy in hit-precision.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

A memetic algorithm with fuzzy-based population control for the joint order batching and picker routing problem

Renchao Wu, Jianjun He, Xin Li, Zuguo Chen

Summary: This paper proposes a memetic algorithm with fuzzy-based population control (MA-FPC) to solve the joint order batching and picker routing problem (JOBPRP). The algorithm incorporates batch exchange crossover and a two-level local improvement procedure. Experimental results show that MA-FPC outperforms existing algorithms in terms of solution quality.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

Refining one-class representation: A unified transformer for unsupervised time-series anomaly detection

Guoxiang Zhong, Fagui Liu, Jun Jiang, Bin Wang, C. L. Philip Chen

Summary: In this study, we propose the AMFormer framework to address the problem of mixed normal and anomaly samples in deep unsupervised time-series anomaly detection. By refining the one-class representation and introducing the masked operation mechanism and cost sensitive learning theory, our approach significantly improves anomaly detection performance.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

A data-driven optimisation method for a class of problems with redundant variables and indefinite objective functions

Jin Zhou, Kang Zhou, Gexiang Zhang, Ferrante Neri, Wangyang Shen, Weiping Jin

Summary: In this paper, the authors focus on the issue of multi-objective optimisation problems with redundant variables and indefinite objective functions (MOPRVIF) in practical problem-solving. They propose a dual data-driven method for solving this problem, which consists of eliminating redundant variables, constructing objective functions, selecting evolution operators, and using a multi-objective evolutionary algorithm. The experiments conducted on two different problem domains demonstrate the effectiveness, practicality, and scalability of the proposed method.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

A Monte Carlo fuzzy logistic regression framework against imbalance and separation

Georgios Charizanos, Haydar Demirhan, Duygu Icen

Summary: This article proposes a new fuzzy logistic regression framework that addresses the problems of separation and imbalance while maintaining the interpretability of classical logistic regression. By fuzzifying binary variables and classifying subjects based on a fuzzy threshold, the framework demonstrates superior performance on imbalanced datasets.

INFORMATION SCIENCES (2024)