Dynamical running coding in digital steganography
- 13 February 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 13 (3) , 165-168
- https://doi.org/10.1109/lsp.2005.862602
Abstract
A novel coding method for digital steganography is described, in which the amount of bit alterations introduced into a cover medium is significantly reduced, leading to less distortion and enhanced security against steganalysis. Unlike other block-based stego-coding approaches, the proposed method works in a running manner. In this way, each secret bit is represented by a series of consecutive cover bits, and flipping of one cover bit can be used to insert several secret bits. Theoretical analysis shows that, by reducing host alterations and inducing less distortion, the running coding has advantages over a previous technique.Keywords
This publication has 8 references indexed in Scilit:
- Steganalysis of LSB matching in grayscale imagesIEEE Signal Processing Letters, 2005
- Cyber warfareCommunications of the ACM, 2004
- Model-Based SteganographyPublished by Springer Nature ,2004
- Vulnerability of pixel-value differencing steganography to histogram analysis and modification for enhanced securityPattern Recognition Letters, 2003
- Steganography with Least Histogram AbnormalityPublished by Springer Nature ,2003
- A secure data hiding scheme for binary imagesIEEE Transactions on Communications, 2002
- Practical steganalysis of digital images: state of the artPublished by SPIE-Intl Soc Optical Eng ,2002
- F5—A Steganographic AlgorithmPublished by Springer Nature ,2001