Self-synchronising image steganography algorithms based on error-correcting codes Online publication date: Sat, 26-Jul-2014
by S.K. Muttoo; Sushil Kumar
International Journal of Electronic Security and Digital Forensics (IJESDF), Vol. 5, No. 3/4, 2013
Abstract: Error correction codes-based techniques have been used by many researchers for image steganography to find a trade-off either between high embedding efficiency and low embedding complexity or between high embedding efficiency and high embedding capacity. However, there are other characteristics of steganography such as undetectability, security, robustness against common attacks and complexity that require the same attention. In this paper, we shall discuss error correction codes-based image steganography techniques to find a trade-off between high embedding capacity, high embedding efficiency, security, undetectability and imperceptibility. This paper presents two noval steganographic algorithm: first is error-based syndrome technique based on Reed-Muller codes and other is based on Reed-Solomon code. Before embedding, the message is encoded using self-synchronising T-codes, in place of Huffman codes, that not only compress the message, but also helps in synchronising the message at decoding stage of extraction. The comparisons of the proposed algorithms are done with Hamming-based matrix embedding, an improved pre-flipping matrix embedding, and Hamming-based error map technique. The experimental results show that proposed algorithms have better imperceptibility, multi-layered security, provable security and constant embedding efficiency.
Online publication date: Sat, 26-Jul-2014
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Electronic Security and Digital Forensics (IJESDF):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org