A Modulo Function-Based Robust Asymmetric Variable Data Hiding Using DCT

This work presents a new asymmetric data hiding technique that hides a variable number of secret message bits in the discrete cosine transform (DCT) coefficients of a cover image using a modular distance technique. Prior to data hiding, the proposed framework transforms a cover image from a spatial domain to various frequency coefficients using DCT. The DCT coefficients are arranged in two groups: one with low-frequency coefficient, and the other with the medium and high-frequency coefficients. The medium and higher frequency coefficients are processed for variable data hiding asymmetrically. The proposed technique hides variable sets of secret information bits in different coefficients. The variation in hidden secret information is maintained using a key developed based on the modulo of distance of a coefficient from the reference point. The same key is also used to retrieve the confidential information at the receiver ends. The results reveal that the presented framework does not create any visually significant distortion, and thus the hidden information does not attract the human visual system (HVS). The technique also results in high data hiding efficiency.

Download Full-text

Keamanan Pesan Rahasia Menggunakan Steganografi DCT (Discrete Cosine Transform) pada Citra JPEG

Jurnal Ilmiah Informatika Global ◽

10.36982/jig.v9i2.585 ◽

2019 ◽

Vol 9 (2) ◽

Author(s):

Dian Hafidh Zulfikar

Keyword(s):

Discrete Cosine Transform ◽

Spatial Domain ◽

Cover Image ◽

Secret Message ◽

Least Significant Bit ◽

Cosine Transform ◽

Secret Information ◽

Dct Coefficients ◽

Lsb Technique ◽

Dct Coefficient

Abstract The least significant-bit (LSB) based techniques are very popular for steganography in spatial domain. The simplest LSB technique simply replaces the LSB in the cover image with the bits from secret information. Further advanced techniques use some criteria to identify the pixels in which LSB(s) can be replaced with the bits of secret information. In Discrete Cosine Transform (DCT) based technique insertion of secret information in carrier depends on the DCT coefficients. Any DCT coefficient value above proper threshold is a potential place for insertion of secret information. Keywords : Discrete Cosine Transform (DCT), steganography, secret message AbstrakPada steganografi domain spasial, teknik least significant-bit (LSB) merupakan teknik yang paling banyak digunakan pada steganografi. Teknik yang sederhana yang hanya mengubah nilai LSB pada cover image dengan nilai bit pesan rahasia, atau dengan teknik yang lebih baik lagi yaitu dengan menentukan bit-bit LSB mana yang akan dilakukan pergantian nilai bit. Lain halnya dengan metode Discrete Cosine Transform (DCT), teknik steganografi ini akan menyembunyikan informasi rahasia tergantung dari nilai Koefisien DCT. Kata Kunci : Steganografi, DCT, Citra, JPEG, Pesan Rahasia

Download Full-text

High-Payload Data-Hiding Method for AMBTC Decompressed Images

Entropy ◽

10.3390/e22020145 ◽

2020 ◽

Vol 22 (2) ◽

pp. 145

Author(s):

Jung-Yao Yeh ◽

Chih-Cheng Chen ◽

Po-Liang Liu ◽

Ying-Hsuan Huang

Keyword(s):

Data Hiding ◽

High Capacity ◽

Cover Image ◽

Secret Data ◽

Perceptual Distortion ◽

Hiding Capacity ◽

High Data ◽

Capacity Data ◽

High Payload ◽

Better Than

Data hiding is the art of embedding data into a cover image without any perceptual distortion of the cover image. Moreover, data hiding is a very crucial research topic in information security because it can be used for various applications. In this study, we proposed a high-capacity data-hiding scheme for absolute moment block truncation coding (AMBTC) decompressed images. We statistically analyzed the composition of the secret data string and developed a unique encoding and decoding dictionary search for adjusting pixel values. The dictionary was used in the embedding and extraction stages. The dictionary provides high data-hiding capacity because the secret data was compressed using dictionary-based coding. The experimental results of this study reveal that the proposed scheme is better than the existing schemes, with respect to the data-hiding capacity and visual quality.

Download Full-text

High-Capacity Image Steganography Algorithm Based on Image Style Transfer

Security and Communication Networks ◽

10.1155/2021/4179340 ◽

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.

Download Full-text

FPGA based Data Hiding through Steganography

International Journal of Recent Technology and Engineering - 2 ◽

10.35940/ijrte.a2751.059120 ◽

2020 ◽

Vol 9 (1) ◽

pp. 2042-2045

Keyword(s):

Data Hiding ◽

Field Programmable Gate Array ◽

High Capacity ◽

Cover Image ◽

Secret Message ◽

Stego Image ◽

Key Factor ◽

Field Programmable ◽

Shared Information ◽

Hidden Data

Nowadays, the information security has been the key factor in communications, computer systems, electronic commerce and data sharing. One of the well-known methods for procuring the security of shared information using carrier files is steganography. The carrier file can be discrete such as image, text, audio and video etc. Digital images are the most commonly used format among those due to the high capacity and availability frequency. The hidden data is stored in an indistinct carrier in image steganography, i.e the digital image is used as a cover image to mask the secret message known as stego image. Cryptography can be then adapted for increasing the security of the stego image. A zig-zag MSB-LSB slicing based steganographic algorithm is proposed in this paper for concealing a secret image in a cover image. Power report and device utilization summary of the algorithm is calculated and the output is demonstrated on the VGA screen using BASYS3 Field Programmable Gate Array (FPGA).

Download Full-text

Data Hiding under QR Code using Visual Secret Sharing and Advanced Partitioning Based on Specific Relationship

International Journal of Engineering and Advanced Technology - Regular Issue ◽

10.35940/ijeat.c5799.029320 ◽

2020 ◽

Vol 9 (3) ◽

pp. 2923-2926

Keyword(s):

Data Storage ◽

Secret Sharing ◽

Easy Access ◽

Secret Message ◽

Qr Code ◽

Visual Secret Sharing ◽

Secret Information ◽

High Data ◽

Xor Operation ◽

Original Message

The Visual Secret Sharing is the technique in which secret information is hidden in the form image which then divided into shares and these shares are used to decrypt the secret information. The number of shares required is given by the creator of the secret. Minimum those many shares are needed in order to decrypt the secret. If a single share is missing then the secret cannot be decrypted. The Quick Response (QR) code gives quick access to the information contained in it. QR code is 2D representation of the barcode which has capability to store information and can be easily read by machine. Due to easy access to the information stored in it, it is necessary to use some encryption or other protection to the data. Proposed approach to visual secret sharing scheme divides a secret QR code into different shares. In addition, the secret message is recovered by using XOR operation of the shares. This can effortlessly be achieved with the use of smartphones or different QR scanning gadgets. Using optimal partitioning methods the decryption of the message is made difficult to the hackers giving additional security to the data. The message accuracy can be checked by comparing the original message with shared message using hashing techniques. Because the QR code are small in size and has high data storage capacity, it is also resistant to damage so that is information is not lost even if some portion of the QR code is damaged it is best image to be used in visual secret sharing. The proposed approach reduces the risk of data transmission attacks

Download Full-text

Ant Colony Optimization (ACO) based Data Hiding in Image Complex Region

International Journal of Electrical and Computer Engineering (IJECE) ◽

10.11591/ijece.v8i1.pp379-389 ◽

2018 ◽

Vol 8 (1) ◽

pp. 379 ◽

Cited By ~ 8

Author(s):

Sahib Khan

Keyword(s):

Ant Colony Optimization ◽

Data Hiding ◽

Experimental Results ◽

Ant Colony ◽

Cover Image ◽

Complex Region ◽

Secret Information ◽

Lsb Substitution ◽

Least Significant Bits

This paper presents data an Ant colony optimization (ACO) based data hiding technique. ACO is used to detect complex region of cover image and afterward, least significant bits (LSB) substitution is used to hide secret information in the detected complex regions’ pixels. ACO is an algorithm developed inspired by the inborn manners of ant species. The ant leaves pheromone on the ground for searching food and provisions. The proposed ACO-based data hiding in complex region establishes an array of pheromone, also called pheromone matrix, which represents the complex region in sequence at each pixel position of the cover image. The pheromone matrix is developed according to the movements of ants, determined by local differences of the image element’s intensity. The least significant bits of complex region pixels are substituted with message bits, to hide secret information. The experimental results, provided, show the significance of the performance of the proposed method.

Download Full-text

ACO Based Variable Least Significant Bits Data Hiding in Edges Using IDIBS Algorithm

Symmetry ◽

10.3390/sym12050781 ◽

2020 ◽

Vol 12 (5) ◽

pp. 781

Author(s):

Sahib Khan ◽

Muhammad Abeer Irfan ◽

Khalil Khan ◽

Mushtaq Khan ◽

Tawab Khan ◽

...

Keyword(s):

Data Hiding ◽

Cover Image ◽

Hidden Information ◽

Secret Data ◽

High Quality ◽

Complex Region ◽

Asymmetric Data ◽

Smooth Region ◽

Least Significant Bits

This work presents a double asymmetric data hiding technique. The first asymmetry is created by hiding secret data in the complex region of the cover image and keep the smooth region unaffected. Then another asymmetry is developed by hiding a different number of secret bits in the various pixels of the complex region. The proposed technique uses the ant colony optimization (ACO) based technique for the classification of complex and smooth region pixels. Then, the variable least significant bits (VLSB) data hiding framework is used to hide secret bits in the complex region of the cover image. A distance-based substitution technique, namely increasing distance increasing bits substitution algorithm, is used to ensure the asymmetry in the number of hidden bits. The double asymmetric framework enhances the security of the hidden secret data and makes the retrieval of hidden information difficult for unauthorized users. The algorithm results in high-quality stego images, and the hidden information does not attract the human visual system (HVS).

Download Full-text

Data Hiding Based on Mini Program Code

Security and Communication Networks ◽

10.1155/2021/5546344 ◽

2021 ◽

Vol 2021 ◽

pp. 1-12

Author(s):

Jia Chen ◽

Quankai Qi ◽

Yongjie Wang ◽

Xuehu Yan ◽

Longlong Li

Keyword(s):

Coordinate System ◽

Data Hiding ◽

Information Hiding ◽

Secret Message ◽

Covert Communication ◽

Program Code ◽

Secret Information ◽

First Time

A mini program code (also known as sunflower code) comes with WeChat mini program APPs. With the popularization of mini program APPs, mini program codes have become more and more widely used. As a new carrier, the study of information hiding technology based on mini program code is of great significance for the expansion of covert communication carriers and can also deal with security problems in advance. At present, to the best of our knowledge, there is no steganographic research based on mini program codes. In this paper, we propose a scheme to embed secret information into mini program codes for the first time. After studying the construction of mini program codes, a coordinate system is constructed to represent its module coordinates. Then, a binary stream of the secret message is embedded into the encoding region or the edge patch. Experiments show that the proposed data hiding scheme is effective and feasible. The embedded secret message could be extracted while keeping the readability of the mini program code. Moreover, the secret payloads of the encoding region and the edge patch for the V-36 mini program code are 72 bits and 29 bits, respectively.

Download Full-text

ANALYSIS OF DATA HIDING ALGORITHMS FOR IMAGE SECURITY

International Journal of Students Research in Technology & Management ◽

10.18510/ijsrtm.2015.352 ◽

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.

Download Full-text

An Efficient DCT-Based Image Retrieval Approach Using Distance Threshold Pruning

Journal of Advanced Computational Intelligence and Intelligent Informatics ◽

10.20965/jaciii.2008.p0268 ◽

2008 ◽

Vol 12 (3) ◽

pp. 268-276 ◽

Cited By ~ 3

Author(s):

Tienwei Tsai ◽

◽

Te-Wei Chiang ◽

Yo-Ping Huang ◽

◽

...

Keyword(s):

Image Retrieval ◽

Color Space ◽

Reduction Rate ◽

Low Frequency ◽

Distance Threshold ◽

High Data ◽

Second Stage ◽

Dct Coefficients ◽

Image Pixels ◽

Distinct Features

Content-based image retrieval (CBIR) techniques would allow indexing and retrieving images based on their low-level contents, which involves a large number of image pixels and thus becomes an inherently and essentially computational intensive task. This paper proposes a distance threshold pruning (DTP) method to alleviate computational burden of CBIR without sacrificing its accuracy. In our approach, the images are converted into the YUV color space, and then transformed into discrete cosine transform (DCT) coefficients. Benefited from the energy compacting property of DCT, Only the low-frequency DCT coefficients of Y, U, and V components are stored. On querying an image, at the first stage, the DTP serves as a filter to remove those candidates with widely distinct features. At the second stage, the detailed similarity comparison (DSC) is performed on those remaining candidates passing through the first stage. The experimental results show that both high efficacy and high data reduction rate can be achieved simultaneously by using the proposed approach.

Download Full-text