ANALYSIS OF DATA HIDING ALGORITHMS FOR IMAGE SECURITY

2015 ◽  
Vol 3 (5) ◽  
pp. 350-354
Author(s):  
Swati B. Singh ◽  
Ameya K. Naik ◽  
Pragati Dwivedi ◽  
Swapna Patil
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Stream Cipher ◽  
Haar Wavelet ◽  
Image Steganography ◽  
Cover Image ◽  
Wavelet Compression ◽  
Image Security ◽  
Secret Image ◽  
Secret Information

The main goal of reversible data hiding algorithms is to embed the secret information in cover image and recover it back successfully. So we have implemented two methods. In first method, cover image is encrypted using stream cipher and pseudo randomly generated key and compressed using haar wavelet compression. The encrypted compressed image acts as a media for hiding secret image. And in second method, secret image is encrypted using randomly generated key and it is hidden in cover image. In both the method data hiding is done using LSB based image steganography. At the receiver, reverse process is done to extract secret image and recover cover image. At the end, we conclude that second method gives better security of image compared to method one.

scholarly journals High-Capacity Image Steganography Algorithm Based on Image Style Transfer

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Xinliang Bi ◽  
Xiaoyuan Yang ◽  
Chao Wang ◽  
Jia Liu
Keyword(s):  
High Capacity ◽  
Image Features ◽  
Image Steganography ◽  
Cover Image ◽  
Secret Message ◽  
The Internet ◽  
Stego Image ◽  
Style Transfer ◽  
Secret Image ◽  
Secret Information

Steganography is a technique for publicly transmitting secret information through a cover. Most of the existing steganography algorithms are based on modifying the cover image, generating a stego image that is very similar to the cover image but has different pixel values, or establishing a mapping relationship between the stego image and the secret message. Attackers will discover the existence of secret communications from these modifications or differences. In order to solve this problem, we propose a steganography algorithm ISTNet based on image style transfer, which can convert a cover image into another stego image with a completely different style. We have improved the decoder so that the secret image features can be fused with style features in a variety of sizes to improve the accuracy of secret image extraction. The algorithm has the functions of image steganography and image style transfer at the same time, and the images it generates are both stego images and stylized images. Attackers will pay more attention to the style transfer side of the algorithm, but it is difficult to find the steganography side. Experiments show that our algorithm effectively increases the steganography capacity from 0.06 bpp to 8 bpp, and the generated stylized images are not significantly different from the stylized images on the Internet.

scholarly journals Deep Multi-Image Steganography with Private Keys

Electronics ◽  
2021 ◽  
Vol 10 (16) ◽  
pp. 1906
Author(s):  
Hyeokjoon Kweon ◽  
Jinsun Park ◽  
Sanghyun Woo ◽  
Donghyeon Cho
Keyword(s):  
Image Steganography ◽  
The Other ◽  
Cover Image ◽  
Hidden Information ◽  
Secret Image ◽  
Secret Information ◽  
Private Key ◽  
Deep Cnn ◽  
High Level ◽  
Multiple Secret Images

In this paper, we propose deep multi-image steganography with private keys. Recently, several deep CNN-based algorithms have been proposed to hide multiple secret images in a single cover image. However, conventional methods are prone to the leakage of secret information because they do not provide access to an individual secret image and often decrypt the entire hidden information all at once. To tackle the problem, we introduce the concept of private keys for secret images. Our method conceals multiple secret images in a single cover image and generates a visually similar container image containing encrypted secret information inside. In addition, private keys corresponding to each secret image are generated simultaneously. Each private key provides access to only a single secret image while keeping the other hidden images and private keys unrevealed. In specific, our model consists of deep hiding and revealing networks. The hiding network takes a cover image and secret images as inputs and extracts high-level features of the cover image and generates private keys. After that, the extracted features and private keys are concatenated and used to generate a container image. On the other hand, the revealing network extracts high-level features of the container image and decrypts a secret image using the extracted feature and a corresponding private key. Experimental results demonstrate that the proposed algorithm effectively hides and reveals multiple secret images while achieving high security.

scholarly journals High-Capacity Reversible Data Hiding in Encrypted Images by Information Preprocessing

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Xi-Yan Li ◽  
Xia-Bing Zhou ◽  
Qing-Lei Zhou ◽  
Shi-Jing Han ◽  
Zheng Liu
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
High Capacity ◽  
Main Idea ◽  
Original Image ◽  
Chaos Encryption ◽  
Secret Information ◽  
Encrypted Image ◽  
Encrypted Images ◽  
Scanned Documents

With the development of cloud computing, high-capacity reversible data hiding in an encrypted image (RDHEI) has attracted increasing attention. The main idea of RDHEI is that an image owner encrypts a cover image, and then a data hider embeds secret information in the encrypted image. With the information hiding key, a receiver can extract the embedded data from the hidden image; with the encryption key, the receiver reconstructs the original image. In this paper, we can embed data in the form of random bits or scanned documents. The proposed method takes full advantage of the spatial correlation in the original images to vacate the room for embedding information before image encryption. By jointly using Sudoku and Arnold chaos encryption, the encrypted images retain the vacated room. Before the data hiding phase, the secret information is preprocessed by a halftone, quadtree, and S-BOX transformation. The experimental results prove that the proposed method not only realizes high-capacity reversible data hiding in encrypted images but also reconstructs the original image completely.

scholarly journals A Location Map Reduced Reversible Data Hiding Method Using Prediction Error Modification

2012 ◽  
Vol 6-7 ◽  
pp. 428-433
Author(s):  
Yan Wei Li ◽  
Mei Chen Wu ◽  
Tung Shou Chen ◽  
Wien Hong
Keyword(s):  
Image Quality ◽  
Data Hiding ◽  
Prediction Error ◽  
Reversible Data Hiding ◽  
Experimental Results ◽  
Cover Image ◽  
Prediction Errors ◽  
Secret Data ◽  
Location Map ◽  
Comparable Image Quality

We propose a reversible data hiding technique to improve Hong and Chen’s (2010) method. Hong and Chen divide the cover image into pixel group, and use reference pixels to predict other pixel values. Data are then embedded by modifying the prediction errors. However, when solving the overflow and underflow problems, they employ a location map to record the position of saturated pixels, and these pixels will not be used to carry data. In their method, if the image has a plenty of saturated pixels, the payload is decreased significantly because a lot of saturated pixels will not joint the embedment. We improve Hong and Chen’s method such that the saturated pixels can be used to carry data. The positions of these saturated pixels are then recorded in a location map, and the location map is embedded together with the secret data. The experimental results illustrate that the proposed method has better payload, will providing a comparable image quality.

scholarly journals Reversible Data Hiding Using Two Marked Images Based on Adaptive Coefficient-Shifting Algorithm

2012 ◽  
Vol 2012 ◽  
pp. 1-9 ◽  
Author(s):  
Ching-Yu Yang
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Signal To Noise Ratio ◽  
Secret Image Sharing ◽  
Signal To Noise ◽  
Host Medium ◽  
Secret Image ◽  
Image Sharing ◽  
Host Image ◽  
Acs Algorithm

This paper proposes a novel form of reversible data hiding using two marked images by employing the adaptive coefficient-shifting (ACS) algorithm. The proposed ACS algorithm consists of three parts: the minimum-preserved scheme, the minimum-preserved with squeezing scheme, and the base-value embedding scheme. More specifically, each input block of a host image can be encoded to two stego-blocks according to three predetermined rules by the above three schemes. Simulations validate that the proposed method not only completely recovers the host medium but also losslessly extracts the hidden message. The proposed method can handle various kinds of images without any occurrence of overflow/underflow. Moreover, the payload and peak signal-to-noise ratio (PSNR) performance of the proposed method is superior to that of the conventional invertible data hiding schemes. Furthermore, the number of shadows required by the proposed method is less than that required by the approaches which are based upon secret image sharing with reversible steganography.

scholarly journals Knight Tour for Image Steganography Technique

2019 ◽  
Vol 9 (1) ◽  
pp. 1610-1613
Keyword(s):  
Growth Rate ◽  
Data Hiding ◽  
Information Hiding ◽  
High Capacity ◽  
Image Steganography ◽  
Cover Image ◽  
The Internet ◽  
Sensitive Information ◽  
Image File ◽  
Ascii Code

The growth rate of the Internet is exceeding that of any previous technology. As the Internet has become the major medium for transferring sensitive information, the security of the transferred message has now become the utmost priority. To ensure the security of the transmitted data, Image steganography has emerged out as an eminent tool of information hiding. The frequency of availability of image file is high and provides high capacity. In this paper, a method of secure data hiding in image is proposed that uses knight tour positions and further 8-queen positions in 8*8 pixel blocks.The cover image is divided into 8*8 pixel blocks and pixels are selected from each block corresponding to the positions of Knight in 8*8 chessboard starting from different pixel positions. 8-pixel values are selected from alternate knight position. Selected pixels values converted to 8-bit ASCII code and result in 8* 8 bit matrix. 8-Queen’s solution on 8*8 chessboard is applied on 8*8 bit matrix. The bits selected from 8-Queens positions and compared with 8-bit ASCII code of message characters. The proposed algorithm changes the LSB of only some of the pixels based on the above comparison. Based on parameters like PSNR and MSE the efficiency of the method is checked after implementation. Then the comparison done with some already proposed techniques. This is how, image steganography showed interesting and promising results when compared with other techniques.

scholarly journals An Advanced Reversible Data Hiding Algorithm Using Local Similarity, Curved Surface Characteristics, and Edge Characteristics in Images

2020 ◽  
Vol 10 (3) ◽  
pp. 836 ◽  
Author(s):  
Soo-Mok Jung ◽  
Byung-Won On
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Image Watermarking ◽  
Surface Characteristics ◽  
Cover Image ◽  
Curved Surface ◽  
Local Similarity ◽  
Stego Image ◽  
Confidential Data ◽  
The Difference

In this paper, we proposed methods to accurately predict pixel values by effectively using local similarity, curved surface characteristics, and edge characteristics present in an image. Furthermore, to hide more confidential data in a cover image using the prediction image composed of precisely predicted pixel values, we proposed an effective data hiding technique that applied the prediction image to the conventional reversible data hiding technique. Precise prediction of pixel values greatly increases the frequency at the peak point in the histogram of the difference sequence generated using the cover and prediction images. This considerably increases the amount of confidential data that can be hidden in the cover image. The proposed reversible data hiding algorithm (ARDHA) can hide up to 24.5% more confidential data than the existing algorithm. Moreover, it is not possible to determine the presence of hidden confidential data in stego-images, as they possess excellent visual quality. The confidential data can be extracted from the stego-image without loss, and the original cover image can be restored from the stego-image without distortion. Therefore, the proposed algorithm can be effectively used in digital image watermarking, military, and medical applications.

scholarly journals A Joint Encryption and Reversible Data Hiding Scheme Based on Integer-DWT and Arnold Map Permutation

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Shun Zhang ◽  
Tiegang Gao ◽  
Guorui Sheng
Keyword(s):  
Frequency Domain ◽  
Data Hiding ◽  
Reversible Data Hiding ◽  
Cover Image ◽  
Discrete Wavelet ◽  
Original Image ◽  
Histogram Modification ◽  
Encrypted Image ◽  
Hidden Data ◽  
Arnold Map

A joint encryption and reversible data hiding (joint encryption-RDH) scheme is proposed in this paper. The cover image is transformed to the frequency domain with integer discrete wavelet transform (integer DWT) for the encryption and data hiding. Additional data is hidden into the permuted middle (LH, HL) and high (HH) frequency subbands of integer DWT coefficients with a histogram modification based method. A combination of permutations both in the frequency domain and in the spatial domain is imposed for the encryption. In the receiving end, the encrypted image with hidden data can be decrypted to the image with hidden data, which is similar to the original image without hidden data, by only using the encryption key; if someone has both the data hiding key and the encryption key, he can both extract the hidden data and reversibly recover the original image. Experimental results demonstrate that, compared with existing joint encryption-RDH schemes, the proposed scheme has gained larger embedding capacity, and the distribution of the encrypted image with data hidden has a random like behavior. It can also achieve the lossless restoration of the cover image.

Sign in / Sign up

Export Citation Format

Share Document