Robust, imperceptible and blind video steganography using RGB secret, maximum likelihood estimation and Fibonacci encryption
by Barnali Gupta Banik; Abhinandan Banik
International Journal of Electronic Security and Digital Forensics (IJESDF), Vol. 12, No. 2, 2020

Abstract: According to the International Telecommunication Union, currently 51% of the world's population has internet access, out of which over 80% prefers video sharing. Henceforth for secure communication, secret data hiding in video can be a viable option. Here a blind, key-based video steganography has been proposed which can hide RGB image within a colour video. The novelty of this approach lies in the security imposed by various factors including scene change detection by maximum likelihood estimation; pre-processing of secret image by Fibonacci encryption and discrete wavelet transform based keyed embedding technique, which can hide colour images without any perceivable differences and does not require cover video frame during extraction. Quality of the method has been analysed by peak signal to noise ratio, structural similarity index, normalised absolute error and correlation coefficient; robustness has been tested against random cropping, rotating, resizing and histogram equalization; comparison with the literature demonstrates its superiority.

Online publication date: Thu, 02-Apr-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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:

    Username:        Password:         

Forgotten your 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