robusthashfunctionsfordigitalwatermarking.docVIP

Robust Hash Functions for Digital Watermarking a)Jiri Fridrich and b)Miroslav Goljan a)Center for Intelligent Systems, SUNY Binghamton, Binghamton, NY 13902-6000 a)Mission Research Corporation, 1720 Randolph Rd SE, Albuquerque, NM 87501 b)Department of Electrical Engineering, SUNY Binghamton, NY 13902-6000 Phone: +1 607 777 2577, fax: +1 607 777 2577, E-mail: {fridrich, bg22976}@binghamton.edu Abstract Digital watermarks have recently been proposed for authentication of both video data and still images and for integrity verification of visual multimedia. In such applications, the watermark has to depend on a secret key and on the original image. It is important that the dependence on the key be sensitive, while the dependence on the image be continuous (robust). Both requirements can be satisfied using special image digest functions that return the same bit-string for a whole class of images derived from an original image using common processing operations. It is further required that two completely different images produce completely different bit-strings. In this paper, we discuss methods how such robust hash functions can be built. We describe an algorithm and evaluate its performance. We also show how the hash bits As another application, the robust image digest can be used as a search index for an efficient image database search. 1. Introduction Hash functions are frequently called message digest functions. Their purpose is to extract a fixed-length bit-string from a message (computer file or image) of any length. Obviously, a message digest function is a many-to-one mapping. In cryptography, hash functions are typically used for digital signatures to authenticate the message being sent so that the recipient can verify that the message is authentic and that it came from the right person. The requirements for a cryptographic hash function are [1]: Given a message m and a hash function H, it should be easy and fast to compute the hash h=H(m) Gi