On the security of the visual hash function

Robust hash functions are central to the security of multimedia content authentication systems. Such functions are sensitive to a key but are robust to many allowed signal processing operations on the underlying content. The robustness of the hash function to changes in the original content implies the existence of a cluster in the feature space around the original contents feature vector, any point within which getting hashed to the same output. The shape and size of the cluster determines the trade-off between the robustness offered and the security of the authentication system based on the robust hash function. The clustering itself is based on a secret key and hence unknown to the attacker. However, we show that the specific clustering arrived at by the robust visual hash function (VHF) may be possible to learn. Given just an input and its hash bits, we show how to construct a statistical model of the hash function, without any knowledge of the secret key used to compute the hash. We also show how to use this model to engineer arbitrary and malicious collisions. Finally, we propose one possible modification to VHF so that constructing a model that mimics its behavior becomes difficult.

[1]  Kannan Ramchandran,et al.  Dither-based secure image hashing using distributed coding , 2003, Proceedings 2003 International Conference on Image Processing (Cat. No.03CH37429).

[2]  Nasir D. Memon,et al.  Counterfeiting attacks on oblivious block-wise independent invisible watermarking schemes , 2000, IEEE Trans. Image Process..

[3]  Sushil K. Bhattacharjee,et al.  Compression tolerant image authentication , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

[4]  Philip Ogunbona,et al.  Compression tolerant DCT based image hash , 2003, 23rd International Conference on Distributed Computing Systems Workshops, 2003. Proceedings..

[5]  Yoav Freund,et al.  A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.

[6]  Ramarathnam Venkatesan,et al.  New Iterative Geometric Methods for Robust Perceptual Image Hashing , 2001, Digital Rights Management Workshop.

[7]  Yoav Freund,et al.  A decision-theoretic generalization of on-line learning and an application to boosting , 1997, EuroCOLT.

[8]  Tiago Rosa Maria Paula Queluz Content-based integrity protection of digital images , 1999, Electronic Imaging.

[9]  Ramarathnam Venkatesan,et al.  Robust image hashing , 2000, Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101).

[10]  Shih-Fu Chang,et al.  A robust image authentication method distinguishing JPEG compression from malicious manipulation , 2001, IEEE Trans. Circuits Syst. Video Technol..

[11]  Shih-Fu Chang,et al.  A robust content based digital signature for image authentication , 1996, Proceedings of 3rd IEEE International Conference on Image Processing.

[12]  Benoit M. Macq,et al.  A robust soft hash algorithm for digital image signature , 2003, Proceedings 2003 International Conference on Image Processing (Cat. No.03CH37429).

[13]  Jaap A. Haitsma,et al.  Robust Audio Hashing for Content Identification , 2001 .

[14]  Jiri Fridrich,et al.  Robust hash functions for digital watermarking , 2000, Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540).

[15]  Yoav Freund,et al.  A Short Introduction to Boosting , 1999 .