139 research outputs found

    JPEG steganography: A performance evaluation of quantization tables

    Get PDF
    The two most important aspects of any image based steganographic system are the imperceptibility and the capacity of the stego image. This paper evaluates the performance and efficiency of using optimized quantization tables instead of default JPEG tables within JPEG steganography. We found that using optimized tables significantly improves the quality of stego-images. Moreover, we used this optimization strategy to generate a 16x16 quantization table to be used instead of that suggested. The quality of stego-images was greatly improved when these optimized tables were used. This led us to suggest a new hybrid steganographic method in order to increase the embedding capacity. This new method is based on both and Jpeg-Jsteg methods. In this method, for each 16x16 quantized DCT block, the least two significant bits (2-LSBs) of each middle frequency coefficient are modified to embed two secret bits. Additionally, the Jpeg-Jsteg embedding technique is used for the low frequency DCT coefficients without modifying the DC coefficient. Our experimental results show that the proposed approach can provide a higher information-hiding capacity than the other methods tested. Furthermore, the quality of the produced stego-images is better than that of other methods which use the default tables

    JPEG steganography with particle swarm optimization accelerated by AVX

    Get PDF
    Digital steganography aims at hiding secret messages in digital data transmitted over insecure channels. The JPEG format is prevalent in digital communication, and images are often used as cover objects in digital steganography. Optimization methods can improve the properties of images with embedded secret but introduce additional computational complexity to their processing. AVX instructions available in modern CPUs are, in this work, used to accelerate data parallel operations that are part of image steganography with advanced optimizations.Web of Science328art. no. e544

    Steganographer Identification

    Full text link
    Conventional steganalysis detects the presence of steganography within single objects. In the real-world, we may face a complex scenario that one or some of multiple users called actors are guilty of using steganography, which is typically defined as the Steganographer Identification Problem (SIP). One might use the conventional steganalysis algorithms to separate stego objects from cover objects and then identify the guilty actors. However, the guilty actors may be lost due to a number of false alarms. To deal with the SIP, most of the state-of-the-arts use unsupervised learning based approaches. In their solutions, each actor holds multiple digital objects, from which a set of feature vectors can be extracted. The well-defined distances between these feature sets are determined to measure the similarity between the corresponding actors. By applying clustering or outlier detection, the most suspicious actor(s) will be judged as the steganographer(s). Though the SIP needs further study, the existing works have good ability to identify the steganographer(s) when non-adaptive steganographic embedding was applied. In this chapter, we will present foundational concepts and review advanced methodologies in SIP. This chapter is self-contained and intended as a tutorial introducing the SIP in the context of media steganography.Comment: A tutorial with 30 page

    Mobile app with steganography functionalities

    Get PDF
    [Abstract]: Steganography is the practice of hiding information within other data, such as images, audios, videos, etc. In this research, we consider applying this useful technique to create a mobile application that lets users conceal their own secret data inside other media formats, send that encoded data to other users, and even perform analysis to images that may have been under a steganography attack. For image steganography, lossless compression formats employ Least Significant Bit (LSB) encoding within Red Green Blue (RGB) pixel values. Reciprocally, lossy compression formats, such as JPEG, utilize data concealment in the frequency domain by altering the quantized matrices of the files. Video steganography follows two similar methods. In lossless video formats that permit compression, the LSB approach is applied to the RGB pixel values of individual frames. Meanwhile, in lossy High Efficient Video Coding (HEVC) formats, a displaced bit modification technique is used with the YUV components.[Resumo]: A esteganografĂ­a Ă© a prĂĄctica de ocultar determinada informaciĂłn dentro doutros datos, como imaxes, audio, vĂ­deos, etc. Neste proxecto pretendemos aplicar esta tĂ©cnica como visiĂłn para crear unha aplicaciĂłn mĂłbil que permita aos usuarios ocultar os seus propios datos secretos dentro doutros formatos multimedia, enviar eses datos cifrados a outros usuarios e mesmo realizar anĂĄlises de imaxes que puidesen ter sido comprometidas por un ataque esteganogrĂĄfico. Para a esteganografĂ­a de imaxes, os formatos con compresiĂłn sen perdas empregan a codificaciĂłn Least Significant Bit (LSB) dentro dos valores Red Green Blue (RGB) dos seus pĂ­xeles. Por outra banda, os formatos de compresiĂłn con perdas, como JPEG, usan a ocultaciĂłn de datos no dominio de frecuencia modificando as matrices cuantificadas dos ficheiros. A esteganografĂ­a de vĂ­deo segue dous mĂ©todos similares. En formatos de vĂ­deo sen perdas, o mĂ©todo LSB aplĂ­case aos valores RGB de pĂ­xeles individuais de cadros. En cambio, nos formatos High Efficient Video Coding (HEVC) con compresiĂłn con perdas, Ășsase unha tĂ©cnica de cambio de bits nos compoñentes YUV.Traballo fin de grao (UDC.FIC). EnxeñarĂ­a InformĂĄtica. Curso 2022/202

    A Secure Steganographic Algorithm Based on Frequency Domain for the Transmission of Hidden Information

    Get PDF
    This contribution proposes a novel steganographic method based on the compression standard according to the Joint Photographic Expert Group and an Entropy Thresholding technique. The steganographic algorithm uses one public key and one private key to generate a binary sequence of pseudorandom numbers that indicate where the elements of the binary sequence of a secret message will be inserted. The insertion takes eventually place at the first seven AC coefficients in the transformed DCT domain. Before the insertion of the message the image undergoes several transformations. After the insertion the inverse transformations are applied in reverse order to the original transformations. The insertion itself takes only place if an entropy threshold of the corresponding block is satisfied and if the pseudorandom number indicates to do so. The experimental work on the validation of the algorithm consists of the calculation of the peak signal-to-noise ratio (PSNR), the difference and correlation distortion metrics, the histogram analysis, and the relative entropy, comparing the same characteristics for the cover and stego image. The proposed algorithm improves the level of imperceptibility analyzed through the PSNR values. A steganalysis experiment shows that the proposed algorithm is highly resistant against the Chi-square attack

    Side-Information For Steganography Design And Detection

    Get PDF
    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

    Pseudo-random number generators and an improved steganographic algorithm

    Get PDF
    Steganography is the art and science of hiding secret information in a cover medium such that the presence of the hidden information cannot be detected. This thesis proposes a new method of steganography by cover modification in JPEG images. Essentially, the algorithm exercises LSB replacement using the definition for steganographic values from F5. After the nonzero quantized DCT coefficients of a cover image undergo a pseudorandom walk, the coefficients and the payload are split into an equal number of partitions and paired. Each coefficient partition is permuted again by the 1/P pseudo-random number generator until an optimal embedding efficiency for its corresponding payload is achieved. Using this method, we achieve a higher embedding efficiency than that of LSB replacement alone. We evaluate the detectability of our algorithm by creating a multi-classifier based on the output of multiple non-linear, soft-margin support vector machines trained on POMM features. We show that our algorithm performs nearly as well as the state-of-the-art nsF5 algorithm, and outperforms other state-of-the-art algorithms under most conditions

    Compression Technique Using DCT & Fractal Compression: A Survey

    Get PDF
    Steganography differs from digital watermarking because both the information and the very existence of the information are hidden. In the beginning, the fractal image compression method is used to compress the secret image, and then we encrypt this compressed data by DES.The Existing Steganographic approaches are unable to handle the Subterfuge attack i.e, they cannot deal with the opponents not only detects a message ,but also render it useless, or even worse, modify it to opponent favor. The advantage of BCBS is the decoding can be operated without access to the cover image and it also detects if the message has been tampered without using any extra error correction. To improve the imperceptibility of the BCBS, DCT is used in combination to transfer stego-image from spatial domain to the frequency domain. The hiding capacity of the information is improved by introducing Fractal Compression and the security is enhanced using by encrypting stego-image using DES.  Copyright © www.iiste.org Keywords: Steganography, data hiding, fractal image compression, DCT
    • 

    corecore