372 research outputs found

    Steganography: a class of secure and robust algorithms

    Full text link
    This research work presents a new class of non-blind information hiding algorithms that are stego-secure and robust. They are based on some finite domains iterations having the Devaney's topological chaos property. Thanks to a complete formalization of the approach we prove security against watermark-only attacks of a large class of steganographic algorithms. Finally a complete study of robustness is given in frequency DWT and DCT domains.Comment: Published in The Computer Journal special issue about steganograph

    Using Transcoding for Hidden Communication in IP Telephony

    Get PDF
    The paper presents a new steganographic method for IP telephony called TranSteg (Transcoding Steganography). Typically, in steganographic communication it is advised for covert data to be compressed in order to limit its size. In TranSteg it is the overt data that is compressed to make space for the steganogram. The main innovation of TranSteg is to, for a chosen voice stream, find a codec that will result in a similar voice quality but smaller voice payload size than the originally selected. Then, the voice stream is transcoded. At this step the original voice payload size is intentionally unaltered and the change of the codec is not indicated. Instead, after placing the transcoded voice payload, the remaining free space is filled with hidden data. TranSteg proof of concept implementation was designed and developed. The obtained experimental results are enclosed in this paper. They prove that the proposed method is feasible and offers a high steganographic bandwidth. TranSteg detection is difficult to perform when performing inspection in a single network localisation.Comment: 17 pages, 16 figures, 4 table

    LSB steganography with improved embedding efficiency and undetectability

    Get PDF

    Analysis of MHPDM algorithm for data hiding in JPEG images

    Get PDF
    In the recent years, there has been a great deal of interest in developing a secure algorithm for hiding information in images, or steganography. There has also been a lot of research in steganalysis of images, which deals with the detection of hidden information in supposedly natural images. The first section of this thesis reviews the steganography algorithms and steganalysis techniques developed in the last few years. It discusses the breadth of steganographic algorithms and steganalytic techniques, starting with the earliest, based on LSB flipping of the DCT coefficients, to more recent and sophisticated algorithms for data hiding and equally clever steganalytic techniques. The next section focuses on the steganographic algorithm, MHPDM which was first developed by Eggers and then modified by Tzschoppe, Bauml, Huber and Kaup. The MHPDM algorithm preserves the histogram of the stego image and is thus perfectly secure in terms of Cachin\u27s security definition. The MHPDM algorithm is explained in detail and implemented in MATLAB. It is then tested on numerous images and steganalysed using Dr. Fridrich\u27s recent feature-based steganalytic technique. The thesis concludes with observations about the detectibility of MHPDM using feature-based steganalysis for different payloads (embedded message lengths)
    • …
    corecore