Computing Dependencies between DCT Coefficients for Natural Steganography in JPEG Domain

International audienc

JPEG Steganography and Synchronization of DCT Coefficients for a Given Development Pipeline

This short paper proposes to use the statistical analysis of the correlation between DCT coefficients to design a new synchronization strategy that can be used for cost-based steganographic schemes in the JPEG domain. First, an analysis is performed on the covariance matrix of DCT coefficients of neighboring blocks after a development similar to the one used to generate BossBase. This analysis exhibits groups of uncorrelated coefficients: 4 groups per block and 2 groups of uncorrelated diagonal neighbors together with groups of mutually correlated coefficients groups of 6 coefficients per blocs and 8 coefficients between 2 adjacent blocks. Using the uncorrelated groups, an embedding scheme can be designed using only 8 disjoint lattices. The cost map for each lattice is updated firstly by using an implicit underlying Gaussian distribution with a variance directly computed from the embedding costs, and secondly by deriving conditional distributions from multivariate distributions. The covariance matrix of these distributions takes into account both the correlations exhibited by the analysis of the covariance matrix and the variance derived from the cost. This synchronization scheme enables to obtain a gain of PE of 5% at QF 95 for an embedding rate close to 0.3 bnzac coefficient using DCTR feature sets

A Natural Steganography Embedding Scheme Dedicated to Color Sensors in the JPEG Domain

International audienceUsing Natural Steganography (NS), a cover raw image acquired at sensitivity ISO 1 is transformed into a stego image whose statistical distribution is similar to a cover image acquired at sensitivity ISO 2 > ISO 1. This paper proposes such an embedding scheme for color sensors in the JPEG domain, extending thus the prior art proposed for the pixel domain and the JPEG domain for monochrome sensors. We first show that color sensors generate strong intra-block and inter-block dependencies between DCT coefficients and that theses dependencies are due to the demosaicking step in the development process. Capturing theses dependencies using an empirical covariance matrix, we propose a pseudo-embedding algorithm on greyscale JPEG images which uses up to four sub-lattices and 64 lattices to embed information while preserving the estimated correlations among DCT coefficients. We then compute an approximation of the average embedding rate w.r.t. the JPEG quality factor and evaluate the empirical security of the proposed scheme for linear and non-linear demosaicing schemes. Our experiments show that we can achieve high capacity (around 2 bit per nzAC) with a high empirical security (P E 30% using DCTR at QF 95)

Security during Transmission of Data Using Web Steganography

The project entitled Steganography is to give security to a content record. Since the security of the data over the internet has raised a concern to the people. There are many methods to protect the data from going into the access of unauthorized people. Steganography can be used along with the encryption technique to secure the data. Steganography is used to hide the data or a secret message whereas cryptography is used to encrypt the message and make it difficult the people to read. So, the proposed system is to combine both steganography and cryptography for the secret data transmission. The transmission can be done by using an image as a carrier of data. This paper uses high-performance BMP steganography along with a substitution encryption methodology. The approach that is used here is IDEA (International Data Encryption Algorithm) algorithm which is used for encryption. The IDEA algorithm works as follows, it will take the TEXT document and mystery key as the input and gives the encrypted and BMP picture as the output for the sender side. There can additionally be “Voice Recognition System” framework so that it can use voice to decrypt the message. This is the future expansion or scope of this paper

Side-Informed Steganography for JPEG Images by Modeling Decompressed Images

Side-informed steganography has always been among the most secure approaches in the field. However, a majority of existing methods for JPEG images use the side information, here the rounding error, in a heuristic way. For the first time, we show that the usefulness of the rounding error comes from its covariance with the embedding changes. Unfortunately, this covariance between continuous and discrete variables is not analytically available. An estimate of the covariance is proposed, which allows to model steganography as a change in the variance of DCT coefficients. Since steganalysis today is best performed in the spatial domain, we derive a likelihood ratio test to preserve a model of a decompressed JPEG image. The proposed method then bounds the power of this test by minimizing the Kullback-Leibler divergence between the cover and stego distributions. We experimentally demonstrate in two popular datasets that it achieves state-of-the-art performance against deep learning detectors. Moreover, by considering a different pixel variance estimator for images compressed with Quality Factor 100, even greater improvements are obtained.Comment: 13 pages, 7 figures, 1 table, submitted to IEEE Transactions on Information Forensics & Securit

Side-Information For Steganography Design And Detection

Today, the most secure steganographic schemes for digital images embed secret messages while minimizing a distortion function that describes the local complexity of the content. Distortion functions are heuristically designed to predict the modeling error, or in other words, how difficult it would be to detect a single change to the original image in any given area. This dissertation investigates how both the design and detection of such content-adaptive schemes can be improved with the use of side-information. We distinguish two types of side-information, public and private: Public side-information is available to the sender and at least in part also to anybody else who can observe the communication. Content complexity is a typical example of public side-information. While it is commonly used for steganography, it can also be used for detection. In this work, we propose a modification to the rich-model style feature sets in both spatial and JPEG domain to inform such feature sets of the content complexity. Private side-information is available only to the sender. The previous use of private side-information in steganography was very successful but limited to steganography in JPEG images. Also, the constructions were based on heuristic with little theoretical foundations. This work tries to remedy this deficiency by introducing a scheme that generalizes the previous approach to an arbitrary domain. We also put forward a theoretical investigation of how to incorporate side-information based on a model of images. Third, we propose to use a novel type of side-information in the form of multiple exposures for JPEG steganography