Junxin Chen

Exploiting self-adaptive permutation–diffusion and DNA random encoding for secure and efficient image encryption

Abstract This paper presents a solution for secure and efficient image encryption with the help of self-adaptive permutation–diffusion and DNA random encoding. The plain image is firstly converted to DNA sequence using random encoding rules, so as to disarrange the bit distribution of the plaintext. A self-adaptive permutation–diffusion procedure is subsequently introduced for further encryption. The quantization processes of the permutation and diffusion procedures are disturbed by the intrinsic features of the plaintext, with the introduced disturbances can be automatically retrieved in the decryption end. The security of the system originates from the plaintext-related quantization of the encryption process which makes the cryptosystem secure against plaintext attack. Besides, the reusability of the random variables can dramatically promote the efficiency of the cryptosystem, which renders great potential for real-time secure image applications.

Reusing the permutation matrix dynamically for efficient image cryptographic algorithm

In traditional type of chaotic image ciphers with the architecture of permutation-diffusion, one-dimensional chaotic map is always employed for generating key stream in the diffusion procedure. However, the workloads derived from the iteration-then-quantization of the key stream generation operations severely downgrade the overall encryption efficiency of such cryptosystems. In this paper, we demonstrate how to obtain the diffusion key stream from the permutation matrix, which is produced and preserved in the permutation phase. No extra chaotic iteration and quantization is required in the diffusion procedure, the operation efficiency is thus improved. A complete cryptosystem is built using Bake map for image permutation. Simulations and security analyses have been carried out and the results illustrate the superior security and high efficiency of the proposed scheme. An image encryption scheme with dynamic reuse of the permutation matrix is developed.The diffusion key stream is dynamically obtained from the permutation matrix.No chaotic operation is needed for image diffusion, the efficiency is thus promoted.Simulations and security analyses prove the superior security and high efficiency.

Deciphering an RGB color image cryptosystem based on Choquet fuzzy integral

For the purpose of designing better color image cryptosystems, it is necessary to perform a mathematically rigorous security analysis for the existing ones. In this study, a Choquet fuzzy integral-based color image cryptosystem with shift–diffusion architecture is cryptanalyzed. Firstly, it is demonstrated that the color image cryptosystem is irreversible, since the encryption algorithm cannot be decrypted correctly. Meanwhile, a simple improvement is presented to guarantee the reversibility. Moreover, a cryptanalysis of the improved scheme is proposed and results show the improved color image cryptosystem can be broken by a known plain/cipher image pair. The shift–diffusion architecture should alter the external key every time for security consideration.

Exploiting the Security Aspects of Compressive Sampling

Compressive sampling (CS) has received extensive research attention in the past decade, as it allows sampling at a rate lower than that required by the Nyquist-Shannon sampling theorem. Besides, benefiting from its intrinsic simplicity, convenience and simultaneous encryption, and compression performance, CS also shows great potential in the information security field. This special issue received 13 submissions and published 5 papers which are carefully peer-reviewed by experts in the field. The published papers of this special issue focus on the application security of compressive sampling. R. Zhang et al. extended the usage of CS for image authentication. Specifically, the primary image is firstly (DWT) transformed and then divided into important part, that is, low frequency part, and unimportant part, that is, high frequency part. For high frequency part, it is encrypted with CS to vacate space for watermark, whereas chaotic encryption is employed to conceal the low frequency phase. The innovation is that Zhang’s scheme can realize not only tamper detection and localization but also tamper recovery, in comparison with existing authentication algorithms. J. Wang et al. proposed to use CS for identifying data injection attacks in a nonlinear cyber-physical system and it can also work well in linear systems. The authors conclude that only a small fraction of the observations is supposed to be attacked at a given time instance due to the property of data injection attacks. Hence the error correction problem can be formulated as a sparse optimization primitive and consequently highly relates to CS theory. M. Li et al. proposed to combine reversible data hidden (RDH) with CS and investigated a novel method for image encryption. The key idea is that RDH is applied in CS domain, which introduces a variety of benefits in terms of image sampling, communication, and security. It is demonstrated that the watermark embedding rate is significantly higher than those of other state-of-theart schemes. Furthermore, the computational complexity of the receiver is also reduced. Two image security papers have also been included in this special issue and are expected to be beneficial for broadening the CS security research. C. Fu et al. developed a chaos-based color image encryption scheme. Different from traditional solutions, a pixel swapping based scrambling approach is developed for permutation, whereas an efficient keystream generation strategy is employed for pixel substitution. Experimental results demonstrate the satisfactory security performance. C.-J. Ouyang et al. considered the security measure in steganography and steganalysis. The proposed security measure evaluates the similarity between two vague sets of cover images and stego images in terms of n-orderMarkov chain for capturing the interpixel correlation and has been shown to have the properties of boundedness, commutativity, and unity. Presenting these papers together in a special issue, we wish to provide better views for general readers and researchers about the state-of-the-art development of CS security and also expect that this special issue can attract more researchers into the CS security area.

Low-Cost and Confidentiality-Preserving Data Acquisition for Internet of Multimedia Things

Internet of Multimedia Things (IoMT) faces the challenge of how to realize low-cost data acquisition while still preserve data confidentiality. In this paper, we present a low-cost and confidentiality-preserving data acquisition framework for IoMT. First, we harness chaotic convolution and random subsampling to capture multiple image signals. The measurement matrix is under the control of chaos, ensuring the security of the sampling process. Next, we assemble these sampled images into a big master image, and then encrypt this master image based on Arnold transform and single value diffusion. The computation of these two transforms only requires some low-complexity operations. Finally, the encrypted image is delivered to cloud servers for storage and decryption service. Experimental results demonstrate the security and effectiveness of the proposed framework.

Cryptanalysis of Optical Ciphers Integrating Double Random Phase Encoding With Permutation

This paper presents the cryptanalysis of optical ciphers combining double random phase encoding with permutation techniques, and shows its vulnerability against plaintext attack regardless of the implementation order of the two procedures. The equivalent secret keys of both the combination fashions can be retrieved, instead of the recovery of random phase masks and permutation matrix. Numerical simulations are also given for validation.