1 / 28

Steganography

Steganography. -Archana Sapkota -Deepti Reddy. What is it?. The art and science of writing hidden messages in such a way that no one, apart from the sender and intended recipient, suspects the existence of the message. "Boss said that we should blow up the bridge at midnight.”.

luann
Download Presentation

Steganography

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Steganography -Archana Sapkota -Deepti Reddy CS691 Summer 2009

  2. What is it? • The art and science of writing hidden messages in such a way that no one, apart from the sender and intended recipient, suspects the existence of the message. "Boss said that we should blow up the bridge at midnight.” CS691 Summer 2009

  3. Cover Image and Stego-Image CS691 Summer 2009

  4. Some Terms…. • Cryptography: • cryptography - concealing the content of messages • steganography - concealing their existence • Digital watermarking: - Information is embedded into digital multimedia content such that the watermark (information) can later be extracted and detected for purposes such as copy prevention and control. • Steganalysis - Refers to the body of techniques that aid someone in distinguishing between cover-objects and stego-objects. CS691 Summer 2009

  5. Prisoners Problem Wendy Is it stego?? Suppress Message Bob Alice Extracting algorithm Embedding algorithm Cover Message Secret key Hidden Message Secret Message Secret key CS691 Summer 2009

  6. Some examples from past.. • Message tattooed on a slave’s shaved head. • Al Qaida might have used it for 9/11. • Use of invisible ink. • Writing on wooden surface before applying wax in wax table. CS691 Summer 2009

  7. Classification of Steganographic systems • Substitution system: Substitute the redundant parts of a cover with a secret message. • Transform Domain Techniques: Embed secret information in a transform space of the signal (e.g. in the frequency domain). • Spread Spectrum Techniques: Adopts ideas from spread spectrum communication. CS691 Summer 2009

  8. Classification of Steganographic systems • Statistical Methods: Encode information by changing several statistical properties and a cover and use hypothesis testing in the extraction process. • Distortion Techniques: Store information by signal distortion and measure the deviation from the original signal in the decoding step. • Cover generation method: Encode information in the way a cover for secret communication is created. CS691 Summer 2009

  9. Secure Steganographic System • Kerckhoffs’principle: The embedding algorithm is supposed to be known to the public. Therefore, the embedding process may use an embedding key so that only the legal user can successfully extract the embedded data by using the corresponding extraction key in the extraction process. CS691 Summer 2009

  10. Least Significant Bit Substitution • Embedding process: - Choose a subset of cover elements - Exchange LSB of each element by 0 or 1 - Another approach is to use a 2-bit LSB • Extraction process: - Extract LSB of each cover element (either 1 or 2-bit) - Line them up to reconstruct secret message • Receiver must know the sequence of element indices used in the embedding process. CS691 Summer 2009

  11. Problems with LSB substitution • A strong assumption of a passive attacker that the small changes in the carrier are not noticed. • The main problem with this is the part of the image in which the information is embedded has different statistical properties than the rest of the image. • Most image hiding techniques use uncompressed (BMP) or lossless (GIF) cover images but take a lot of transmission bandwidth and storage space. CS691 Summer 2009

  12. LSB substitution • Pseudorandom- Slightly Better Approach: • Use pseudorandom number generator • Spread secret message over the cover in a random manner - Distance between two embedded bits is determined pseudorandomly - Receiver should be aware of the seed and knowledge of the number generator CS691 Summer 2009

  13. Problems with Pseudo-Random • Alice creates a sequence j[1] through j[m] of element indices . Alice then stores the kth message bit in the element with index j[k] • Collisions - BAM!!!!!!! • An index can appear more than once in a sequence • Causes Alice to insert more than one message bit into one cover element corrupting some - The larger the secret message, the greater the chances of collisions • Solution to this problem • Alice keeps track of all cover elements which have been used for substitution. If collision occurs, she discards the element and she chooses a different cover element pseudo-randomly. CS691 Summer 2009

  14. JPEG steganography • JPEG compression is based on the discrete cosine transform (DCT), and reduces the visual redundancy to achieve good compression performance. • JPEG steganography uses the DCT coefficients to embed the secret bits. • J-Steg, OutGuess, F5 etc. CS691 Summer 2009

  15. Review of JPEG compression • Compression: • Decompression DCT Quantization Entropy Encoding Compressed Code Original Image DCT Reconstructed Image Entropy Decoding De-quantization Compressed Code CS691 Summer 2009

  16. JPEG Steganography • J-Steg : Embeds the secret data by sequentially flipping the LSB of the quantized DCT coefficients (except 0s and 1s) without causing detectable artificial distortion. CS691 Summer 2009

  17. JPEG Steganography OutGuess: • In the first pass, the secret bits are embedded in the LSBs of the quantized DCT coefficients (skipping 0s and 1s) along a random walk. • In the second pass, the histogram of the stego-image is adjusted to match that of the cover-image. CS691 Summer 2009

  18. JPEG Steganography F5: • Instead of replacing the LSBs of the quantized DCT coefficients with the secret bits, the absolute value of the coefficient is decreased by 1. • It also randomly chooses randomly DCT coefficients to embed the secret bits. CS691 Summer 2009

  19. Steganalysis • Refers to the body of techniques that aid someone in distinguishing between cover-objects and stego-objects. Sample distribution observed in the possibly changed carrier Theoretically expected frequency distribution in steganograms CS691 Summer 2009

  20. J-Steg Breaks • Chi-Square Attack: If the bits used for overwriting the least significant bits are equally distributed, the frequencies of both values of each PoV(Pair of Values) become equal. • Extended chi-square method for smaller portion of the images can detect the randomly scattered attack also. CS691 Summer 2009

  21. Chi-square attack on J-stag CS691 Summer 2009

  22. F5 Breaks • Changes the histogram of DCT coefficients. • The number of Zeros in the histogram increases. • Algorithm(Histogram): • Estimate the cover image histogram. • Compare the stego-image histogram with cover image. CS691 Summer 2009

  23. Histogram Comparison CS691 Summer 2009

  24. OutGuess Breaks!! • Not that easy to break with histogram! • Algorithm (Re-embedding): • Estimate the cover image • Re-embed another message in possibly stego-image. • Embed the same message in the estimated cover image. • Results more noise in DCT and thus more discontinuities in the estimated cover image than in stego-image. CS691 Summer 2009

  25. Attack on OutGuess Colored graphs represent the different images taken for test. CS691 Summer 2009

  26. Complementary Embedding • Secret bits are embedded in the cover-image by subtracting one from or adding one to the non-zero DCT coefficients. Stego key Coefficient Permutation Coefficient Separation DCT of Cover Image Coefficient Combination Secret Bit Separation Secret Bits Embedding Encrypted Message Coefficient De-Permutation Entropy Encoding Stego Image CS691 Summer 2009

  27. Applications.. • Confidential communication and secret data storing • Protection of data alteration • Access control system for digital content distribution • Media Database systems Reference: http://www.datahide.com/BPCSe/applications-e.html CS691 Summer 2009

  28. References • Liu, C. and Liao, S. 2008. High-performance JPEG steganography using complementary embedding strategy. Pattern Recogn. 41, 9 (Sep. 2008), 2945-2955. DOI= http://dx.doi.org/10.1016/j.patcog.2008.03.005 • New Methodology for Breaking Steganographic Techniques for JPEGs, with M. Goljan and D. Hogea, Proc. SPIE, Electronic Imaging, Security, Steganography, and Watermarking of Multimedia Contents V, Santa Clara, California, pp. 143-155, 2003 • N. F. Johnson and S. Katzenbeisser, “A survey of steganographic techniques,” in Information Hiding, S. Katzenbeisser and F. Petitcolas,Eds. Norwood, MA: Artech House, 2000, pp. 43–78. • Christian Cachin. An information-theoretic model for steganography. Information and Computation, 192(1):41-56, July 2004. Parts of this paper appeared in Proc. 2nd Workshop on Information Hiding, Springer, 1998 CS691 Summer 2009

More Related