Enhancing Security for JPEG Image Against Mosaic Attack Using Inter-Block Shuffle Encryption

5Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Inter-block shuffle has been proved to be able to enhance the security for JPEG image encryption. However, it does not change the numbers of non-zero coefficients in 8∗8 blocks. This leads to information leakage. In this paper, the defects of inter-block shuffle are analyzed. An attack scheme is developed based on a combined application of chosen-plain-text attack and non-zero quantized coefficients counting attack. It is verified that the main content of the original image could be reconstructed without the knowledge of encryption algorithm details and keys. The attack results are visualized to be mosaic appearance images. An improvement of the attack is also provided, which is called a fast mosaic attack. In the improved attack, the chosen images are designed to have distinguished numbers of non-zero quantized DCT coefficients in different blocks. The designed images remarkably accelerate the attack processing. The fast mosaic attack generates the same results as the original scheme with the much smaller time cost.

Cite

CITATION STYLE

APA

Li, S., Ma, R., & Zhang, H. (2019). Enhancing Security for JPEG Image Against Mosaic Attack Using Inter-Block Shuffle Encryption. IEEE Access, 7, 72696–72702. https://doi.org/10.1109/ACCESS.2019.2918860

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free