Search

With rapid development and deployment of artificial intelligence methods, the Industrial Internet of Things (IIoT) has highly developed to fast tracing industrial communications and optimizing manufacturing processes. In Industry 5.0, hyper-automation process as one of technological trends navigates industrial entities to intelligent devices of the IIoT, cloud computing, smart robotics, smart agile software and embedded components by high complexity and reliability. By increasing data communication in the IIoT environments and cloud computing, the security and safety of hyper-automation process is also increasingly unstable and challengeable with respect to cyber-attacks, unstructured malwares and abnormal activities. With the diversification and unexpected behaviors of cyber-security threats, traditional cyber-attack detection systems have some critical problems with increasing massive data including unappropriated feature selection and extraction, high computation time in prediction and inaccurate classification models. Due to the above-mentioned challenges, this paper presents a new cloud-based cyber-attack detection architecture based on Ensemble Bagged Trees Detection (EBTD) algorithm for predicting malicious behaviors and types of cyber-attacks for hyper-automation process in the IIoT. The proposed architecture uses Analysis of Variance (ANOVA) and a priority-based feature selection and extraction model to find the optimal features with highly dependent on the network traffic, computation time, malicious behaviors, and types of attacks. Then, experimental results are conducted using the technical data sets UNSW-NB15 and NSL-KDD. The simulation results show that the proposed architecture performance performs better than other case studies and prediction models and effective on optimization of large-scale cyber-attack detection systems for critical hyper-automation process in the IIoT environment. [ABSTRACT FROM AUTHOR]

Summary: The cloud computing systems, such as the Internet of Things (IoT), are usually introduced with a three‐layer architecture (IoT‐Fog‐Cloud) for the task offloading that is a solution to compensate for resource constraints in these systems. Offloading at the right location is the most significant challenge in this field. It is more appropriate to offload tasks to fog than to cloud based on power and performance metrics, but its resources are more limited than the resources of the cloud. This paper tries to optimize these factors in the fog by specifying the number of usable servers in the fog. For this purpose, we model a fog computing system using the queueing theory. Furthermore, binary search and reinforcement learning algorithms are proposed to determine the minimum number of servers with the lowest power consumption. We evaluate the cost of the fog in different scenarios. By solving the model, we find that the proposed dispatching policy is very flexible and outperformed the known policies by up to 31% and in no case is it worse than either of them, and the overall offloading cost increases when fog rejects tasks with a high probability. Our offloading method is more effective than running all fog servers simultaneously, based on simulation results. It is evident from the similarities between the simulation results and those derived from the analytical method that the model and results are valid. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) devices produce a humongous amount of data frequently stored on cloud servers, and as a result, cryptographic techniques to guarantee the privacy of outsourced data while preserving search ability on servers are becoming indispensable research topics. A prominent example of such topics is the concept of public key authenticated encryption with keyword search (PAEKS). In spite of the large number of PAEKS schemes in the literature, most existing schemes exhibit issues in certificate management, key escrow, or even key distribution. To address these issues, recently, PAEKS schemes in the certificate-based setting have gained attention. To the best of our knowledge, there exist only two Certificate-Based Authenticated Encryption with Keyword Search (CBAEKS) schemes, both presented with rather weak security models based on single keyword challenges. In this paper, we propose an enhanced security model for CBAEKS which captures notions of multi-ciphertext and multi-trapdoor indistinguishability, then proceed to devise a concrete instantiation for a CBAEKS scheme and formally prove its security under our enhanced model. Furthermore, we prove that the existing CBAEKS schemes are insecure under the enhanced security model. Comparisons with related schemes in the literature are also provided to demonstrate that the enhanced security is achieved at some affordable costs. [ABSTRACT FROM AUTHOR]