A novel encryption scheme for colored image based on high level chaotic maps

Mollaeefar, Majid; Sharif, Amir; Nazari, Mahboubeh

doi:10.1007/s11042-015-3064-9

Cited by 88 publications

(38 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Assume n is an integer and x ∈ [−1, 1]. The Chebyshev polynomial T n ( x ) : [−1, 1] → [−1, 1] is defined as (1), and the recurrence relation of T n ( x ) is defined as (2)

T_{n} ((), x) = cos ((), n italicarccos ((), x))

T_{n} ((), x) = 2 x T_{n - 1} ((), x) - T_{n - 2} ((), x); n \geq 2, T_{0} ((), x) = 1, T_{1} ((), x) = x

One of the most important properties of the Chebyshev polynomials is the semigroup property (3).…”

Section: Preliminaries and Threat Modelmentioning

confidence: 99%

Efficient privacy‐preserving authentication scheme for roaming consumer in global mobility networks

Ostad-Sharif

Babamohammadi

Abbasinezhad-Mood

et al. 2019

Int J Communication

View full text Add to dashboard Cite

The advancements in wireless technologies have paved the way for offering seamless services to mobile consumers in global mobility networks (GLOMONETs). Nonetheless, since in these networks, the communication channels are open and public, devising proper measures to protect the security and privacy of exchanging messages is critical. Moreover, because of the energy and computational power limitations of the mobile devices, a security mechanism should put the least possible burden on these devices. To do so, plenty authentication schemes have been proposed in recent years to be employed in the context of GLOMONETs. Quite recently, four interesting authentication and key agreement schemes have been put forward, which have improved the efficiency and security of their previous related schemes. Besides the nice contributions of these four, in this paper, it is first indicated that all of them are vulnerable to the known session-specific information attack. Then, a new chaotic map-based authentication scheme is presented that not only is secure against the aforementioned attack but also has less computational complexity and communication overhead. The comprehensive descriptive discussion on security alongside the formal verification of security using the widely accepted ProVerif tool show that our scheme is secure against the known attacks, and the comparative performance analysis demonstrates its betterment for the constrained-resource mobile devices.

show abstract

“…Assume n is an integer and x ∈ [−1, 1]. The Chebyshev polynomial T n ( x ) : [−1, 1] → [−1, 1] is defined as (1), and the recurrence relation of T n ( x ) is defined as (2)

T_{n} ((), x) = cos ((), n italicarccos ((), x))

T_{n} ((), x) = 2 x T_{n - 1} ((), x) - T_{n - 2} ((), x); n \geq 2, T_{0} ((), x) = 1, T_{1} ((), x) = x

One of the most important properties of the Chebyshev polynomials is the semigroup property (3).…”

Section: Preliminaries and Threat Modelmentioning

confidence: 99%

Efficient privacy‐preserving authentication scheme for roaming consumer in global mobility networks

Ostad-Sharif

Babamohammadi

Abbasinezhad-Mood

et al. 2019

Int J Communication

View full text Add to dashboard Cite

show abstract

“…More recently, in order to resist the powerful chosen-plaintext and chosen-ciphertext attacks, a plaintext related image encryption scheme was proposed [ 12 , 23 , 34 , 35 , 36 , 37 , 38 , 39 , 40 , 41 ]. For some algorithms, the previous encrypted pixel is used to encrypt the current pixel, and after several rounds of processing in the diffusion stage of some algorithms, so the information of one pixel in the plain-image can be spread into the entire cipher image [ 23 , 35 , 36 ].…”

Section: Introductionmentioning

confidence: 99%

A Symmetric Plaintext-Related Color Image Encryption System Based on Bit Permutation

Cai

Huang

Chen

et al. 2018

Entropy

View full text Add to dashboard Cite

Abstract:Recently, a variety of chaos-based image encryption algorithms adopting the traditional permutation-diffusion structure have been suggested. Most of these algorithms cannot resist the powerful chosen-plaintext attack and chosen-ciphertext attack efficiently for less sensitivity to plain-image. This paper presents a symmetric color image encryption system based on plaintext-related random access bit-permutation mechanism (PRRABPM). In the proposed scheme, a new random access bit-permutation mechanism is used to shuffle 3D bit matrix transformed from an original color image, making the RGB components of the color image interact with each other. Furthermore, the key streams used in random access bit-permutation mechanism operation are extremely dependent on plain image in an ingenious way. Therefore, the encryption system is sensitive to tiny differences in key and original images, which means that it can efficiently resist chosen-plaintext attack and chosen-ciphertext attack. In the diffusion stage, the previous encrypted pixel is used to encrypt the current pixel. The simulation results show that even though the permutation-diffusion operation in our encryption scheme is performed only one time, the proposed algorithm has favorable security performance. Considering real-time applications, the encryption speed can be further improved.

show abstract

“…However, and for the S-box generation algorithm and for the bit exclusive OR (XOR) are obtained only from the fixed keys. A plain-image-based keystream generation was proposed in [34], in which pixel summation , , for the pixels were computed to affect the secret keys. However, if we modify two pixels with same summation for the plain-image, then the keystream will also be the same.…”

Section: Introductionmentioning

confidence: 99%

An Effective Framework for Chaotic Image Encryption Based on 3D Logistic Map

Jiao

Pan

et al. 2018

Security and Communication Networks

View full text Add to dashboard Cite

In this paper, an effective framework for chaotic encryption based on a three-dimensional logistic map is presented together with secure hash algorithm-3 (SHA-3) and electrocardiograph (ECG) signal. Following the analysis of the drawbacks, namely, fixed key and low sensitivity, of some current algorithms, this work tries to solve these two problems and includes two contributions: (1) removal of the phenomenon of summation invariance in a plain-image, for which SHA-3 is proposed to calculate the hash value for the plain-image, with the results being employed to influence the initial keys for chaotic map; (2) resolution of the problem of fixed key by using an ECG signal, that can be different for different subjects or different for same subject at different times. The Wolf algorithm is employed to produce all the control parameters and initial keys in the proposed encryption method. It is believed that combining with the classical architecture of permutation-diffusion, the summation invariance in the plain-image and shortcoming of a fixed key will be avoided in our algorithm. Furthermore, the experimental results and security analysis show that the proposed encryption algorithm can achieve confidentiality.

show abstract

A novel encryption scheme for colored image based on high level chaotic maps

Cited by 88 publications

References 24 publications

Efficient privacy‐preserving authentication scheme for roaming consumer in global mobility networks

Efficient privacy‐preserving authentication scheme for roaming consumer in global mobility networks

A Symmetric Plaintext-Related Color Image Encryption System Based on Bit Permutation

An Effective Framework for Chaotic Image Encryption Based on 3D Logistic Map

Contact Info

Product

Resources

About