An Image Encryption Scheme Based on IAVL Permutation Scheme and DNA Operations

Sha, Yuwen; Cao, Yinghong; Yan, Hao; Gao, Xinyu; Mou, Jun

doi:10.1109/access.2021.3094563

Cited by 26 publications

(10 citation statements)

References 58 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We processed original and encrypted image content having 256 dark-dimension intensities in order to estimate the consistency of histograms for the proposed methodology [34]- [35]. An evaluation of the original and encrypted content for the Airplane and Baboon images from the proposed methodology are demonstrated in Fig.…”

Section: B Histogram Uniformity Analysismentioning

confidence: 99%

Discrete Logarithmic Factorial Problem and Einstein Crystal Model Based Public-Key Cryptosystem for Digital Content Confidentiality

et al. 2022

View full text Add to dashboard Cite

Public-key encryption is extensively used to provide digital data confidentiality and deliver the security features, such as nonrepudiation (digital signature) and secure key exchange. Conventional publickey schemes are based on mathematical problems with inflexible constraints, and the security of digital contents relies on computational complexity. In the era of emerging technologies, most public-key image encryption schemes are susceptible to various threats. We propose a novel public-key encryption in this article with near-ring criteria and provide confidentiality to private data with the microstates of the Einstein crystal model. The virtual oscillator generated by microstates of initial oscillators for the common secrets with the public-key scheme produces unique states to encrypt digital data. The privacy-preserved structure, that mimics the data stream of digital content with the behavior of the improved Einstein crystal model, describes a system in terms of microstates to generate diffusion in the plain data with unique states of a virtual oscillator. The performance and digital forensic evaluations, such as randomness, histogram uniformity, pixels' correlation, pixels' similarity, visual strength, pixels' incongruity, key sensitivity, linear and differential attacks, noise, and occlusion attacks analyses, certify the resistivity of the proposed algorithm against potential threats and provide superior capacity in comparison to existing methodologies to hostile certain attacks.

show abstract

Section: B Histogram Uniformity Analysismentioning

confidence: 99%

Discrete Logarithmic Factorial Problem and Einstein Crystal Model Based Public-Key Cryptosystem for Digital Content Confidentiality

et al. 2022

View full text Add to dashboard Cite

show abstract

“…Originated from biology, the DNA (Deoxyribonucleic acid) carries the genetic data of the biological characteristics (Meiser et al 2022 ; Sha et al 2021 ). DNA is composed of two polynucleotide strands where each nucleotide contains one of four nitrogenous bases: Adenine ‘A’, Cytosine ‘C’, Guanine ‘G’, and Thymine ‘T’.…”

Section: Proposed Approachmentioning

confidence: 99%

CADEN: cellular automata and DNA based secure framework for privacy preserving in IoT based healthcare

Hurrah

Khan

Khan³

2022

J Ambient Intell Human Comput

View full text Add to dashboard Cite

In the present E-healthcare industry, data breaches result in substantial economic losses due to cyber-attacks and hence create a trust deficit between the industry and users. The healthcare industry has rapidly adopted IoT frameworks but the trust deficit and privacy concerns limit its utilization among the masses. Along with privacy protection, content authentication is an important requirement in a number of critical applications and fragile watermarking provides an effective solution. However, existing fragile watermarking techniques lack the accuracy of tamper detection and hence are not reliable enough in terms of security and privacy of the data. This paper presents a novel low-complexity block-based fragile watermarking technique with high security against cyber-security attacks. This is achieved by embedding a fragile watermark in the host image using pixel domain blocking approach. The security of embedded watermark has been taken care of by using Cellular Automata and DNA based ENcryption (CADEN) framework to scramble the watermark bits using various secret keys. Experimental investigations show that besides being highly secure, the proposed technique is fragile to various signal processing and geometric attacks. The comparative analysis shows that the proposed scheme, despite having lower complexity, offers better efficiency in terms of imperceptibility, tamper detection and localization compared to other state-of-the-art techniques. Besides, the fragile watermark embedding makes the system capable to preserve the secret information in case of an attack with an average BER of 40%.

show abstract

“…In contrast, multiple scrambling and diffusion repetitions are time-consuming and significantly reduce the encryption efficiency [ 18 ]. To address the above shortcomings, researchers have combined scrambling and diffusion and proposed bit-level scrambling with simultaneous scrambling and diffusion to encrypt images [ 19 , 20 , 21 , 22 ]. The bit-level scrambling divides the pixel value into eight bits, disrupting the bit positions to achieve the simultaneous scrambling and diffusion of pixels.…”

Section: Introductionmentioning

confidence: 99%

An Image Encryption Algorithm Based on Improved Hilbert Curve Scrambling and Dynamic DNA Coding

Geng

Zhang

et al. 2023

Entropy

View full text Add to dashboard Cite

As an effective method for image security protection, image encryption is widely used in data hiding and content protection. This paper proposes an image encryption algorithm based on an improved Hilbert curve with DNA coding. Firstly, the discrete wavelet transform (DWT) decomposes the plaintext image by three-level DWT to obtain the high-frequency and low-frequency components. Secondly, different modes of the Hilbert curve are selected to scramble the high-frequency and low-frequency components. Then, the high-frequency and low-frequency components are reconstructed separately using the inverse discrete wavelet transform (IDWT). Then, the bit matrix of the image pixels is scrambled, changing the pixel value while changing the pixel position and weakening the strong correlation between adjacent pixels to a more significant correlation. Finally, combining dynamic DNA coding and ciphertext feedback to diffuse the pixel values improves the encryption effect. The encryption algorithm performs the scrambling and diffusion in alternating transformations of space, frequency, and spatial domains, breaking the limitations of conventional scrambling. The experimental simulation results and security analysis show that the encryption algorithm can effectively resist statistical attacks and differential attacks with good security and robustness.

show abstract

An Image Encryption Scheme Based on IAVL Permutation Scheme and DNA Operations

Cited by 26 publications

References 58 publications

Discrete Logarithmic Factorial Problem and Einstein Crystal Model Based Public-Key Cryptosystem for Digital Content Confidentiality

Discrete Logarithmic Factorial Problem and Einstein Crystal Model Based Public-Key Cryptosystem for Digital Content Confidentiality

CADEN: cellular automata and DNA based secure framework for privacy preserving in IoT based healthcare

An Image Encryption Algorithm Based on Improved Hilbert Curve Scrambling and Dynamic DNA Coding

Contact Info

Product

Resources

About