Arnold Scrambling Research Articles

A Quantum Image Secret Sharing Scheme Based on Designated Multi‐Verifier Signature

AbstractThis paper presents a quantum image secret sharing scheme based on designated multi‐verifier signature. First, share images are generated by a 2D hyperchaotic system incorporating sinusoidal mapping, Henon mapping, and Cubic mapping using the cascade modulation method. Quantum Arnold scrambling and diffusion are performed on the secret image. Subsequently, the concept of designated multi‐verifier signature is introduced. In the secret image sharing phase, the pixel values of the share images are used to sign the secret image, and the signed secret image and share images are sent to a trusted third party and designated verifiers, respectively. In this scheme, no carrier images are required, and the share images held by the participants do not contain any information about the secret image. Finally, simulation experiments and security analysis are conducted on IBM Qiskit platform and Matlab software.

Safe-LBP: A visually meaningful image encryption scheme based on LBP and compressive sensing

Recently, some visually meaningful image encryption schemes have been proposed to protect the visual security of images. However, much of the existing literature on visual image encryption ignores the features of cover images. To address the above issues, this paper proposes a content-adaptive visual image encryption scheme based on piecewise linear chaotic map (PWLCM), compressive sensing (CS), and safe local binary pattern (Safe-LBP). First of all, the plain image are sparse by applying discrete wavelet transform (DWT). Secondly, the cipher data is obtained by encrypting and compressing the sparse matrix using Arnold scrambling and CS. Next, we design a new LBP operator to discover appropriate embedding place in the cover image, which tremendously improves the imperceptibility of the cipher image. Finally, the visually meaningful steganographic image is obtained by embedded all cipher data through the least significant bit (LSB) method. Simulations and comparisons show that the proposed algorithm has excellent visual security and decryption quality and proves its robustness against various types of noises and data loss.

Encryption algorithm based on fractional order chaotic system combined with adaptive predefined time synchronization

An image encryption and decryption method of fractional order chaotic systems (FOCS) with predefined time synchronization is proposed in this article. Compared with the existing integer order chaotic systems (IOCS), fractional order chaotic systems has the advantage of increasing the complexity of the ciphertext. At the same time, by using the predefined synchronization time, the key space is expanded, the complexity of the key is increased, and the security of the algorithm is improved. To further improve the security of encryption and decryption process, this article uses a combination of DNA encoding, row/column cyclic shift and XOR diffusion, position scrambling and Arnold scrambling. The simulation tests of image encryption and decryption are carried out, and the effectiveness and advantages of the proposed encryption/decryption method are verified by histogram analysis, correlation analysis, entropy analysis, key sensitivity analysis and plaintext sensitivity analysis.

A Color Image Encryption Algorithm with Cat Map and Chaos Map Embedded

In order to deal with the problem of encryption algorithms being overly simplistic, and the relatively low security of color images that creates potential to be attacked in the transmission process, this paper will introduce a new encryption algorithm that is designed to divide color images into R, G and B layers. In the scrambling operation: the first scrambling is aimed to block the clear text image scrambling; The second scrambling is the dynamic Arnold scrambling of the ciphertext after the first scrambling. In the diffusion operation, the scrambled ciphertext image was taken as the input, and the pseudo-random sequence generated by Tent mapping and Sine mapping was embedded. The sequence generated by Logistic mapping was used to select sub-blocks for block diffusion of the image. Tent-Sine mapping was applied to the second diffusion to obtain the final ciphertext image. The algorithm designed in this paper combines image block scrambling and dynamic Arnold scrambling, the scrambling degree of each layer of image pixels would be greatly improved, thus improving the security of color images. In the process of diffusion, chaos sequence is selected for diffusion operation, which increases the difficulty of decoding ciphertext. The simulation results show that the new algorithm has desirable encryption effect, strong key sensitivity and large key space, and complex encryption algorithm can effectively resist attacks, which certainly has value in image information security.

New watermarking algorithm utilizing quaternion Fourier transform with advanced scrambling and secure encryption

Digital watermarking technology, as a powerful tool for copyright protection and content authentication of multimedia works, has received increasing attention, and the current image watermarking technology has developed significantly. Generally, embedding a watermark is done in grayscale images, mainly due to the fact that grayscale images are easier to process than color images, and grayscale images only contain brightness information and color-free information, in which an embedded watermark will not produce new color components. In real life, however, color images are more common than grayscale image information. To improve the security of the watermark information and the ability to embed the location and improve the security of the algorithm against a variety of attacks, this paper proposes an algorithm based on quaternion Fourier transform (QFT) with chaotic encryption and Arnold scrambling. Geometric Algebra (GA) can process color images in the form of vectors, and each component of Red,Green and Blue (RGB) should be processed separately. We utilized quaternion (which is a subalgebra of GA) and effectively completed color image processing by utilizing Fourier transform. After utilizing QFT, each component was made more secure by scrambling the pixels of the watermark and performing encryption utilizing chaotic sequencing. Different types of results utilizing Mean Square Error (MSE),Peak Signal to Noise Ratio (PSNR),Structure Similiarity Index Metric (SSIM), etc. were computed to verify the performance of our proposed algorithm and show that the robustness and security are high by utilizing our method.

Copyright Protection and Security of Medical Health Record Using Arnold Scrambling in Transform Domain

Copyright Protection and Security of Medical Health Record Using Arnold Scrambling in Transform Domain

Hybrid Watermarking Algorithm Using Clifford Algebra With Arnold Scrambling and Chaotic Encryption

With the widespread use of color images, the copyright protection of those images using watermarks is one of the latest research topics. The use of color images as watermarks has advantages over binary and irreplaceable grayscale images. Color images are intuitive, rich, and lively; they have large amounts of copyright protection information and more easily recognized by human vision. To improve the security of watermark information and embedding positions and improve the algorithm’s robustness against various attacks, a Quaternion Fourier transform (QFT) based algorithm, based on Arnold transform and chaotic encryption, is proposed in this paper. Geometric algebra (GA) can deal with color images in vector form with each component of RGB handled individually. We used Quaternion, which is a sub-algebra of GA, and effectively handled color image processing by using Fourier transformation. After deriving the calculation process of the QFT with strong security by Arnold scrambling and chaotic encryption, this paper proposes a digital watermarking algorithm that resists geometric attacks by using color images as carriers. The robustness and quality of the proposed watermarking algorithm is tested with different with many statistical measures. Experimental outcomes show that the proposed approach is the best to solve conflict problems between quality and robustness. Also, the proposed approach exhibits worthy robustness against many attacks, such as, conventional attacks, and geometrical attacks.

A novel image encryption scheme based on Arnold scrambling and Lucas series

Secure data transmission over the public channels have high impact and increasingly important due to theft and manipulation in contents. The requirement of public/ private organizations to develop an efficient scheme to provide security to their contents. We developed a digital contents encryption scheme based Arnold scrambling and Lucas series, which is very simple to implement but almost impossible to breach in this article. We perform encryption at standard images by using Lucas series at different iterations of scrambled images of Arnold transform. Numerical simulation analyses performed to analyze the efficiency and effectiveness of the projected structure.

Secure Data Transmission of Video Steganography Using Arnold Scrambling and DWT

Secure Data Transmission of Video Steganography Using Arnold Scrambling and DWT

Flexible and Secure Data Transmission System Based on Semitensor Compressive Sensing in Wireless Body Area Networks

Wireless body area networks (WBANs) collect some physiological parameters of the human body. Each sensor uses limited energy to maximize its own life. There are three crucial problems including adaptiveness, energy, and security in WBANs. In order to solve these problems, a flexible and secure data transmission system is proposed in this paper. The proposed scheme is composed of semitensor compressive sensing (CS), hash function, Arnold scrambling, and chaotic scrambling. For the adaptiveness problem, our scheme uses semitensor CS to encrypt multiple signals with different dimensions. The chaotic sequence is applied to generate the semitensor measurement matrix. On the one hand, we only transmit a few chaotic parameters, which reduces the number of data storage and transmission. On the other hand, the size of the measurement matrix is small, and the computation overhead can be reduced. The security is considered by the proposed scheme which combines Arnold scrambling and logistic scrambling to improve the encryption effect. Numerical simulations and security analyses are given to show that our scheme performs well. The total key space is approximately 2420. The absolute value of adjacent pixel correlation is less than 0.004. Traditional CS method stores 524 288 bytes, while the proposed scheme only stores 2048 bytes. When the compression ratio is less than 0.7, the peak signal to noise ratio of our scheme is obviously higher than those of other three schemes.

A Novel Quantum Image Steganography Scheme Based on LSB

Based on the NEQR representation of quantum images and least significant bit (LSB) scheme, a novel quantum image steganography scheme is proposed. The sizes of the cover image and the original information image are assumed to be 4n × 4n and n × n, respectively. Firstly, the bit-plane scrambling method is used to scramble the original information image. Then the scrambled information image is expanded to the same size of the cover image by using the key only known to the operator. The expanded image is scrambled to be a meaningless image with the Arnold scrambling. The embedding procedure and extracting procedure are carried out by K1 and K2 which are under control of the operator. For validation of the presented scheme, the peak-signal-to-noise ratio (PSNR), the capacity, the security of the images and the circuit complexity are analyzed.

A robust reversible image watermarking scheme in DCT domain using Arnold scrambling and histogram modification

Among the various watermarking schemes, the reversible watermarking scheme has drawn extensive attention in the recent years for its application in sensitive issues like medical, military and typical law-enforcement images. Cover image dependent embedding capacity and lack of robustness are the most crucial concerns of the reversible watermarking methods. To overcome these issues, a discrete cosine transform (DCT) and histogram shifting based robust reversible image watermarking scheme using Arnold scrambling is presented in this paper. Initially, the image is decomposed into non-overlapping blocks and consequently DCT are applied to each block to embed a binary bit of watermark into each transformed block by modifying one pair of middle significant AC coefficients. In this initial step, location map is also generated for the cover image restoration purpose in the extracting side. Then, this location map is embedded in the cover image using histogram modification technique. In the receiver side, at first location map is generated from an image using histogram modification method and watermark is recovered from the corresponding image. Using location map reversible image is reversed in the following extracting phase of the proposed method. The proposed reversible watermarking scheme has also been experimented to verify the robustness property against several image processing attacks and satisfactory results are achieved.

A robust reversible image watermarking scheme in DCT domain using Arnold scrambling and histogram modification

Among the various watermarking schemes, the reversible watermarking scheme has drawn extensive attention in the recent years for its application in sensitive issues like medical, military and typical law-enforcement images. Cover image dependent embedding capacity and lack of robustness are the most crucial concerns of the reversible watermarking methods. To overcome these issues, a discrete cosine transform (DCT) and histogram shifting based robust reversible image watermarking scheme using Arnold scrambling is presented in this paper. Initially, the image is decomposed into non-overlapping blocks and consequently DCT are applied to each block to embed a binary bit of watermark into each transformed block by modifying one pair of middle significant AC coefficients. In this initial step, location map is also generated for the cover image restoration purpose in the extracting side. Then, this location map is embedded in the cover image using histogram modification technique. In the receiver side, at first location map is generated from an image using histogram modification method and watermark is recovered from the corresponding image. Using location map reversible image is reversed in the following extracting phase of the proposed method. The proposed reversible watermarking scheme has also been experimented to verify the robustness property against several image processing attacks and satisfactory results are achieved.

An SVD Based Location Specific Robust Color Image Watermarking Scheme Using RDWT and Arnold Scrambling

In recent times, effectiveness of the robust image watermarking scheme almost successfully solves the authenticity and copyright protection problem of images. Among several existing robust watermarking schemes, very few have been designed for color images. In this paper, the authors have proposed a redundant discrete wavelet transform (RDWT) and singular value decomposition based hybrid robust color image watermarking method where scrambled watermark is used for embedding purpose to provide extra security to authentic logo. At first, RGB color image is converted to YCbCr color image and then the Y component of YCbCr color space is used to insert Arnold scrambled grayscale watermark. In the next step, Y component of the YCbCr color model is decomposed into non overlapping blocks and subsequently RDWT are applied to each block. For better imperceptibility and effectiveness, in this proposed algorithm some singular values of RDWT transformed Y component blocks are modified by non overlapping decomposed and scrambled watermark blocks. Robustness of the proposed method is experimented against common geometric transformation attacks (like rotation, flip operation, cropping, scaling, shearing and deletion of lines or column operation etc.), common enhancement technique attacks (like lowpass filtering, histogram equalization, sharpening, gamma correction, noise addition etc.), jpeg compression attacks, some combinational attacks and satisfactory results are achieved. For better evaluation, proposed scheme is verified against standard benchmark software “Checkmark”.

An indirect watermark hiding in discrete cosine transform-singular value decomposition domain for copyright protection.

Digital image watermarking has emerged as a promising solution for copyright protection. In this paper, a discrete cosine transform (DCT) and singular value decomposition (SVD) based hybrid robust image watermarking method using Arnold scrambling is proposed and simulated to protect the copyright of natural images. In this proposed scheme, before embedding, watermark is scrambled with Arnold scrambling. Then, the greyscale cover image and encrypted watermark logo are decomposed into non-overlapping blocks and subsequently some selected image blocks are transformed into the DCT domain for inserting the watermark blocks permanently. For better imperceptibility and effectiveness, in this proposed algorithm, watermark image blocks are embedded into singular values of selected blocks by multiplying with a feasible scaling factor. Simulation result demonstrates that robustness is achieved by recovering satisfactory watermark data from the reconstructed cover image after applying common geometric transformation attacks (such as rotation, flip operation, cropping, scaling, shearing and deletion of lines or columns operation), common enhancement technique attacks (such as low-pass filtering, histogram equalization, sharpening, gamma correction, noise addition) and jpeg compression attacks.

A robust blind hybrid image watermarking scheme in RDWT-DCT domain using Arnold scrambling

To compromise between imperceptibility and robustness property of robust image watermarking technique, a RDWT-DCT based blind image watermarking scheme using Arnold scrambling is presented in this paper. Firstly, RDWT (Redundant Discrete Wavelet Transform) is applied to each gray scale cover image block after the image is decomposed into fixed size non overlapping blocks. Secondly, the binary watermark logo is encrypted by Arnold chaotic map and reshaped to a sequence to improve the security of the logo. In the subsequent step, DCT (Discrete Cosine Transform) is employed on each LH subband of the non-overlapping host image block. Finally, after zigzag scanning of each DCT block a binary bit of watermark is embedded into each block by adjusting some middle significant AC coefficients using repetition code. Experimental results show that robustness is achieved by recovering satisfactory watermark data from the reconstructed cover image after applying common geometric transformation attacks (like rotation, cropping, scaling, shearing and deletion of lines or column operation etc.), common enhancement technique attacks (like lowpass filtering, histogram equalization, sharpening, gamma correction, noise addition etc.) and JPEG compression attacks. The proposed scheme is also tested to verify the robustness performance against standard benchmark software "Checkmark" and satisfactory results are achieved against the Checkmark attacks such as Hard and Soft Thresholding, Template Removal, Warping, Dithering, Remodulation and Downsampling/Upsampling etc.

A Secure and Robust Image Watermarking System Using Normalization and Arnold Scrambling

This article proposes an image watermarking scheme to improve the robustness and security of watermark against several attacks. To achieve this, image normalization is utilized where affine transformation is applied on the image and which makes it as invariant to geometric trans- formations. The Lifting Wavelet Transform (LWT) and block based Discrete Cosine Transform (DCT) is applied to the cover image after normalizing an image. Then, the DC coefficients from all blocks are gathered and singular value matrix is constructed using Singular Value Decomposition (SVD). The watermark image is embedded in this singular value matrix after scrambling the image, which increases the security of the proposed scheme. The robustness and invisibleness of the proposed scheme is measured using Peak Signal to Noise Ratio (PSNR), Signal to noise Ratio (SNR) and Structural Similarity (SSIM). The comparison was made with existing schemes and it reveals that the proposed scheme provides high robustness than the existing one.

Quantum Realization of Arnold Scrambling for IFRQI

This paper is concerned with the feasibility of the Arnold scrambling based on Improved Flexible Representation of Quantum Images (IFRQI). Firstly, the flexible representation of quantum image is updated to the improved flexible representation of quantum image (IFRQI) to represent a quantum image with arbitrary size L × B. Then, by making use of Control-NOT gate and Adder-Modular operation, the concrete quantum circuit of Arnold scrambling for IFRQI is designed. Simulation results show the effectiveness of the proposed circuit.

A New Double Color Image Watermarking Algorithm Based on the SVD and Arnold Scrambling

We propose a new image watermarking scheme based on the real SVD and Arnold scrambling to embed a color watermarking image into a color host image. Before embedding watermark, the color watermark image W with size of M×M is scrambled by Arnold transformation to obtain a meaningless image W~. Then, the color host image A with size of N×N is divided into nonoverlapping N/M×N/M pixel blocks. In each (i,j) pixel block Ai,j, we form a real matrix Ci,j with the red, green, and blue components of Ai,j and perform the SVD of Ci,j. We then replace the three smallest singular values of Ci,j by the red, green, and blue values of W~ij with scaling factor, to form a new watermarked host image A~ij. With the reserve procedure, we can extract the watermark from the watermarked host image. In the process of the algorithm, we only need to perform real number algebra operations, which have very low computational complexity and are more effective than the one using the quaternion SVD of color image.

ROI based robust and secure image watermarking using DWT and Arnold map

Three main requirements of any watermarking scheme are imperceptibility, robustness and security. In this paper, a new robust blind image watermarking scheme based on Region of Interest (ROI) using Arnold scrambling is proposed. The proposed scheme satisfies the requirements via using a watermark generated from the host image, the used embedding strategy and Arnold scrambling. In this paper, the ROI of the host image is used as the watermark image. First-level DWT is applied to the watermark and approximation coefficients are chosen as information to be embedded. Each approximation coefficient is embedded into the low frequency sub band of a selected block of the host image in the wavelet domain. Before embedding, Arnold scrambling is performed on the approximation coefficients of the watermark as well as the blocks of the host image. This makes the scheme more robust and secure. Simulation results show that the proposed scheme achieves high degree of security, imperceptibility and robustness against the variety of attacks.