Steganography involves hiding messages in innocuous media such as images, while steganalysis is the field of detecting these secret messages. The ultimate goal of steganalysis is two-fold: making a binary classification of a file as stego-bearing or innocent, and secondly, locating the hidden

to be the secure modern alternative, exploiting the complexity of DNA in which a coded secret message is hidden. An enemy can only unlock the secret information by rst knowing that an intercepted letter is impregnated with microdot DNA, and secondly by nding the message amongst a huge amount of background DNA used

In this paper, we propose a new method for estimation of the number of embedding changes for non-adaptive ±k embedding in images. By modeling the cover image and the stego noise as additive mixture of random processes, the stego message is estimated from the stego image using a denoising filter

Abstract-A novel scheme for hiding information in Huffman trees is presented. Huffman trees are graphical representations of Huffman codes, which are optimal prefix-free codes generated by a simple algorithm given the distribution of the symbols. Huffman codes are used by MP3 and JPEG file formats for compressing audio and image files, but are also used for text documents and other digital media. The capacity, robustness and security of the information hiding scheme are analyzed and measured empirically. The results show that the scheme achieves a low capacity relative to the size of the coverobject and that the channel is not robust against an active adversary which knows about the channel. The security results show that an informed passive adversary's detection accuracy is greater than 90% if she has access to the symbol distribution and equivalent to pure guessing otherwise.

Abstract—In the present work the authors have introduced a new method for hiding any encrypted secret message inside a cover file. For encrypting secret message the authors have used new algorithm proposed by Nath et al(1). For hiding secret message we have used a method proposed by Nath et al (2

, and no coordination: any user can choose any set of possible signers that includes himself, and sign any message by using his secret key and the others ’ public keys, without getting their approval or assistance. Ring signatures provide an elegant way to leak authoritative secrets in an anonymous way, to sign casual

In the present work the authors are proposing a new steganography method to hide any encrypted secret message in multiple steps. In step-1 the secret message is encrypted using TTJSA algorithm. In step-2 we embed this encrypted message inside one known image or audio file using 4-th bit from LSB

Abstract—Recently, there have been proposals to evade censors by using steganography to embed secret messages in images shared on public photo-sharing sites. However, establishing a covert channel in this manner is not straightforward. First, photo-sharing sites often process uploaded images, thus

This memo provides information for the Internet community. This memo does not specify an Internet standard of any kind. Distribution of this memo is unlimited. This document describes HMAC, a mechanism for message authentication using cryptographic hash functions. HMAC can be used with any

randomness, to having intermediate nodes generate no private randomness, and all cases in between. We characterize the secret message capacity when either only one of the channels is eavesdropped or all of the channels are eavesdropped, and we develop polynomial time algorithms that achieve these capacities