Key-dependent JPEG2000-based robust hashing for secure image authentication
EURASIP Journal on Information Security
A study on the randomness measure of image hashing
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
Fragility analysis of adaptive quantization-based image hashing
IEEE Transactions on Information Forensics and Security
Perceptual image hashing based on virtual watermark detection
IEEE Transactions on Image Processing
An extended image hashing concept: content-based fingerprinting using FJLT
EURASIP Journal on Information Security
Lexicographical framework for image hashing with implementation based on DCT and NMF
Multimedia Tools and Applications
Structural Feature-Based Image Hashing and Similarity Metric for Tampering Detection
Fundamenta Informaticae
Random Gray code and its performance analysis for image hashing
Signal Processing
A secure perceptual hash algorithm for image content authentication
CMS'11 Proceedings of the 12th IFIP TC 6/TC 11 international conference on Communications and multimedia security
Radon transform-based secure image hashing
CMS'11 Proceedings of the 12th IFIP TC 6/TC 11 international conference on Communications and multimedia security
Histogram-based image hashing for searching content-preserving copies
Transactions on data hiding and multimedia security VI
Robust 3D mesh model hashing based on feature object
Digital Signal Processing
Key-dependent 3D model hashing for authentication using heat kernel signature
Digital Signal Processing
Hi-index | 0.00 |
An image hash is a randomized compact representation of image content and finds applications in image authentication, image and video watermarking, and image similarity comparison. Usually, an image-hashing scheme is required to be robust and secure, and the security issue is particularly important in applications, such as multimedia authentication, watermarking, and fingerprinting. In this paper, we investigate the security of image hashing from the perspective of unicity distance, a concept pioneered by Shannon in one of his seminal papers. Using two recently proposed image-hashing schemes as representatives, we show that the concept of unicity distance can be adapted to evaluate the security of image hashing. Our analysis shows that the secret hashing key, or its equivalent form, can be estimated with high accuracy when the key is reused several dozen times. The estimated unicity distance determines the maximum number of key reuses in the investigated hashing schemes. A countermeasure of randomized key initialization is discussed to avoid key reuse and strengthen the security of robust image hashing.