KL-sense secure image steganography Online publication date: Tue, 31-Jan-2012
by Guoqi Luo; K.P. Subbalakshmi
International Journal of Security and Networks (IJSN), Vol. 6, No. 4, 2011
Abstract: In this paper, we propose a computationally-efficient data hiding method which achieves Cachin's security criterion: zero Kullback-Liebler (KL) divergence. To preserve statistical properties of the cover medium, we swap pixels rather than modify them to hide information. We theoretically analyse the security of the proposed method from various perspectives. Upper bounds of the KL divergence of second order statistics; The relationship between distortions in the DCT domain and embedding positions in the spatial domain; The upper bound on the conditional entropy in the DCT domain. We then subject our proposed stego method to several practical steganalysis algorithms: Histogram based attacks; A higher-order statistics based universal steganalysis algorithm; A new learning based steganalysis that specifically for this hiding algorithm. Experimental results show that our data hiding method can prevent these statistical detection methods, when the embedding rate is less than or equal to 10%.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Security and Networks (IJSN):
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 subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook