A Framework for Image Encryption on Frequency Domain

A Framework for Image Encryption on Frequency Domain

Zhe Liu (Auckland University of Technology, New Zealand), Mee Loong Yang (Auckland University of Technology, New Zealand) and Wei Qi Yan (Auckland University of Technology, New Zealand)
Copyright: © 2019 |Pages: 13
DOI: 10.4018/978-1-5225-6313-6.ch010
OnDemand PDF Download:
No Current Special Offers


In this chapter, the authors propose an improved image encryption algorithm based on digital watermarking. The algorithm combines discrete wavelet transform (DWT), discrete cosine transform (DCT), and singular value decomposition (SVD) together in a DWT-DCT-SVD framework to improve the robust watermarking technique. The secret image is embedded into both high-frequency and low-frequency sub-bands of the host image; this makes it difficult to be attacked in all the sub-bands. To reduce the size of a secret key, the authors use a logistic map to generate random images so as to replace the host images. They tested the algorithm by using five types of attacks and the results indicate that the proposed algorithm has higher robustness than traditional chaotic scrambling method and the DRPE method. It shows strong resilience against the five types of attacks as well as statistical attacks.
Chapter Preview


Basic Workflow

In this book chapter, we will apply a similar idea of image watermarking to image encryption so as to hide the secret image as the watermark inside the host image. The watermarking algorithm can be treated as the encryption process of image encryption. In the process of watermark extraction, the host image is needed and it can be treated as the secret key for encryption. The process of watermark extraction can be treated as the image decryption. The basic workflow for this proposed encryption method based on watermark technique is illustrated in Figure 1.

Figure 1.

The workflow of our proposed method

Figure 2.

The encryption process of the proposed method


Complete Chapter List

Search this Book: