Regular Articles

On the security of the visual hash function

[+] Author Affiliations
Regunathan Radhakrishnan

Polytechnic University, Brooklyn, New York

Ziyou Xiong

University of Illinois, Urbana Champaign, Illinois

Nasir Memon

Polytechnic University, Brooklyn, New York

J. Electron. Imaging. 14(1), 013011 (Mar. 16, 2005). doi:10.1117/1.1867475
History: Received Feb. 28, 2003; Revised Feb. 12, 2004; Accepted May 7, 2004; Mar. 16, 2005; Online March 16, 2005
Text Size: A A A

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 SPIE and IS&T.

© 2005 SPIE and IS&T

Citation

Regunathan Radhakrishnan ; Ziyou Xiong and Nasir Memon
"On the security of the visual hash function", J. Electron. Imaging. 14(1), 013011 (Mar. 16, 2005). ; http://dx.doi.org/10.1117/1.1867475


Tables

Access This Article
Sign in or Create a personal account to Buy this article ($20 for members, $25 for non-members).

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging & repositioning the boxes below.

Related Book Chapters

Topic Collections

Advertisement
  • Don't have an account?
  • Subscribe to the SPIE Digital Library
  • Create a FREE account to sign up for Digital Library content alerts and gain access to institutional subscriptions remotely.
Access This Article
Sign in or Create a personal account to Buy this article ($20 for members, $25 for non-members).
Access This Proceeding
Sign in or Create a personal account to Buy this article ($15 for members, $18 for non-members).
Access This Chapter

Access to SPIE eBooks is limited to subscribing institutions and is not available as part of a personal subscription. Print or electronic versions of individual SPIE books may be purchased via SPIE.org.