An Improved Chaos-Based Image Encryption Scheme

Fu, Chong; Zhang, Zhenchuan; Chen, Ying; Wang, Xingwei

doi:10.1007/978-3-540-72584-8_76

Cited by 12 publications

(8 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Chaos Theory is the major researched source in the field of key generation of an image encryption based on its properties of sensitivity of initial value, random behaviors, non-periodic, unpredictable and Correlation properties (Fu et al, 2007). The Chaos system comprises two main phases: confusion and diffusion phases.…”

Section: Chaotic Map Methodsmentioning

confidence: 99%

A Novel Dynamic Secret key Generation for an Efficient Image Encryption Algorithm

Jawad

Sulong

2015

MAS

View full text Add to dashboard Cite

Today, the security of digital images is considered a significant essential and a strong secret key plays a major role in the image encryption. In this paper, a novel method for generating dynamic non-linear secret keys for a symmetric block cipher using XOR-operation is proposed. The dynamic non-linear secret keys generation is based on a combination of logistic and piecewise chaotic map methods with a new automatic creation of initial seed values. The automatic initial seed values creation depends on the development of a novel strategy for seeds creation based on sunflower spiral points. The experimental results indicate that the proposed key generator algorithm has the advantage of large key space with a safety protection of brute force attack. Therefore, the performance analysis of image encryption reveals a correlation coefficient of about (-0.0001) and entropy greater than (7.9978). Furthermore, the results show high security for encryption based on strong dynamic secret key properties.

show abstract

Section: Chaotic Map Methodsmentioning

confidence: 99%

A Novel Dynamic Secret key Generation for an Efficient Image Encryption Algorithm

Jawad

Sulong

2015

MAS

View full text Add to dashboard Cite

show abstract

“…The creation of block and encryption should be carried out in such a way that the encrypted image does not reveal any structural information about its original contents. Other recent approaches in image security are based on chaotic functions, which are characterized by ergodicity (stochastic behavior of image), extreme dependence on initial condition and randomness in the image [15][16][17]. The use of carrier image for the encryption of image has been presented in [18] using private key cryptosystem in the frequency domain.…”

Section: Image Encryptionmentioning

confidence: 99%

Application of homomorphism to secure image sharing

Islam

Puech

Hayat

et al. 2011

Optics Communications

View full text Add to dashboard Cite

In this paper, we present a new approach for sharing images between l players by exploiting the additive and multiplicative homomorphic properties of two well-known public key cryptosystems, i.e. RSA and Paillier. Contrary to the traditional schemes, the proposed approach employs secret sharing in a way that limits the influence of the dealer over the protocol and allows each player to participate with the help of his key-image. With the proposed approach, during the encryption step, each player encrypts his own key-image using the dealer's public key. The dealer encrypts the secret-to-be-shared image with the same public key and then, the l encrypted key-images plus the encrypted to-be shared image are multiplied homomorphically to get another encrypted image. After this step, the dealer can safely get a scrambled image which corresponds to the addition or multiplication of the l + 1 original images (l key-images plus the secret image) because of the additive homomorphic property of the Paillier algorithm or multiplicative homomorphic property of the RSA algorithm. When the l players want to extract the secret image, they do not need to use keys and the dealer has no role. Indeed, with our approach, to extract the secret image, the l players need only to subtract their own key-image with no specific order from the scrambled image. Thus, the proposed approach provides an opportunity to use operators like multiplication on encrypted images for the development of a secure privacy preserving protocol in the image domain. We show that it is still possible to extract a visible version of the secret image with only l-1 key-images (when one key-image is missing) or when the l key-images used for the extraction are different from the l original key-images due to a lossy compression for example. Experimental results and security analysis verify and prove that the proposed approach is secure from cryptographic viewpoint.

show abstract

“…So, image security researches have become a hot issue in the current digital world. Accordingly, several algorithms are proposed for protecting digital images [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18]. Among them, chaotic based systems present several desired cryptographic characteristics such as an efficient and simple implementation which ensures a high encryption rate.…”

Section: Introductionmentioning

confidence: 99%

“…Indeed, several chaos-based ciphers have been suggested in the last decade. Some of them exploit 1-D chaotic systems for generating the required secret keys [7,12,18]. After generating the key, the image pixels are then shuffled and modified according to the obtained key.…”

Section: Introductionmentioning

confidence: 99%

Chaos Encryption Algorithm using Key Generation from Biometric Image

Meligy¹,

Diab²,

El-Danaf³

2016

IJCA

View full text Add to dashboard Cite

Recently, chaos based encryption techniques introduce several merits over the classical techniques such as extensive security levels, complexity and fast speed. In this paper, a chaotic based cipher that incorporates both Logistic chaotic map and Tent map is proposed. An external biometric key of length 256-bits is employed to derive the initial seeds of the applied chaotic maps. In the encipher stage, the pixels information are masked based on an iterative structure using a data-dependent feedback mechanism that mixes the current cipher parameters with the previously enciphered pixels. Accordingly, the relation of the enciphered image and the original image is confused and the suggested cipher can defeat any attack. The experiments reveal the high efficiency of the proposed algorithm in addition to its sensitivity to secret key changes and its resistance to different types of attacks.

show abstract

An Improved Chaos-Based Image Encryption Scheme

Cited by 12 publications

References 14 publications

A Novel Dynamic Secret key Generation for an Efficient Image Encryption Algorithm

A Novel Dynamic Secret key Generation for an Efficient Image Encryption Algorithm

Application of homomorphism to secure image sharing

Chaos Encryption Algorithm using Key Generation from Biometric Image

Contact Info

Product

Resources

About