A robust soft hash algorithm for digital image signature

Watermarking is largely used for copyright protection and fast search of images in databases. Another method for securely identifying images is to use hash functions. Digital signature standard, used in cryptosystem to dispute authentication documents, is based on hash functions. A digital signature is a bit stream dependent on key and content of document. For each document, the digital signature algorithm provides a unique output bit stream. In order to be efficient in images, the digital signature should be different if and only if the image content, and not the input bit stream, is different. Our new method is a one-way function for images. Using the radon transform and principal component analysis, we extract characteristics robust against geometrical transformation (rotation and scaling) and image processing attacks (compression, filtering, blurring).

[1]  Oded Goldreich,et al.  Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme , 1986, CRYPTO.

[2]  Weili Lin,et al.  Principles of magnetic resonance imaging: a signal processing perspective [Book Review] , 2000 .

[3]  Jiri Fridrich,et al.  Robust bit extraction from images , 1999, Proceedings IEEE International Conference on Multimedia Computing and Systems.

[4]  P. Lauterbur,et al.  Principles of magnetic resonance imaging : a signal processing perspective , 1999 .

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

[6]  Jean-Didier Legat,et al.  RASH: RAdon soft hash algorithm , 2002, 2002 11th European Signal Processing Conference.

[7]  Markus G. Kuhn,et al.  Attacks on Copyright Marking Systems , 1998, Information Hiding.

[8]  Keinosuke Fukunaga,et al.  Introduction to Statistical Pattern Recognition , 1972 .