Journal
CMC-COMPUTERS MATERIALS & CONTINUA
Volume 67, Issue 2, Pages 2077-2091Publisher
TECH SCIENCE PRESS
DOI: 10.32604/cmc.2021.015329
Keywords
Coverless information hiding; Jigsaw puzzle image; image steganography; data hiding
Funding
- Taif University, Taif, Saudi Arabia [TURSP-2020/160]
Ask authors/readers for more resources
This paper proposes a new coverless image steganography method based on jigsaw puzzle image generation driven by a secret message. The image is divided into rows and columns, creating blocks which are then shaped into puzzle pieces according to a secret message and mapping function. The generated jigsaw puzzle image shows good performance in hiding capacity, security, and robustness compared to existing coverless methods.
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available