loading...
Worst Case Attack on Quantization Based Data Hiding
San Diego, CA December 11-December 13
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISM.2006.161Eighth IEEE International Symposium o ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ning Liu, Stevens Institute of Technology, USA
K.P. Subbalakshmi, Stevens Institute of Technology, USA
Currently, most quantization based data hiding al- gorithms are built assuming specific distributions of at- tacks, such as additive white Gaussian noise (AWGN), uniform noise, and so on. In this paper, we prove that the worst case additive attack for quantization based data hiding is a 3-\delta function. We derive the expression for the probability of error (P_e) in terms of distortion compensation factor, \alpha, and the attack distribution. By maximizing P_e with respect to the attack distribution, we get the optimal placement of the 3-\delta function. We then experimentally verify that the 3-\delta function is in- deed the worst case attack for quantization based data hiding.
Citation:
Ning Liu, K.P. Subbalakshmi, "Worst Case Attack on Quantization Based Data Hiding," ism, pp.679-684, Eighth IEEE International Symposium on Multimedia (ISM'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.