Key Storage Space Research Articles

Plaintext-related image encryption scheme without additional plaintext based on 2DCS

In the latest research on image compression and encryption, more and more encryption schemes associate key generation mechanism with plaintext to resist various attacks. This paper presents an image encryption scheme related to plaintext based on 2D compressive sensing(2DCS). It is a plaintext correlation compression and encryption scheme with no additional information. The chaotic sequence generated by Henon map randomly selects some positions in the plaintext image. Double random-phase encoding(DRPE) is applied to the pixels to establish the relationship between the plaintext and the key. The encryption process is divided into three parts. The first part is to map out these key pixels and perform double negative positive transformation(DNPT). In the second part, the plaintext image is sampled, quantified and reconstructed by 2DCS. DNA calculation and diffusion were performed on the reconstructed vector. In the third part, the key pixel matrix and diffusion matrix of DNPT are inversely reconstructed to obtain the cipher image. The proposed encryption mechanism can avoid the transmission of additional information related to the plaintext in the channel, which greatly saves the transmission cost and key storage space. The effectiveness and feasibility of the scheme are verified by various security analyses.

Identity Access Management via ECC Stateless Derived Key Based Hierarchical Blockchain for the Industrial Internet of Things

Recently, the adoption of the industrial Internet of things (IIoT) has optimized many industrial sectors and promoted industry “smartization.” Smart factories and smart industries connect the real and virtual worlds through cyber-physical systems (CPS). However, these linkages will increase the cyber security danger surface to new levels, putting millions of dollars' worth of assets at risk if communications in big network systems like IIoT settings are left unsecured. To solve these problems, the fundamental method is security, such as authentication and confidentiality, and it should require the encryption key. However, it is challenging the security performance with the limited performance of the sensor. Blockchain-based identity management is emerging for lightweight, integrity and persistence. However, the key generation and management issues of blockchain face the same security performance issues. First, through blockchain smart contracts and hierarchical deterministic (HD) wallets, hierarchical key derivation efficiently distributes and manages keys by line and group in the IIoT environment. Second, the pairing verification value based on an elliptic curve single point called Root Signature performs efficient public key certificate registration and verification and improves the key storage space. Third, the identity log recorded through the blockchain is the global transparency of the key lifecycle, providing system reliability from various security attacks. Keyless Signature Infrastructure (KSI) is adopted to perform efficiently via hash-based scheme (hash calendar, hash tree etc.). We analyze our framework compared to hash-based state commitment methods. Accordingly, our method achieves a calculation efficiency of O(nlog N) and a storage space saving of 60% compared to the existing schemes.

Dynamic Deduplication Algorithm for Cross-User Duplicate Data in Hybrid Cloud Storage

The escalating growth of distributed big data in hybrid cloud storage architecture introduces a new set of challenges. Constantly, content enrichment puts pressure on capacity. Nonetheless, the explosion of user data places a significant strain on broadband and storage capacity. Consequently, many cloud storage providers will implement deduplication to compress data, reduce transfer bandwidth, and reduce cloud storage space. In cloud storage systems, it is a data compression and storage optimization method. By locating and removing redundant data, it can save storage space and bandwidth. An MTHDedup deduplication strategy based on the Merkle hash tree is presented in a hybrid cloud environment to address the issue of convergent encryption algorithms being susceptible to brute-force attacks and ciphertext computation time overhead. Merkle hash trees are constructed using additional encryption algorithms to generate encryption keys during file- and block-level deduplication, ensuring that generated ciphertexts are unpredictable. The method is effective against both internal and external brute-force attacks, thereby increasing data security. Our method reduces the computational burden of ciphertext generation and the key storage space, and the performance advantage increases with the number of privilege sets.

A novel plaintext-related chaotic image encryption scheme with no additional plaintext information

In the latest image chaotic encryption research, more and more encryption schemes associate the key generation mechanism with the plaintext in order to resist the chosen plaintext attack. However, large amounts of the additional data related to the plaintext need to be sent to the receiver when the sender encrypts a large number of images, which leads to the problems of large transmission cost, high key storage space requirement and complicated key management. In order to solve such problems, this paper proposes a novel plaintext-related chaotic image encryption scheme with no additional plaintext information. The relationship between the plaintext and the secret keys is established by selecting some key pixels in the original image randomly and securely by Henon map. The encryption process is divided into two parts. The first part is to encrypt the selected key pixel while keeping their secret positions unchanged. The second part is to encrypt the remainder pixels based on hyperchaotic Lorenz system and DNA encoding using the generated keys. The proposed encryption mechanism can not only achieve the equivalent effect of one-time pad to resist the chosen plaintext attack, but also avoid transmitting additional information associated with the plaintext in the communication channel, which greatly saves the transmission cost and the required key storage space, and simplify the key management. The encryption scheme in this paper has also passed various security analyses to ensure the security of the ciphertext image.

Chaotic key generation and application in OFDM-PON using QAM constellation points

In this paper, we propose a chaotic key generation method using QAM constellation points in orthogonal frequency division multiplexing passive optical network (OFDM-PON) to change security key dynamically. In the proposed method, key generation rules are agreed in advance between the transmitter and receiver, and the generated key is related to the characteristics of the latest uplink user data. Relevant parameters are used instead of the security key for the transmission, and users can dynamically change the relevant parameters according to their requirements to achieve the change of security key. It is proved that the method can enhance the difficulty for illegal attackers to intercept user data and the ability to resist exhaustive attacks, which has no significant impacts on the computational complexity and transmission performance. By modifying the key generation rules, the relationship between the obtained key space and the needed key storage space at the transmitter and receiver can be weighed.

A key management scheme realising location privacy protection for heterogeneous wireless sensor networks

Key management is the core of wireless sensor network (WSN) security management technology. At present, the protection of the source location information of nodes has also received great attention. In this paper, we combine identity-based encryption (IBE) algorithm with elliptic curve cryptography (ECC) based digital signature authentication to achieve more secure authentication. Then we use the double encryption method to realise the location privacy protection. Finally, we adopt a new routing update scheme to prevent attackers from initiating sinkhole attacks. In addition, we add timestamps to messages transmitted between nodes to defend against resend attacks. The scheme we proposed occupies a small amount of key storage space, consumes relatively more energy to protect the location information of nodes in the heterogeneous sensor network (HSN), and prevents attackers from initiating sinkhole attacks and resend attacks, thereby enhancing network security.

A key management scheme realising location privacy protection for heterogeneous wireless sensor networks

Key management is the core of wireless sensor network (WSN) security management technology. At present, the protection of the source location information of nodes has also received great attention. In this paper, we combine identity-based encryption (IBE) algorithm with elliptic curve cryptography (ECC) based digital signature authentication to achieve more secure authentication. Then we use the double encryption method to realise the location privacy protection. Finally, we adopt a new routing update scheme to prevent attackers from initiating sinkhole attacks. In addition, we add timestamps to messages transmitted between nodes to defend against resend attacks. The scheme we proposed occupies a small amount of key storage space, consumes relatively more energy to protect the location information of nodes in the heterogeneous sensor network (HSN), and prevents attackers from initiating sinkhole attacks and resend attacks, thereby enhancing network security.

Secure and Efficient Cloud Data Deduplication with Ownership Management

Data deduplication has been widely used in cloud storage to reduce storage space and communication overhead by eliminating redundant data and storing only one copy for them. In order to achieve secure data deduplication, the convergent encryption scheme and many of its variants are proposed. However, most of these schemes do not consider or cannot address the efficiently dynamic ownership changes and the secure Proof-of-Ownership (PoW), simultaneously. In this paper, we propose a secure data deduplication scheme with efficient PoW process for dynamic ownership management. Specially, our scheme supports both cross-user file-level and inside-user block-level data deduplication. During the file-level deduplication, we construct a new PoW scheme to ensure the tag consistency and achieve the mutual ownership verification. Moreover, we design a lazy update strategy to achieve efficient ownership management. For inside-user block-level deduplication, the user-aided key is used to realize convergent key management and reduce the key storage space. Finally, the security and performance analysis demonstrate that our scheme can ensure data confidentiality and tag consistency, and it is efficient in data ownership management.

An Efficient Key Management Scheme for Wireless Sensor Networks

Wireless sensor networks (WSNs) can be used in a wide range of environments. Due to the inherent characteristics of wireless communications, WSNs are more vulnerable to be attacked than conventional networks. Authentication and data confidentiality are critical in these settings. It is necessary to design a useful key management scheme for WSNs. In this paper, we propose a novel key management scheme called MAKM (modular arithmetic based key management). The proposed MAKM scheme is based on the congruence property of modular arithmetic. Each member sensor node only needs to store a key seed. This key seed is used to compute a unique shared key with its cluster head and a group key shared with other nodes in the same cluster. Thus, MAKM minimizes the key storage space. Furthermore, sensor nodes in the network can update their key seeds very quickly. Performance evaluation and simulation results show that the proposed MAKM scheme outperforms other key-pool-based schemes in key storage space and resilience against nodes capture. MAKM scheme can also reduce time delay and energy consumption of key establishment in large-scale WSNs.

SECURE ANONYMOUS COMMUNICATION FOR WIRELESS SENSOR NETWORKS BASED ON PAIRING OVER ELLIPTIC CURVES

The nature of wireless communication makes it susceptible to a number of security threats, disclosing the identities of the communicating parties in the network. By revealing the identity of nodes in the network, outside parties can setup severe targeted attacks on specific nodes. Such targeted attacks are more harmful to sensor networks as sensing nodes (sensors) have limited computing and communication power prohibiting them from using robust security mechanisms. Anonymous communication is one of the key primitives for ensuring the privacy of communicating parties in a group or network. In this paper, we propose a novel secure anonymous communication protocol based on pairing over elliptic curves for wireless sensor networks (WSNs). Using this protocol, only the legitimate nodes in the sensor network can authenticate each other without disclosing their real identities. The proposed protocol is extremely efficient in terms of key storage space and communication overhead. Security analysis of our protocol shows that it provides complete anonymity for communicating nodes. The analysis also shows that the proposed protocol is robust against a number of attacks including the masquerade attack, wormhole attack, selective forwarding attack and message manipulation attack.