Color Image Compression and Encryption Algorithm Based on 2D Compressed Sensing and Hyperchaotic System

With the advent of the information security era,it is necessary to guarantee the privacy,accuracy,and dependable transfer of pictures.This study presents a new approach to the encryption and compression of color images.It is predicated on 2D compressed sensing(CS)and the hyperchaotic system.First,an optimized Arnold scrambling algorithm is applied to the initial color images to ensure strong security.Then,the processed images are con-currently encrypted and compressed using 2D CS.Among them,chaotic sequences replace traditional random measurement matrices to increase the system’s security.Third,the processed images are re-encrypted using a combination of permutation and diffusion algorithms.In addition,the 2D projected gradient with an embedding decryption(2DPG-ED)algorithm is used to reconstruct images.Compared with the traditional reconstruction algorithm,the 2DPG-ED algorithm can improve security and reduce computational complexity.Furthermore,it has better robustness.The experimental outcome and the performance analysis indicate that this algorithm can withstand malicious attacks and prove the method is effective.

Chaotic CS Encryption:An Efficient Image Encryption Algorithm Based on Chebyshev Chaotic System and Compressive Sensing

Images are the most important carrier of human information. Moreover, how to safely transmit digital imagesthrough public channels has become an urgent problem. In this paper, we propose a novel image encryptionalgorithm, called chaotic compressive sensing (CS) encryption (CCSE), which can not only improve the efficiencyof image transmission but also introduce the high security of the chaotic system. Specifically, the proposed CCSEcan fully leverage the advantages of the Chebyshev chaotic system and CS, enabling it to withstand various attacks,such as differential attacks, and exhibit robustness. First, we use a sparse trans-form to sparse the plaintext imageand then use theArnold transformto perturb the image pixels. After that,we elaborate aChebyshev Toeplitz chaoticsensing matrix for CCSE. By using this Toeplitz matrix, the perturbed image is compressed and sampled to reducethe transmission bandwidth and the amount of data. Finally, a bilateral diffusion operator and a chaotic encryptionoperator are used to perturb and expand the image pixels to change the pixel position and value of the compressedimage, and ultimately obtain an encrypted image. Experimental results show that our method can be resistant tovarious attacks, such as the statistical attack and noise attack, and can outperform its current competitors.

Enhancing visual security: An image encryption scheme based on parallel compressive sensing and edge detection embedding

A novel image encryption scheme based on parallel compressive sensing and edge detection embedding technology is proposed to improve visual security. Firstly, the plain image is sparsely represented using the discrete wavelet transform.Then, the coefficient matrix is scrambled and compressed to obtain a size-reduced image using the Fisher–Yates shuffle and parallel compressive sensing. Subsequently, to increase the security of the proposed algorithm, the compressed image is re-encrypted through permutation and diffusion to obtain a noise-like secret image. Finally, an adaptive embedding method based on edge detection for different carrier images is proposed to generate a visually meaningful cipher image. To improve the plaintext sensitivity of the algorithm, the counter mode is combined with the hash function to generate keys for chaotic systems. Additionally, an effective permutation method is designed to scramble the pixels of the compressed image in the re-encryption stage. The simulation results and analyses demonstrate that the proposed algorithm performs well in terms of visual security and decryption quality.

A New Multi Chaos-Based Compression Sensing Image Encryption

The advancements in technology have substantially grown the size of image data.Traditional image encryption algorithms have limited capabilities to deal with the emerging challenges in big data,including compression and noise toleration.An image encryption method that is based on chaotic maps and orthogonal matrix is proposed in this study.The proposed scheme is built on the intriguing characteristics of an orthogonal matrix.Gram Schmidt disperses the values of pixels in a plaintext image by generating a random orthogonal matrix using logistic chaotic map.Following the diffusion process,a block-wise random permutation of the data is performed using multi-chaos.The proposed scheme provides sufficient security and resilience to JPEG compression and channel noise through a series of experiments and security evaluations.It enables Partial Encryption(PE)for faster processing as well as complete encryption for increased security.The higher values of the number of pixels change rates and unified average change intensity confirm the security of the encryption scheme.In contrast to other schemes,the proposed approach can perform full and partial encryption depending on security requirements.

Lossless embedding: A visually meaningful image encryption algorithm based on hyperchaos and compressive sensing

A novel visually meaningful image encryption algorithm is proposed based on a hyperchaotic system and compressive sensing(CS), which aims to improve the visual security of steganographic image and decrypted quality. First, a dynamic spiral block scrambling is designed to encrypt the sparse matrix generated by performing discrete wavelet transform(DWT)on the plain image. Then, the encrypted image is compressed and quantified to obtain the noise-like cipher image. Then the cipher image is embedded into the alpha channel of the carrier image in portable network graphics(PNG) format to generate the visually meaningful steganographic image. In our scheme, the hyperchaotic Lorenz system controlled by the hash value of plain image is utilized to construct the scrambling matrix, the measurement matrix and the embedding matrix to achieve higher security. In addition, compared with other existing encryption algorithms, the proposed PNG-based embedding method can blindly extract the cipher image, thus effectively reducing the transmission cost and storage space. Finally, the experimental results indicate that the proposed encryption algorithm has very high visual security.

Optical image encryption algorithm based on a new four-dimensional memristive hyperchaotic system and compressed sensing

Some existing image encryption schemes use simple low-dimensional chaotic systems, which makes the algorithms insecure and vulnerable to brute force attacks and cracking. Some algorithms have issues such as weak correlation with plaintext images, poor image reconstruction quality, and low efficiency in transmission and storage. To solve these issues,this paper proposes an optical image encryption algorithm based on a new four-dimensional memristive hyperchaotic system(4D MHS) and compressed sensing(CS). Firstly, this paper proposes a new 4D MHS, which has larger key space, richer dynamic behavior, and more complex hyperchaotic characteristics. The introduction of CS can reduce the image size and the transmission burden of hardware devices. The introduction of double random phase encoding(DRPE) enables this algorithm has the ability of parallel data processing and multi-dimensional coding space, and the hyperchaotic characteristics of 4D MHS make up for the nonlinear deficiency of DRPE. Secondly, a construction method of the deterministic chaotic measurement matrix(DCMM) is proposed. Using DCMM can not only save a lot of transmission bandwidth and storage space, but also ensure good quality of reconstructed images. Thirdly, the confusion method and diffusion method proposed are related to plaintext images, which require both four hyperchaotic sequences of 4D MHS and row and column keys based on plaintext images. The generation process of hyperchaotic sequences is closely related to the hash value of plaintext images. Therefore, this algorithm has high sensitivity to plaintext images. The experimental testing and comparative analysis results show that proposed algorithm has good security and effectiveness.

A New Encryption-Then-Compression Scheme on Gray Images Using the Markov Random Field

Compressing encrypted images remains a challenge.As illustrated in our previous work on compression of encrypted binary images,it is preferable to exploit statistical characteristics at the receiver.Through this line,we characterize statistical correlations between adjacent bitplanes of a gray image with the Markov random field(MRF),represent it with a factor graph,and integrate the constructed MRF factor graph in that for binary image reconstruction,which gives rise to a joint factor graph for gray images reconstruction(JFGIR).By exploiting the JFGIR at the receiver to facilitate the reconstruction of the original bitplanes and deriving theoretically the sum-product algorithm(SPA)adapted to the JFGIR,a novel MRF-based encryption-then-compression(ETC)scheme is thus proposed.After preferable universal parameters of the MRF between adjacent bitplanes are sought via a numerical manner,extensive experimental simulations are then carried out to show that the proposed scheme successfully compresses the first 3 and 4 most significant bitplanes(MSBs)for most test gray images and the others with a large portion of smooth area,respectively.Thus,the proposed scheme achieves significant improvement against the state-of-the-art leveraging the 2-D Markov source model at the receiver and is comparable or somewhat inferior to that using the resolution-progressive strategy in recovery.

An image joint compression-encryption algorithm based on adaptive arithmetic coding

Through a series of studies on arithmetic coding and arithmetic encryption, a novel image joint compression- encryption algorithm based on adaptive arithmetic coding is proposed. The contexts produced in the process of image compression are modified by keys in order to achieve image joint compression encryption. Combined with the bit-plane coding technique, the discrete wavelet transform coefficients in different resolutions can be encrypted respectively with different keys, so that the resolution selective encryption is realized to meet different application needs. Zero-tree coding is improved, and adaptive arithmetic coding is introduced. Then, the proposed joint compression-encryption algorithm is simulated. The simulation results show that as long as the parameters are selected appropriately, the compression efficiency of proposed image joint compression-encryption algorithm is basically identical to that of the original image compression algorithm, and the security of the proposed algorithm is better than the joint encryption algorithm based on interval splitting.

Novel Image Encryption and Compression Scheme for IoT Environment

Latest advancements made in the processing abilities of smartdevices have resulted in the designing of Intelligent Internet of Things (IoT)environment. This advanced environment enables the nodes to connect, collect, perceive, and examine useful data from its surroundings. Wireless Multimedia Surveillance Networks (WMSNs) form a vital part in IoT-assistedenvironment since it contains visual sensors that examine the surroundingsfrom a number of overlapping views by capturing the images incessantly.Since IoT devices generate a massive quantity of digital media, it is thereforerequired to save the media, especially images, in a secure way. In order toachieve security, encryption techniques as well as compression techniques areemployed to reduce the amount of digital data, being communicated overthe network. Encryption Then Compression (ETC) techniques pave a wayfor secure and compact transmission of the available data to prevent unauthorized access. With this background, the current research paper presentsa new ETC technique to accomplish image security in IoT environment.The proposed model involves three major processes namely, IoT-based imageacquisition, encryption, and compression. The presented model involves optimal Signcryption Technique with Whale Optimization Algorithm (NMWOA)abbreviated as ST-NMWOA. The optimal key generation of signcryptiontechnique takes place with the help of NMWOA. Besides, the presented modelalso uses Discrete Fourier Transform (DFT) and Matrix Minimization (MM)algorithm-based compression technique. Extensive set of experimental analysis was conducted to validate the effective performance of the proposed model.The obtained values infer that the presented model is superior in terms of bothcompression efficiency and data secrecy in resource-limited IoT environment.

Internet-Oriented Optimization Schemes for Joint Compression and Encryption

Compression and encryption are widely used in network traffic in order to improve efficiency and security of some systems.We propose a scheme to concatenate both functions and run them in a paralle pipelined fashion,demonstrating both a hardware and a software implementation.With minor modifications to the hardware accelerators,latency can be reduced to half.Furthermore,we also propose a seminal and more efficient scheme,where we integrate the technology of encryption into the compression algorithm.Our new integrated optimization scheme reaches an increase of 1.6X by using parallel software scheme However,the security level of our new scheme is not desirable compare with previous ones.Fortunately,we prove that this does not affect the application of our schemes.

A Color Image Encryption Scheme Based on Singular Values and Chaos

The security of digital images transmitted via the Internet or other public media is of the utmost importance.Image encryption is a method of keeping an image secure while it travels across a non-secure communication medium where it could be intercepted by unauthorized entities.This study provides an approach to color image encryption that could find practical use in various contexts.The proposed method,which combines four chaotic systems,employs singular value decomposition and a chaotic sequence,making it both secure and compression-friendly.The unified average change intensity,the number of pixels’change rate,information entropy analysis,correlation coefficient analysis,compression friendliness,and security against brute force,statistical analysis and differential attacks are all used to evaluate the algorithm’s performance.Following a thorough investigation of the experimental data,it is concluded that the proposed image encryption approach is secure against a wide range of attacks and provides superior compression friendliness when compared to chaos-based alternatives.

Multiple-image encryption by two-step phase-shifting interferometry and spatial multiplexing of smooth compressed signal

A multiple-image encryption method based on two-step phase-shifting interferometry （PSI） and spatial multiplexing of a smooth compressed signal is proposed. In the encoding and encryption process, with the help of four index matrices to store original pixel positions, all the pixels of four secret images are firstly reordered in an ascending order; then, the four reordered images are transformed by five-order Haar wavelet transform and performed sparseness operation. After Arnold transform and pixels sampling operation, one combined image can be grouped with the aid of compressive sensing （CS） and spatial multiplexing techniques. Finally, putting the combined image at the input plane of the PSI encryption scheme, only two interferograms ciphertexts can be obtained. During the decoding and decryption, utilizing all the secret key groups and index matrices keys, all the original secret images can be successfully decrypted by a wave-front retrieval algorithm of two-step PSI, spatial de-multiplexing, inverse Arnold transform, inverse discrete wavelet transform, and pixels reordering operation.

A joint image encryption and watermarking algorithm based on compressive sensing and chaotic map

In this paper, a compressive sensing （CS） and chaotic map-based joint image encryption and watermarking algorithm is proposed. The transform domain coefficients of the original image are scrambled by Arnold map firstly. Then the watermark is adhered to the scrambled data. By compressive sensing, a set of watermarked measurements is obtained as the watermarked cipher image. In this algorithm, watermark embedding and data compression can be performed without knowing the original image; similarly, watermark extraction will not interfere with decryption. Due to the characteristics of CS, this algorithm features compressible cipher image size, flexible watermark capacity, and lossless watermark extraction from the compressed cipher image as well as robustness against packet loss. Simulation results and analyses show that the algorithm achieves good performance in the sense of security, watermark capacity, extraction accuracy, reconstruction, robustness, etc.

A Block Compressed Sensing for Images Selective Encryption in Cloud

The theory of compressed sensing(CS)has been proposed to reduce the processing time and accelerate the scanning process.In this paper,the image recovery task is considered to outsource to the cloud server for its abundant computing and storage resources.However,the cloud server is untrusted then may pose a considerable amount of concern for potential privacy leakage.How to protect data privacy and simultaneously maintain management of the image remains challenging.Motivated by the above challenge,we propose an image encryption algorithm based on chaotic system,CS and image saliency.In our scheme,we outsource the image CS samples to cloud for reduced storage and portable computing.Consider privacy,the scheme ensures the cloud to securely reconstruct image.Theoretical analysis and experiment show the scheme achieves effectiveness,efficiency and high security simultaneously.

Multispectral image compression and encryption method based on tensor decomposition in wavelet domain

Multispectral image compression and encryption algorithms commonly suffer from issues such as low compression efficiency,lack of synchronization between the compression and encryption proces-ses,and degradation of intrinsic image structure.A novel approach is proposed to address these is-sues.Firstly,a chaotic sequence is generated using the Lorenz three-dimensional chaotic mapping to initiate the encryption process,which is XORed with each spectral band of the multispectral image to complete the initial encryption of the image.Then,a two-dimensional lifting 9/7 wavelet transform is applied to the processed image.Next,a key-sensitive Arnold scrambling technique is employed on the resulting low-frequency image.It effectively eliminates spatial redundancy in the multispectral image while enhancing the encryption process.To optimize the compression and encryption processes further,fast Tucker decomposition is applied to the wavelet sub-band tensor.It effectively removes both spectral redundancy and residual spatial redundancy in the multispectral image.Finally,the core tensor and pattern matrix obtained from the decomposition are subjected to entropy encoding,and real-time chaotic encryption is implemented during the encoding process,effectively integrating compression and encryption.The results show that the proposed algorithm is suitable for occasions with high requirements for compression and encryption,and it provides valuable insights for the de-velopment of compression and encryption in multispectral field.

Chaos-based encryption for fractal image coding

A chaos-based cryptosystem for fractal image coding is proposed. The Renyi chaotic map is employed to determine the order of processing the range blocks and to generate the keystream for masking the encoded sequence. Compared with the standard approach of fraetal image coding followed by the Advanced Encryption Standard, our scheme offers a higher sensitivity to both plaintext and ciphertext at a comparable operating efficiency. The keystream generated by the Renyi chaotic map passes the randomness tests set by the United States National Institute of Standards and Technology, and so the proposed scheme is sensitive to the key.

Optical encryption of multiple three-dimensional objects based on multiple interferences and single-pixel digital holography

We present an optical encryption method of multiple three-dimensional objects based on multiple interferences and single-pixel digital holography. By modifying the Mach-Zehnder interferometer, the interference of the multiple objects beams and the one reference beam is used to simultaneously encrypt multiple objects into a ciphertext. During decryption, each three-dimensional object can be decrypted independently without having to decrypt other objects. Since the single- pixel digital holography based on compressive sensing theory is introduced, the encrypted data of this method is effectively reduced. In addition, recording fewer encrypted data can greatly reduce the bandwidth of network transmission. Moreover, the compressive sensing essentially serves as a secret key that makes an intruder attack invalid, which means that the system is more secure than the conventional encryption method. Simulation results demonstrate the feasibility of the proposed method and show that the system has good security performance.

Novel encryption model for multimedia data

A novel encryption model is proposed. It combines encryption process with compression process, and realizes compression and encryption at the same time. The model＇s feasibility and security are analyzed in detail. And the relationship between its security and compression ratio is also analyzed.

High Capacity Data Hiding in Encrypted Image Based on Compressive Sensing for Nonequivalent Resources

To fulfill the requirements of data security in environments with nonequivalent resources,a high capacity data hiding scheme in encrypted image based on compressive sensing(CS)is proposed by fully utilizing the adaptability of CS to nonequivalent resources.The original image is divided into two parts:one part is encrypted with traditional stream cipher;the other part is turned to the prediction error and then encrypted based on CS to vacate room simultaneously.The collected non-image data is firstly encrypted with simple stream cipher.For data security management,the encrypted non-image data is then embedded into the encrypted image,and the scrambling operation is used to further improve security.Finally,the original image and non-image data can be separably recovered and extracted according to the request from the valid users with different access rights.Experimental results demonstrate that the proposed scheme outperforms other data hiding methods based on CS,and is more suitable for nonequivalent resources.

A Reversible Data Hiding Algorithm Based on Image Camouflage and Bit-Plane Compression

Reversible data hiding in encrypted image(RDHEI)is a widely used technique for privacy protection,which has been developed in many applications that require high confidentiality,authentication and integrity.Proposed RDHEI methods do not allow high embedding rate while ensuring losslessly recover the original image.Moreover,the ciphertext form of encrypted image in RDHEI framework is easy to cause the attention of attackers.This paper proposes a reversible data hiding algorithm based on image camouflage encryption and bit plane compression.A camouflage encryption algorithm is used to transform a secret image into another meaningful target image,which can cover both secret image and encryption behavior based on“plaintext to plaintext”transformation.An edge optimization method based on prediction algorithm is designed to improve the image camouflage encryption quality.The reversible data hiding based bit-plane level compression,which can improve the redundancy of the bit plane by Gray coding,is used to embed watermark in the camouflage image.The experimental results also show the superior performance of the method in terms of embedding capacity and image quality.