The inherent complexities of Industrial Internet of Things (IIoT) architecture make its security and privacy issues becoming critically challenging. Numerous surveys have been published to review IoT security issues and challenges. The studies gave a general overview of IIoT security threats or a detailed analysis that explicitly focuses on specific technologies. However, recent studies fail to analyze the gap between security requirements of these technologies and their deployed countermeasure in the industry recently. Whether recent industry countermeasure is still adequate to address the security challenges of IIoT environment are questionable. This article presents a comprehensive survey of IIoT security and provides insight into today’s industry countermeasure, current research proposals and ongoing challenges. We classify IIoT technologies into the four-layer security architecture, examine the deployed countermeasure based on CIA+ security requirements, report the deficiencies of today’s countermeasure, and highlight the remaining open issues and challenges. As no single solution can fix the entire IIoT ecosystem, IIoT security architecture with a higher abstraction level using the bottom-up approach is needed. Moving towards a data-centric approach that assures data protection whenever and wherever it goes could potentially solve the challenges of industry deployment.

Chaotic-based S-box image encryption schemes promise to be a practical solution for securing digital images. However, the high-dimensional continuous chaotic has increased the algorithm’s complexity. Recent alternatives that focused on double or multiple S-box es approaches, on the other hand, have been proven vulnerable to differential attacks. This paper presents an efficient and secure chaotic-based S-box image encryption scheme. Firstly, a single S-box with a size of $10\times 26$ was constructed by using a low-dimensional chaotic system. Without a complex mathematical operation, the constructed single S-box has obvious efficiency advantages and achieved a higher image entropy rate than recent double or multiple S-box es. Secondly, a new dynamic encryption step method is proposed to solve the high correlation and deterministic problems in multiple S-box encryptions. Under the control of the dynamic encryption step algorithm, it effectively destroys the correlation between the source image’s pixels. The experimental results and security analysis show that the proposed scheme enjoys higher security and is more efficient to secure digital images in real-world applications.

Attribute-based encryption (ABE) cryptography is widely known for its potential to solve the scalability issue of recent public key infrastructure (PKI). It provides a fine-grained access control system with high flexibility and efficiency by labeling the secret key and ciphertext with distinctive attributes. Due to its fine-grained features, the ABE scheme is a protection layer in securing users’ data and privacy in big data processing and analytics. However, quantum computing, new technology on the horizon that will transform the security and privacy environment, has begun to appear. Like the conventional ABE schemes, present cryptography is not excluded from the impacts of quantum technology as they are not made to be quantum-resistant. While most recent surveys generally touched on the generic features of attribute-based encryption schemes such as user revocation, scalability, flexibility, data confidentiality, and scope in pairing-based ABE schemes, this survey investigated quantum-resistant ABE schemes in securing big data. This survey reviews the challenges faced by the recent ABE cryptography in the post-quantum era and highlights its differences from the conventional pairing-based ABE schemes. Subsequently, we defined the criteria of an ideal quantum-resistant ABE scheme. Additionally, existing works on quantum-resistant ABE schemes are reviewed based on their algorithms design, security and functionalities. Lastly, we summarized quantum-resistant ABE schemes’ ongoing challenges and future works.

The recent promising results on the hardness of lattice problems have inspired the construction of several Attribute-based Encryption (ABE) schemes from the quantum resistant perspective. However, these schemes are insufficient enough for supporting real-world applications due to inherent quadratic overhead problem in the use of Learning With Error (LWE). To solve this problem, this paper proposed a Ciphertext-Policy Attribute-Based Encryption (CP-ABE) scheme from a more lightweight ideal lattice classes- Ring-Learning with Errors (Ring-LWE), that further called as CP-ABE _R-LWE scheme. Compared to existing R-LWE based ABE scheme, the proposed CP-ABE _R-LWE is capable to handle a monotone access structure and enjoys collusion resistance properties. We exploited Linear Secret Scheme (LSSS) to express a monotone access structure. For resist to collusion attack, we applied the private key randomization technique to blind the user's private key. The proposed scheme CP-ABE _R-LWE is further proven to be secure under the Decision Ring-LWE _d,q,χ problem in the selective set model.