An approach for text steganography based on Markov Chains

A text steganography method based on Markov chains is introduced, together with a reference implementation. This method allows for information hiding in texts that are automatically generated following a given Markov model. Other Markov - based systems of this kind rely on big simpli cations of the language model to work, which produces less natural looking and more easily detectable texts. The method described here is designed to generate texts within a good approximation of the original language model provided.Sociedad Argentina de Informática e Investigación Operativ

CLOUD SECURITY USING LEAST SIGNIFICANT BIT STEGONAGRAPHY

The Cloud Computing is a dynamic term, which gives question free information rethinking office which keep the client from weights of nearby stockpiling issues. Presently a-days, distributed computing demonstrated its significance where it is being utilized by little and large associations. The significance of distributed computing is because of the different administrations gave by the cloud. One of these administrations is capacity as an administration (SaaS) which permits clients to store their information in the cloud information bases. The disadvantage of this administration is the security challenge since an outsider deals with the information. The clients need to have a sense of security to store their information in the cloud. Thus, we need for models that will upgrade the information security. The picture steganography is an approach to shield information from unapproved access. Picture steganography permits clients to hide mystery information in a cover picture.&nbsp

Constructing Perfect Steganographic Systems

We propose steganographic systems for the case when covertexts (containers) are generated by a finite-memory source with possibly unknown statistics. The probability distributions of covertexts with and without hidden information are the same; this means that the proposed stegosystems are perfectly secure, i.e. an observer cannot determine whether hidden information is being transmitted. The speed of transmission of hidden information can be made arbitrary close to the theoretical limit - the Shannon entropy of the source of covertexts. An interesting feature of the suggested stegosystems is that they do not require any (secret or public) key. At the same time, we outline some principled computational limitations on steganography. We show that there are such sources of covertexts, that any stegosystem that has linear (in the length of the covertext) speed of transmission of hidden text must have an exponential Kolmogorov complexity. This shows, in particular, that some assumptions on the sources of covertext are necessary