A New Image Steganographic Approach for Secure Communication Based on LSB Replacement Method

Khalid Darabkh, Iyad F. Jafar, Raed T. Al-Zubi, Mohammed Hawa


With the development of internet technologies and communication services, message transmissions over the internet still have to face all kinds of security problems. Hence, how to protect secret messages during transmission becomes a challenging issue for most of current researchers. It is worth mentioning that many applications in computer science and other related fields rely on steganography and watermarking techniques to ensure information safety during communication. Unlike cryptography that focuses on scrambling the secret message so that it cannot be understood, the main objective of steganography and watermarking is to communicate securely in such a way that the hidden data are not visible to the observer. In other words, it seeks for the imperceptibility of stego-images quality to an unintended party through embedding efficiently the secret message in a digital media such as image, video, or audio. In this paper, we propose a new steganographic method to embed the secret data inside a cover image based on least-significant-bit (LSB) replacement method. The embedding process predominantly concentrates on distributing the secret message inside one share of a color image to appear like a 3D geometric shape that is constructed according to well-analyzed geometric equations. The dimensions of the geometric shape are determined pursuant to the size of secret message. Data distribution process makes our method to be of a great interest as of being so difficult for the hackers or intruders to reconstruct the shape from stego-images, thereby the security is improved. Furthermore, we compare the performance of our approach with two other relevant approaches in terms of peak signal-to-noise ratio (PSNR) and payload. The contribution of our approach was immensely impressive.

DOI: http://dx.doi.org/10.5755/j01.itc.44.3.8949

Full Text: PDF

Print ISSN: 1392-124X 
Online ISSN: 2335-884X