Open Access
ARTICLE
Coverless Image Steganography Based on Jigsaw Puzzle Image Generation
1 Department of Computer Science, Faculty of Science, Minia University, Minya, 61519, Egypt
2 Department of Mathematics, College of Science, Taif University, Taif, 21944, Saudi Arabia
3 Department of Mathematics, Faculty of Science, Al-Azher University, Nasr City, 11884, Egypt
4 Department of Mathematics, Faculty of Science, Helwan University, Cairo, Egypt
* Corresponding Author: Al Hussien Seddik Saad. Email:
Computers, Materials & Continua 2021, 67(2), 2077-2091. https://doi.org/10.32604/cmc.2021.015329
Received 15 November 2020; Accepted 10 December 2020; Issue published 05 February 2021
Abstract
Current image steganography methods are working by assigning an image as a cover file then embed the payload within it by modifying its pixels, creating the stego image. However, the left traces that are caused by these modifications will make steganalysis algorithms easily detect the hidden payload. A coverless data hiding concept is proposed to solve this issue. Coverless does not mean that cover is not required, or the payload can be transmitted without a cover. Instead, the payload is embedded by cover generation or a secret message mapping between the cover file and the payload. In this paper, a new coverless image steganography method has been proposed based on the jigsaw puzzle image generation driven by a secret message. Firstly, the image is divided into equal rows then further divided into equal columns, creating blocks (i.e., sub-images). Then, according to secret message bits and a proposed mapping function, each block will have tabs/blanks to get the shape of a puzzle piece creating a fully shaped jigsaw puzzle stego-image. After that, the generated jigsaw puzzle image is sent to the receiver. Experimental results and analysis show a good performance in the hiding capacity, security, and robustness compared with existing coverless image steganography methods.Keywords
Cite This Article
Citations
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.