Application of chaotic maps for simultaneous lossy image compression and encryption

Yuen, Ching-Hung; Lui, Oi-Yan; Wong, Kwok-Wo

doi:10.1109/iscas.2012.6272045

Cited by 4 publications

(5 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Traditionally, the sampled data are first compressed and then encrypted, if necessary. There is an increasing research interest on joint compression and encryption [1][2][3][4][5][6][7][8][9][10] coding and Huffman coding. Wu and Kuo [1] suggested two approaches for integrating encryption with multimedia compression systems, i.e., selective encryption and modified entropy coders with multiple statistical models.…”

Section: A Existing Work On Joint Compression and Encryptionmentioning

confidence: 99%

“…Traditionally, the sampled data are first compressed and then encrypted, if necessary. There is an increasing research interest on joint compression and encryption [1][2][3][4][5][6][7][8][9][10] mostly by leveraging chaos theory and source coding schemes including arithmetic Manuscript received Mar. 23,2014.…”

Section: A Existing Work On Joint Compression and Encryptionmentioning

confidence: 99%

“…Wong et al [7] designed an algorithm for embedding compression in the Baptista-type chaotic cryptosystem and Chen et al [8] further improved its compression performance. Besides, there exist some chaos-based compression and encryption schemes aiming at multimedia data such as image [9] or video [10]. These works are based on the traditional Shannon/Nyquist sampling theory.…”

Section: A Existing Work On Joint Compression and Encryptionmentioning

confidence: 99%

See 2 more Smart Citations

Embedding cryptographic features in compressive sensing

et al. 2016

Self Cite

View full text Add to dashboard Cite

Compressive sensing (CS) has been widely studied and applied in many fields. Recently, the way to perform secure compressive sensing (SCS) has become a topic of growing interest. The existing works on SCS usually take the sensing matrix as a key and the resultant security level is not evaluated in depth. They can only be considered as a preliminary exploration on SCS, but a concrete and operable encipher model is not given yet. In this paper, we are going to investigate SCS in a systematic way. The relationship between CS and symmetric-key cipher indicates some possible encryption models. To this end, we propose the twolevel protection models (TLPM) for SCS which are developed from measurements taking and "something else", respectively. It is believed that these models will provide a new point of view and stimulate further research in both CS and cryptography. Specifically, an efficient and secure encryption scheme for parallel compressive sensing (PCS) is designed by embedding a two-layer protection in PCS using chaos. The first layer is undertaken by random permutation on a two-dimensional signal, which is proved to be an acceptable permutation with overwhelming probability. The other layer is to sample the permuted signal column by column with the same chaotic measurement matrix, which satisfies the restricted isometry property of PCS with overwhelming probability. Both the random permutation and the measurement matrix are constructed under the control of a chaotic system. Simulation results show that unlike the general joint compression and encryption schemes in which encryption always leads to the same or a lower compression ratio, the proposed approach of embedding encryption in PCS actually improves the compression performance. Besides, the proposed approach possesses high transmission robustness against additive Gaussian white noise and cropping attack.Index Terms-Secure compressive sensing, two-level protection models, symmetric-key cipher, parallel compressive sensing, random permutation, chaotic measurement matrix.

show abstract

Section: A Existing Work On Joint Compression and Encryptionmentioning

confidence: 99%

“…Traditionally, the sampled data are first compressed and then encrypted, if necessary. There is an increasing research interest on joint compression and encryption [1][2][3][4][5][6][7][8][9][10] mostly by leveraging chaos theory and source coding schemes including arithmetic Manuscript received Mar. 23,2014.…”

Section: A Existing Work On Joint Compression and Encryptionmentioning

confidence: 99%

Section: A Existing Work On Joint Compression and Encryptionmentioning

confidence: 99%

See 1 more Smart Citation

Embedding cryptographic features in compressive sensing

et al. 2016

Self Cite

View full text Add to dashboard Cite

show abstract

“…Chaos has aroused a research interest in various fields of cryptography due to its inherent random-like behaviours. In the last 20 years, a large number of cryptographic algorithms based on chaos have been proposed [1][2][3] and digital chaos systems have been employed in most of these cryptosystems. However, when chaos is realized in computers or digital circuits, a chaos system often suffers dynamical degradation, which refers to the short cycle length, non-ergodicity, low linear-complexity and strong correlation.…”

Section: Introductionmentioning

confidence: 99%

A perturbation method to the tent map based on Lyapunov exponent and its application

et al. 2015

View full text Add to dashboard Cite

Perturbation imposed on a chaos system is an effective way to maintain its chaotic features. A novel parameter perturbation method for the tent map based on the Lyapunov exponent is proposed in this paper. The pseudo-random sequence generated by the tent map is sent to another chaos function — the Chebyshev map for the post processing. If the output value of the Chebyshev map falls into a certain range, it will be sent back to replace the parameter of the tent map. As a result, the parameter of the tent map keeps changing dynamically. The statistical analysis and experimental results prove that the disturbed tent map has a highly random distribution and achieves good cryptographic properties of a pseudo-random sequence. As a result, it weakens the phenomenon of strong correlation caused by the finite precision and effectively compensates for the digital chaos system dynamics degradation.

show abstract

“…Encryption and compression in these processes are chronological. So it is a hotspot to study on compressing and encrypting color images simultaneously [10][11][12] . An encrypted compression scheme for color image is proposed to compress color images while encrypting it.…”

Section: Introductionmentioning

confidence: 99%

Encryption and Compression Scheme of Color Image Based on a Hyperchaotic System

Jiao¹,

Gong²

2013

Int. J. Onl. Eng.

View full text Add to dashboard Cite

Abstract-In order to encrypt and compress a color image simultaneously, an encryption and compression algorithm for color image was proposed based on a hyperchaotic system. A hyperchaotic system was utilized to make a pure white image into a uniform distribution and colorful palette. In compression process, indexing technology was utilized to map the 3D data of color image to two-dimensional subscript of palette. The compressed image would continue to be encrypted by loop feedback in physical space and time space. Simulation experiments show that the algorithm is realized to encrypt and compress a color image simultaneously. It has large key space, high security, and big compression ratio as well as great application value in secure communication of color image.

show abstract

Application of chaotic maps for simultaneous lossy image compression and encryption

Cited by 4 publications

References 9 publications

Embedding cryptographic features in compressive sensing

Embedding cryptographic features in compressive sensing

A perturbation method to the tent map based on Lyapunov exponent and its application

Encryption and Compression Scheme of Color Image Based on a Hyperchaotic System

Contact Info

Product

Resources

About