144 research outputs found
Aligned and Non-Aligned Double JPEG Detection Using Convolutional Neural Networks
Due to the wide diffusion of JPEG coding standard, the image forensic
community has devoted significant attention to the development of double JPEG
(DJPEG) compression detectors through the years. The ability of detecting
whether an image has been compressed twice provides paramount information
toward image authenticity assessment. Given the trend recently gained by
convolutional neural networks (CNN) in many computer vision tasks, in this
paper we propose to use CNNs for aligned and non-aligned double JPEG
compression detection. In particular, we explore the capability of CNNs to
capture DJPEG artifacts directly from images. Results show that the proposed
CNN-based detectors achieve good performance even with small size images (i.e.,
64x64), outperforming state-of-the-art solutions, especially in the non-aligned
case. Besides, good results are also achieved in the commonly-recognized
challenging case in which the first quality factor is larger than the second
one.Comment: Submitted to Journal of Visual Communication and Image Representation
(first submission: March 20, 2017; second submission: August 2, 2017
Secure covert communications over streaming media using dynamic steganography
Streaming technologies such as VoIP are widely embedded into commercial and industrial applications, so it is imperative to address data security issues before the problems get really serious. This thesis describes a theoretical and experimental investigation of secure covert communications over streaming media using dynamic steganography. A covert VoIP communications system was developed in C++ to enable the implementation of the work being carried out.
A new information theoretical model of secure covert communications over streaming media was constructed to depict the security scenarios in streaming media-based steganographic systems with passive attacks. The model involves a stochastic process that models an information source for covert VoIP communications and the theory of hypothesis testing that analyses the adversaryâs detection performance.
The potential of hardware-based true random key generation and chaotic interval selection for innovative applications in covert VoIP communications was explored. Using the read time stamp counter of CPU as an entropy source was designed to generate true random numbers as secret keys for streaming media steganography. A novel interval selection algorithm was devised to choose randomly data embedding locations in VoIP streams using random sequences generated from achaotic process.
A dynamic key updating and transmission based steganographic algorithm that includes a one-way cryptographical accumulator integrated into dynamic key exchange for covert VoIP communications, was devised to provide secure key exchange for covert communications over streaming media. The discrete logarithm problem in mathematics and steganalysis using t-test revealed the algorithm has the advantage of being the most solid method of key distribution over a public channel.
The effectiveness of the new steganographic algorithm for covert communications over streaming media was examined by means of security analysis, steganalysis using non parameter Mann-Whitney-Wilcoxon statistical testing, and performance and robustness measurements. The algorithm achieved the average data embedding rate of 800 bps, comparable to other related algorithms. The results indicated that the algorithm has no or little impact on real-time VoIP communications in terms of speech quality (< 5% change in PESQ with hidden data), signal distortion (6% change in SNR after steganography) and imperceptibility, and it is more secure and effective in addressing the security problems than other related algorithms
Performance Analysis on Text Steganalysis Method Using A Computational Intelligence Approach
In this paper, a critical view of the utilization ofcomputational intelligence approach from the text steganalysisperspective is presented. This paper proposes a formalization ofgenetic algorithm method in order to detect hidden message on ananalyzed text. Five metric parameters such as running time, fitnessvalue, average mean probability, variance probability, and standarddeviation probability were used to measure the detection performancebetween statistical methods and genetic algorithm methods.Experiments conducted using both methods showed that geneticalgorithm method performs much better than statistical method,especially in detecting short analyzed texts. Thus, the findings showedthat the genetic algorithm method on analyzed stego text is verypromising. For future work, several significant factors such as datasetenvironment, searching process and types of fitness values throughother intelligent methods of computational intelligence should beinvestigated
Information-Theoretic Bounds for Steganography in Multimedia
Steganography in multimedia aims to embed secret data into an innocent
looking multimedia cover object. This embedding introduces some distortion to
the cover object and produces a corresponding stego object. The embedding
distortion is measured by a cost function that determines the detection
probability of the existence of the embedded secret data. A cost function
related to the maximum embedding rate is typically employed to evaluate a
steganographic system. In addition, the distribution of multimedia sources
follows the Gibbs distribution which is a complex statistical model that
restricts analysis. Thus, previous multimedia steganographic approaches either
assume a relaxed distribution or presume a proposition on the maximum embedding
rate and then try to prove it is correct. Conversely, this paper introduces an
analytic approach to determining the maximum embedding rate in multimedia cover
objects through a constrained optimization problem concerning the relationship
between the maximum embedding rate and the probability of detection by any
steganographic detector. The KL-divergence between the distributions for the
cover and stego objects is used as the cost function as it upper bounds the
performance of the optimal steganographic detector. An equivalence between the
Gibbs and correlated-multivariate-quantized-Gaussian distributions is
established to solve this optimization problem. The solution provides an
analytic form for the maximum embedding rate in terms of the WrightOmega
function. Moreover, it is proven that the maximum embedding rate is in
agreement with the commonly used Square Root Law (SRL) for steganography, but
the solution presented here is more accurate. Finally, the theoretical results
obtained are verified experimentally.Comment: arXiv admin note: substantial text overlap with arXiv:2111.0496
Recommended from our members
High capacity steganographic method based upon JPEG
The two most important aspects of any image-based
steganographic system are the quality of the stegoimage and the capacity of the cover image. This paper proposes a novel and high capacity steganographic approach based on Discrete Cosine Transformation (DCT) and JPEG compression. JPEG technique divides the input image into non-overlapping blocks of 8x8 pixels and uses the DCT transformation. However, our proposed method divides the cover image into nonoverlapping
blocks of 16x16 pixels. For each quantized
DCT block, the least two-significant bits (2-LSBs) of each middle frequency coefficient are modified to embed two secret bits. Our aim is to investigate the data hiding efficiency using larger blocks for JPEG compression. Our experiment result shows that the proposed approach can provide a higher information hiding capacity than Jpeg-Jsteg and Chang et al. methods based on the conventional blocks of 8x8 pixels. Furthermore, the produced stego-images are almost identical to the original cover images
Markov bidirectional transfer matrix for detecting LSB speech steganography with low embedding rates
Steganalysis with low embedding rates is still a challenge in the field of information hiding. Speech signals are typically processed by wavelet packet decomposition, which is capable of depicting the details of signals with high accuracy. A steganography detection algorithm based on the Markov bidirectional transition matrix (MBTM) of the wavelet packet coefficient (WPC) of the second-order derivative-based speech signal is proposed. On basis of the MBTM feature, which can better express the correlation of WPC, a Support Vector Machine (SVM) classifier is trained by a large number of Least Significant Bit (LSB) hidden data with embedding rates of 1%, 3%, 5%, 8%,10%, 30%, 50%, and 80%. LSB matching steganalysis of speech signals with low embedding rates is achieved. The experimental results show that the proposed method has obvious superiorities in steganalysis with low embedding rates compared with the classic method using histogram moment features in the frequency domain (HMIFD) of the second-order derivative-based WPC and the second-order derivative-based Mel-frequency cepstral coefficients (MFCC). Especially when the embedding rate is only 3%, the accuracy rate improves by 17.8%, reaching 68.5%, in comparison with the method using HMIFD features of the second derivative WPC. The detection accuracy improves as the embedding rate increases
- âŚ