Steganography in Digital Media : Principles, Algorithms, and Applications.

Understand the building blocks of covert communication in digital media and apply the techniques in practice with this self-contained guide.

Saved in:
Bibliographic Details
Online Access: Full Text (via Cambridge)
Main Author: Fridrich, Jessica
Format: Electronic eBook
Language:English
Published: Cambridge : Cambridge University Press, 2009.
Subjects:
Table of Contents:
  • Cover; Steganography in Digital Media; Title; Copyright; Dedication; Contents; Preface; Acknowledgments; 1 Introduction; 1.1 Steganography throughout history; 1.2 Modern steganography; 1.2.1 The prisoners' problem; 1.2.2 Steganalysis is the warden's job; 1.2.3 Steganographic security; 1.2.4 Steganography and watermarking; Summary; 2 Digital image formats; 2.1 Color representation; 2.1.1 Color sampling; 2.2 Spatial-domain formats; 2.2.1 Raster formats; 2.2.2 Palette formats; 2.3 Transform-domain formats (JPEG); 2.3.1 Color subsampling and padding; 2.3.2 Discrete cosine transform.
  • 2.3.3 Quantization2.3.4 Decompression; 2.3.5 Typical DCT block; 2.3.6 Modeling DCT coefficients; 2.3.7 Working with JPEG images in Matlab; Summary; 3 Digital image acquisition; 3.1 CCD and CMOS sensors; 3.2 Charge transfer and readout; 3.3 Color filter array; 3.4 In-camera processing; 3.5 Noise; Summary; 4 Steganographic channel; 4.1 Steganography by cover selection; 4.2 Steganography by cover synthesis; 4.3 Steganography by cover modification; Summary; 5 Naive steganography; 5.1 LSB embedding; 5.1.1 Histogram attack; 5.1.2 Quantitative attack on Jsteg; 5.2 Steganography in palette images.
  • 5.2.1 Embedding in palette5.2.2 Embedding by preprocessing palette; 5.2.3 Parity embedding in sorted palette; 5.2.4 Optimal-parity embedding; 5.2.5 Adaptive methods; 5.2.6 Embedding while dithering; Summary; 6 Steganographic security; 6.1 Information-theoretic definition; 6.1.1 KL divergence as a measure of security; 6.1.2 KL divergence for benchmarking; 6.2 Perfectly secure steganography; 6.2.1 Perfect security and compression; 6.2.2 Perfect security with respect to model; 6.3 Secure stegosystems with limited embedding distortion; 6.3.1 Spread-spectrum steganography.
  • 6.3.2 Stochastic quantization index modulation6.3.3 Further reading; 6.4 Complexity-theoretic approach; 6.4.1 Steganographic security by Hopper et al.; 6.4.2 Steganographic security by Katzenbeisser and Petitcolas; 6.4.3 Further reading; Summary; 7 Practical steganographic methods; 7.1 Model-preserving steganography; 7.1.1 Statistical restoration; 7.1.2 Model-based steganography; 7.2 Steganography by mimicking natural processing; 7.2.1 Stochastic modulation; 7.2.2 The question of optimal stego noise; 7.3 Steganalysis-aware steganography; 7.3.1 ±1 embedding; 7.3.2 F5 embedding algorithm.
  • 7.4 Minimal-impact steganography7.4.1 Performance bound on minimal-impact embedding; 7.4.2 Optimality of F5 embedding operation; Summary; 8 Matrix embedding; 8.1 Matrix embedding using binary Hamming codes; 8.2 Binary linear codes; 8.3 Matrix embedding theorem; 8.3.1 Revisiting binary Hamming codes; 8.4 Theoretical bounds; 8.4.1 Bound on embedding efficiency for codes of fixed length; 8.4.2 Bound on embedding efficiency for codes of increasing length; 8.5 Matrix embedding for large relative payloads; 8.6 Steganography using q-ary symbols; 8.6.1; 8.6.2 Performance bounds for q-ary codes.