On the complexity and hardness of the steganography embedding problem - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Rajarathnam Chandramouli, Shalin P. Trivedi, R. N. Uma. On the complexity and hardness of the steganography embedding problem. In Edward J. Delp, Ping Wah Wong, editors, Security, Steganography, and Watermarking of Multimedia Contents VI, San Jose, California, USA, January 18-22, 2004, Proceedings. Volume 5306 of Proceedings of SPIE, pages 496-500, SPIE, 2004.

This author has not been identified. Look up 'Rajarathnam Chandramouli' in GoogleThis author has not been identified. Look up 'Shalin P. Trivedi' in GoogleThis author has not been identified. Look up 'R. N. Uma' in Google

runs on WebDSL