1 January 2005 On the security of the visual hash function
Author Affiliations +
Abstract
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.
© (2005) Society of Photo-Optical Instrumentation Engineers (SPIE)
Regunathan Radhakrishnan, Regunathan Radhakrishnan, Ziyou Xiong, Ziyou Xiong, Nasir D. Memon, Nasir D. Memon, } "On the security of the visual hash function," Journal of Electronic Imaging 14(1), 013011 (1 January 2005). https://doi.org/10.1117/1.1867475 . Submission:
JOURNAL ARTICLE
10 PAGES


SHARE
RELATED CONTENT

Information-theoretic interpretation of Besov spaces
Proceedings of SPIE (December 03 2000)
High-bitrate approximation
Proceedings of SPIE (November 12 2003)
Intraframe And Interframe Adaptive Transform Coding
Proceedings of SPIE (October 29 1975)
Security of the visual hash function
Proceedings of SPIE (June 19 2003)

Back to Top