Data Loss Attacks Research Articles

A new 2D cross hyperchaotic Sine-modulation-Logistic map and its application in bit-level image encryption

Chaotic theory is being increasingly researched for application in image encryption scheme (IES). This paper presents a novel two-dimensional cross hyperchaotic Sine-modulation-Logistic map (2D-CHSLM) based on the famous Sine and Logistic maps. The hyperchaotic behaviors of 2D-CHSLM are demonstrated through bifurcation diagrams, trajectory plots, Lyapunov exponents, histogram, correlation dimension, sensitivity to initial conditions, sample entropy, 0–1 test, and NIST 800–22 test. A new bit-level IES with traditional an encryption structure is proposed utilizing 2D-CHSLM. The 2D-CHSLM-IES performs 2D-CHSLM-based bit-level confusion using a zigzag transform and 2D-CHSLM-based cross coupled diffusion operations to generate a highly secure cipher-image. Simulations and security analyses, including key space, key sensitivity, histogram, correlation, information entropy, encryption quality, known-plain and chosen-plain attacks, floating Frequency, differential attack, noise and data loss attacks, demonstrate the robust security of the proposed 2D-CHSLM-IES.

A color image encryption and decryption scheme based on extended DNA coding and fractional-order 5D hyper-chaotic system

With the advancement of information technology, the security of digital images has become increasingly important. To ensure the integrity of images, this paper presents a novel color image encryption and decryption architecture. Firstly, a fractional-order five-dimensional hyper-chaotic system (F5DHS) is proposed and used to generate chaotic sequences for permutation and diffusion processes. Secondly, the extended DNA encoding scheme is employed to generate more DNA encoding rules and four DNA computation methods are used to improve the security of the encryption scheme. Thirdly, a blocked image encryption method is designed to divide the color image into sub-blocks and then determine the DNA encoding, DNA decoding and DNA arithmetic rules for each sub-block based on chaotic sequences. Finally, the results of simulation experiments and security analysis show that the color image encryption algorithm has good encryption performance, a large secret key space, and strong robustness to noise and data loss attacks, indicating that the proposed encryption algorithm can effectively protect the secure communication of digital images.

Watermarking algorithm based on phase-only CGH in fractional Hartley domain for DICOM images

In this manuscript, we proposed a watermarking algorithm based on phase-only computer-generated holography (CGH) in the fractional Hartley domain for digital imaging and communications in medicine (DICOM) images. The proposed algorithm improves the security of the CGH-based algorithm. The cascaded use of fractional Hartley transform and attenuation factor β increases the keyspace of the proposed watermarking algorithm. The robustness and effectiveness of the proposed watermarking algorithm is validated using simulations on DICOM images. The effectiveness of the proposed watermarking algorithm is assessed using statistical tools in terms of mean-squared error, information entropy, correlation coefficient, histogram, and mesh plots. The robustness is evaluated by testing the proposed algorithm’s performance under real-time threats, including contamination and data loss attacks. Furthermore, the security of the proposed algorithm is also tested for existing cryptographic attacks, such as chosen-plaintext attacks, and known-plaintext attacks. The simulation results indicate that the proposed watermarking algorithm is robust and effective.

Asymmetric multi-image wavelength multiplexing cryptosystem using QZ algorithm and unequal modulus decomposition

An asymmetric multi-image cryptosystem based on wavelength multiplexing is proposed in this paper. Multi-image characteristic of the encryption process has been realized by the QZ synthesis process. Unequal modulus decomposition is used to make the scheme robust to any basic cryptographic attacks. The encryption process has a complex setup that involves phase retrieval algorithms but the decryption is quite simple and fast and can be realized on the hybrid system. Although the scheme is validated on grayscale multi-images, it can also process color images. Cryptosystem is exposed to statistical attacks, noise attacks, and data loss attacks, apart from basic cryptographic attacks. Simulation established the fortitude of the cryptosystem to these attacks. We also analyzed the key space and key sensitivity, and the results show that the cryptosystem has a large key space to resist any brute-force attack. Comparative analysis with similar schemes on multi-image reveals that the cryptosystem has several merits and it is secure against basic and special attacks.

Image encryption algorithm based on a new 3D chaotic system using cellular automata

Cryptography and steganography are usual methods for safe transfer of information, which encryption algorithms turn original images into unreadable noise-like images. This paper presents a novel symmetric cryptosystem designed for the transmission of RGB color images through open channels and our goal is to provide a secure cryptography algorithm against cropping and noise attacks. The encryption algorithm is based on a suitable 3D hybrid chaotic system, with high Lyapunov exponent value, leveraging the advantages of common chaos maps while addressing their inherent limitations. To further enhance security, a novel pixel shuffle operator is employed to eliminate any potential neighborhood relations between image pixels. The encryption process incorporates reversible second-order cellular automata, which are applied to the outputs of the chaotic system. Key generation is achieved through the utilization of irreversible cellular automata. The resulting key space is large enough to resist brute-force attacks and performs a high level of sensitivity. Experimental results, including analysis of histograms, entropies, and pixel correlations, confirm the effectiveness of the proposed image encryption scheme, and prove its resilient against statistical attacks and a remarkable resistance against data loss attacks.

Chaos and DNA coding technique for image cryptography

AbstractIn today's cybersphere, cryptography plays a vital role in various fields. Image encryption is an integral part for securing information because of its vast application areas such as military (defense), multimedia, healthcare and so forth. In this article, an image encryption algorithm for both grayscale and color image is proposed based on Tangential Delay‐Ellipse Reflecting Curve System (TD‐ERCS) chaotic map system and deoxyribonucleic acid (DNA) coding. Chaotic map is used to scramble the pixel positions; to achieve confusion and for creation of mask image, and DNA coding is used for changing the pixel values; to achieve diffusion. Upon experimental analysis, proposed work achieved significantly high mean square error and low peak signal to noise ratio, almost zero correlation, high number of pixel change rate and unified averaged changed intensity values, and resistance to noise and data loss attacks. In addition, the decryption is possible without loss in quality of image.

Highly Efficient Bidirectional Multifactor Authentication and Key Agreement for Real-Time Access to Sensor Data

This paper presents an authentication and key agreement protocol for users who want to have access to constrained sensor nodes deployed in the field, e.g. doctor with healthcare nodes of patient. Both sensor and user device provide direct multi-factor authentication relying on physical unclonable functions and biometrics respectively. In addition, our scheme offers protection against the presence of a semi-trusted third party, perfect forward secrecy, anonymity, untraceability and protection against session specific data loss attacks. The combination of all these security features is unique. Moreover, it is shown that the resulting scheme outperforms most state-of-the art schemes with respect to computation and communication costs.

Image Encryption Scheme Based on Newly Designed Chaotic Map and Parallel DNA Coding

In this paper, a new one-dimensional fractional chaotic map is proposed and an image encryption scheme based on parallel DNA coding is designed by using the chaotic map. The mathematical model of the new chaotic system combines a sine map and a fraction operation. Compared with some traditional one-dimensional chaotic systems, the new chaotic system has a larger range of chaotic parameters and better chaotic characteristics, which makes it more suitable for applications in information encryption. In addition, an image encryption algorithm based on parallel DNA coding is proposed, which overcomes the shortcoming of common DNA coding-based image encryption algorithms. Parallel computing significantly increases the speed of encryption and decryption algorithms. The initial key of the cryptosystem is designed to be related to the SHA-3 hash value of the plaintext image so that the algorithm can resist a chosen-plaintext attack. Simulation experiments and security analysis results show that the proposed image encryption scheme has good encryption performance and less time overhead, and has strong robustness to noise and data loss attacks, which indicates that the proposed image encryption scheme has good application potential in secure communication applications.

A Lightweight Image Encryption Algorithm Based on Chaotic Map and Random Substitution.

Chaotic-maps-based image encryption methods have been a topic of research interest for a decade. However, most of the proposed methods suffer from slow encryption time or compromise on the security of the encryption to achieve faster encryption. This paper proposes a lightweight, secure, and efficient image encryption algorithm based on logistic map, permutations, and AES S-box. In the proposed algorithm, SHA-2 based on the plaintext image, a pre-shared key, and an initialization vector (IV) are used to generate the initial parameters for the logistic map. The logistic map chaotically generates random numbers, which are then used for the permutations and substitutions. The security, quality, and efficiency of the proposed algorithm are tested and analyzed using a number of metrics, such as correlation coefficient, chi-square, entropy, mean square error, mean absolute error, peak signal-to-noise ratio, maximum deviation, irregular deviation, deviation from uniform histogram, number of pixel change rate, unified average changing intensity, resistance to noise and data loss attacks, homogeneity, contrast, energy, and key space and key sensitivity analysis. Experimental results reveal that the proposed algorithm is up to 15.33× faster compared to other contemporary encryption methods.

A Novel Grayscale Image Encryption Scheme Based on the Block-Level Swapping of Pixels and the Chaotic System.

Hundreds of image encryption schemes have been conducted (as the literature review indicates). The majority of these schemes use pixels as building blocks for confusion and diffusion operations. Pixel-level operations are time-consuming and, thus, not suitable for many critical applications (e.g., telesurgery). Security is of the utmost importance while writing these schemes. This study aimed to provide a scheme based on block-level scrambling (with increased speed). Three streams of chaotic data were obtained through the intertwining logistic map (ILM). For a given image, the algorithm creates blocks of eight pixels. Two blocks (randomly selected from the long array of blocks) are swapped an arbitrary number of times. Two streams of random numbers facilitate this process. The scrambled image is further XORed with the key image generated through the third stream of random numbers to obtain the final cipher image. Plaintext sensitivity is incorporated through SHA-256 hash codes for the given image. The suggested cipher is subjected to a comprehensive set of security parameters, such as the key space, histogram, correlation coefficient, information entropy, differential attack, peak signal to noise ratio (PSNR), noise, and data loss attack, time complexity, and encryption throughput. In particular, the computational time of 0.1842 s and the throughput of 3.3488 Mbps of this scheme outperforms many published works, which bears immense promise for its real-world application.

Bit‐level image encryption algorithm based on fully‐connected‐like network and random modification of edge pixels

A bit-level image encryption algorithm based on Fully-Connected-Like network(FCLN) and random modification of edge pixels is proposed. In the paper, in order to enhance the security of the cryptographic system, random noise is first used to modify the least significant bits of the edge pixels of the image, and the modified image is used as the input image. Later,the chaotic sequence is used to perform cyclic shift transformation on the image. In the subsequent steps, the FCLN is generated based on a fully connected neural network, which can perform scrambling and diffusion operations on the input image. Finally, the bidirectional diffusion method is used to diffuse the image forward and backward. In addition, the image after the edge pixel modification is convolved with the chaotic sequence, and the initial value of the chaotic system is set by the result to establish the correlation between the plain image and the algorithm, which makes the algorithm resistant to known/chosen plaintext attack. Experimental results show that although the image is modified by random noise, the decrypted image is visually the same as the original image. At the same time, through the analysis of common attacks such as differential attacks, noise attacks, and data loss attacks, our algorithm shows high security.

Designing a double-way spread permutation framework utilizing chaos and S-box for symmetric image encryption

Recently, many chaos-based image cryptosystems have been investigated. However, some drawbacks of existing schemes are as follows: (1) the high computational complexity and bad scrambling effect of permutation algorithm reduce the security and practicality of the encryption system; (2) the insufficient association between encryption algorithm and plaintext makes it suffer from low plaintext sensitivity and inability to effectively resist chosen plaintext attack; (3) some algorithms are one-time-pad-like encryption systems, which reduce their practical value; (4) adequate plaintext relation elevates the plaintext sensitivity but also increases the ciphertext sensitivity of a cryptosystem and make it possess low robustness of defending noise and data loss attacks. To address the defects of existing works, a symmetric plaintext-related image cryptosystem based on a new scrambling framework using S-box is proposed. Firstly, substitution-box(S-box) of AES is first used to develop a new scrambling framework, namely double-way spread permutation framework (DWSPF), which can be used to scramble color images and gray images of any size. Then, the present study develops a new method of plaintext association that one parameter carried the information of original image and used to control the encryption process is padded to the encrypted array which is transmitted to the receiver. Such a strategy can realize the sufficient plaintext relation without the use of one-time-pad encryption technology and avoid high ciphertext sensitivity, which can well resist noise attacks and information loss attacks. Sufficient experiments results demonstrate that the proposed permutation framework and cryptosystem possess excellent security and efficiency compared with the state-of-art works.

Correcting Errors in Color Image Encryption Algorithm Based on Fault Tolerance Technique

Security standards have been raised through modern multimedia communications technology, which allows for enormous progress in security. Modern multimedia communication technologies are concerned with fault tolerance technique and information security. As a primary method, there is widespread use of image encryption to protect image information security. Over the past few years, image encryption has paid more attention to combining DNA technologies in order to increase security. The objective here is to provide a new method for correcting color image encryption errors due to the uncertainty of DNA computing by using the fractional order hyperchaotic Lorenz system. To increase randomness, the proposed cryptosystem is applied to the three plain image channels: Red, Green, and Blue. Several methods were compared including the following: entropy, correlation, key sensitivity, key space, data loss attacks, speed computation, Number of Pixel changing rate (NPCR), and Unified Average Change Intensity randomness (UACI) tests. Consequently, the proposed scheme is very secure against a variety of cryptographic attacks.

A novel 2D cascade modulation couple hyperchaotic mapping for randomized image encryption

In this paper, we design a novel two-dimensional hyperchaotic with two positive Lyapunov exponents and a phase distribution region close to uniform. Then, we propose a novel randomized hyperchaotic image encryption algorithm based on the proposed two-dimensional hyperchaotic mapping. The algorithm is designed in such a way that first adds randomization to the input image, and uses the SHA-256 value of the randomized image with the key for extracting required parameters. This randomization property is required for CPA-security. The security performance of the proposed encryption algorithm is illustrated by several experiments, including robustness against noise and data loss attacks, statistical, differential, and brute-force attacks. These experiments reveal acceptable security in comparison with several recent chaotic image encryption algorithms.

A Robust Quasi-Quantum Walks-Based Steganography Protocol for Secure Transmission of Images on Cloud-Based E-healthcare Platforms.

Traditionally, tamper-proof steganography involves using efficient protocols to encrypt the stego cover image and/or hidden message prior to embedding it into the carrier object. However, as the inevitable transition to the quantum computing paradigm beckons, its immense computing power will be exploited to violate even the best non-quantum, i.e., classical, stego protocol. On its part, quantum walks can be tailored to utilise their astounding ‘quantumness’ to propagate nonlinear chaotic behaviours as well as its sufficient sensitivity to alterations in primary key parameters both important properties for efficient information security. Our study explores using a classical (i.e., quantum-inspired) rendition of the controlled alternate quantum walks (i.e., CAQWs) model to fabricate a robust image steganography protocol for cloud-based E-healthcare platforms by locating content that overlays the secret (or hidden) bits. The design employed in our technique precludes the need for pre and/or post encryption of the carrier and secret images. Furthermore, our design simplifies the process to extract the confidential (hidden) information since only the stego image and primary states to run the CAQWs are required. We validate our proposed protocol on a dataset of medical images, which exhibited remarkable outcomes in terms of their security, good visual quality, high resistance to data loss attacks, high embedding capacity, etc., making the proposed scheme a veritable strategy for efficient medical image steganography.

Detailed analysis and improvement of an efficient and secure identity-based public auditing for dynamic outsourced data with proxy

For data owners of restricted cloud access with a delegated proxy, public auditing technology for cloud data integrity, plays critical roles in ensuring powerful productivity that flexible cloud services provide for their business. In order to address the scalability of data owners and storage clouds for secure public auditing, Yu et al. (2017) proposed an Identity-Based Public Auditing for Dynamic Outsourced Data with Proxy Processing (https://doi.org/10.3837/tiis.2017.10.019), which also overcomes complicated public key certificates management issue. In this article, we figure out that this scheme is vulnerable to data loss attack where clouds could pass integrity auditing without original data. Meanwhile, a threat of system security is demonstrated, i.e., any entities are able to recover proxy private keys and impersonate proxy to forge proxy tag, with two arbitrary data tag pairs of same data owner. To enable secure identity-based batch public auditing with proxy processing, we propose an improved scheme without these security flaws and prove its security under CDH hard problem in the random oracle model. With complexity analysis, our scheme shows better efficiency over identity-based proxy-oriented data uploading and remote data integrity checking in public cloud (ID-PUIC) in a single owner effort on a single cloud. Especially, we give the detailed analysis for how efficiently the attacks on Yu et al.’s scheme could be launched with an experiment, and demonstrate complete reduction on probability and time for proving security of our improved scheme. For potential application in big data storage, we first evaluate the error detection probability varying on number of auditing blocks, and then conduct detailed performance analysis by simulating our scheme and ID-PUIC scheme on the different number of data owners and storage clouds, with up to 106 data blocks.

A New Plaintext-Related Image Encryption Scheme Based on Chaotic Sequence

In order to improve the image encryption system’s ability to resist plaintext, noise, and data loss attacks, in this paper, a new plaintext-related and chaos-based image encryption scheme is proposed, which includes two rounds of encryption operations. The block parity checking, performed in the first round of encryption, is used to associate the plaintext information with a secret key so that the encryption scheme can resist plaintext attacks. Moreover, repetitive coding, which is adopted in the second round of encryption, is used to protect the plaintext-related parameters against noise and data loss attacks. Meanwhile, a high-speed digital chaotic sequence generator based on permutation polynomials and residue number system is also presented. The detailed performance evaluations, including key space, key sensitivity, differential attack resisting ability, anti-noise ability, correlation coefficient, and information entropy, show that our scheme not only possesses the properties of good randomness and large key space but also has a high degree of robustness against plaintext, noise, and data loss attacks.

Chaotic Encryption and Privilege Based Visual Secret Sharing Model for Color Images

In the Privilege-based Visual Secret Sharing Model (PVSSM), each share has a unique privilege and a higher-privilege share contributes with more privilege to reveal the secret image. However, in PVSSM, when several shares with the higher priority are stacked, the secret image can be visibly displayed. This security problem is solved by applying a two-dimensional Logistic-Adjusted Sine Map (2D-LASM) to each share. This method is called Chaotic Encryption-based PVSSM. In this paper, we aim to present how Chaotic Encryption-based PVSSM is applied to color images. In order to assess the efficiency of this method, histogram analysis, data loss attack, salt-pepper noise attack, differential attack, chi-square analysis and correlation analysis tests were applied. The performance of this method has been evaluated according to NCPR, UACI, PSNR, SSIM and CQM. The proposed method achieved a good test values and showed better results compared to similar studies in literature.

A Novel Plaintext-Related Image Encryption Algorithm Based on Stochastic Signal Insertion and Block Swapping

Image encryption is an important method for protecting private data during communication. This paper proposes a novel hyperchaotic image encryption algorithm based on stochastic signal insertion and block permutation. First, the 5D hyperchaotic system is applied to generate pseudorandom number sequences. The SHA-256 hash function and secret keys are used to produce the initial values of the cryptosystem. The hash values can effectively enhance the sensitivity to plain image. To enlarge the key space and change orbit of cryptosystem, some stochastic signals are inserted during iteration. The plain image is equally divided into two parts. An X-coordinate, a Y-coordinate and a control table are established with produced pseudonumber sequences. The pixel is swapped with another pixel in the current block or another block depending on the control table. Cyclic shift is performed during the diffusion process. Performance and security analyses are executed to verify the effect of the proposed scheme. It is clear that the proposed scheme has a large key space and is highly sensitive to plain image and secret keys. Moreover, the cryptosystem has low computation complexity and can resist correlation analysis, entropy analysis, statistical attack, differential attack, noise and data loss attacks.

An efficient nested chaotic image encryption algorithm based on DNA sequence

In this paper, an efficient scheme for image encryption based on the nested chaotic map and deoxyribonucleic acid (DNA) is introduced. In order to generate the initial condition values of the nested chaotic system, the Secure Hash Algorithm SHA-256 is used. The algorithm consists of two main layers: confusion and diffusion. In the first layer, the nested chaotic map is employed to create the scrambled image. The scrambled image is obtained through the ascending sorting of the first component of the nested chaotic index sequence. To ensure higher sensitivity, higher complexity and higher security, DNA sequence and DNA operator are employed additionally with the nested chaotic map and hash algorithm to modify the pixel values. The important advantages of our algorithm are the improvement of Number of Pixel Change Rate (NPCR), Unified Average Changing Intensity (UACI) and entropy, which improve resistivity against several attacks. Experimental results and relevant security analysis demonstrated that our proposed encryption scheme has the highest security level because it is more complicated, and it has a sufficiently large key space. The proposed method is compared to other recent image encryption schemes using different security analysis factors, including NPCR, UACI, correlation coefficients (CCs), encryption quality (EQ) and entropy. It is also resistant to noise (Salt and Pepper, Gaussian and speckle) and data loss attacks. The illustrated results demonstrated that the proposed image encryption scheme is efficient, and can be adopted for image encryption and transmission.