Protecting widely used deep classifiers against black-box adversarial attacks is a recent research challenge in many security-related areas, including malware classification. This class of attacks relies on optimizing a sequence of highly similar queries to bypass given classifiers. In this article, we leverage this property and propose a history-based method named,stateful query analysis (SQA), which analyzes sequences of queries received by a malware classifier to detect black-box adversarial attacks on an industrial Internet of Things (IIoT). In the SQA pipeline, there are two components, namely the similarity encoder and the classifier, both based on convolutional neural networks. Unlike the state-of-the-art methods, which aim to identify individual adversarial examples, tracking the history of queries allows our method to identify adversarial scenarios and abort attacks before their completion. We optimize SQA using different combinations of hyperparameters on an advanced risc machine (ARM)-based IIoT malware dataset, widely adopted for malware threat hunting in industry 4.0. The use of a novel distance metric in calculating the loss function of the similarity encoder results in more disentangled representations and improves the performance of our method. Our evaluations demonstrate the validity of SQA via a detection rate of 93.1% over a wide range of adversarial examples.

The security of Industrial Control Systems is of high importance as they play a critical role in uninterrupted services provided by Critical Infrastructure operators. Due to a large number of devices and their geographical distribution, Industrial Control Systems need efficient automatic cyber-attack detection and attribution methods, which suggests us AI-based approaches. This paper proposes a model called SteelEye based on Semi-Deep Learning for accurate detection and attribution of cyber-attacks at the application layer in industrial control systems. The proposed model depends on Bag of Features for accurate detection of cyber-attacks and utilizes Categorical Boosting as the base predictor for attack attribution. Empirical results demonstrate that SteelEye remarkably outperforms state-of-the-art cyber-attack detection and attribution methods in terms of accuracy, precision, recall, and Fl-score.

Abstract A flaky test is a test that may lead to different results in different runs on a single code under test without any change in the test code. Test flakiness is a noxious phenomenon that slows down software deployment, and increases the expenditures in a broad spectrum of platforms such as software‐defined networks and Internet of Things environments. Industrial institutes and labs have conducted a whole lot of research projects aiming at tackling this problem. Although this issue has been receiving more attention from academia in recent years, the academic research community is still behind the industry in this area. A systematic review and trend analysis on the existing approaches for detecting and root causing flaky tests can pave the way for future research on this topic. This can help academia keep pace with industrial advancements and even lead the research in this field. This article first presents a comprehensive review of recent achievements of the industry as well as academia regarding the detection and mitigation of flaky tests. In the next step, recent trends in this line of research are analyzed and a roadmap is established for future research.

There are two main types of process scheduling algorithms commonly used in aircraft/spacecraft avionics systems. The first category consists of dynamic algorithms, which dynamically assign priorities to processes on the basis of runtime parameters. The second category consists of static algorithms, which statically determine priorities before runtime. The main disadvantage of applying dynamic process scheduling algorithms to avionics systems is the extra runtime overhead produced by these algorithms. This overhead is mainly related to the time required to sort active processes in the ready queue upon each process preemption or the arrival of each new process. The mentioned overhead encourages the use of static algorithms. But static algorithms have their own disadvantages. In fact, these algorithms bound the maximum available CPU utilization and have difficulties with non-periodic processes. This paper proposes and evaluates an approach to exploiting skewed associative memories in order to replace the time-consuming sorting operation by an efficient search operation. Both analytical models and simulation results show that the proposed approach can reduce the time complexity of the runtime overhead of dynamic scheduling algorithms (in terms of n the number of active processes) from O(nlogn) to O(n). This can considerably increase the performance of dynamic scheduling algorithms and make them much more feasible to be used in aircraft/spacecraft avionics systems.