@article {18287,
	title = {Unicity Distance of Robust Image Hashing},
	journal = {Information Forensics and Security, IEEE Transactions on},
	volume = {2},
	year = {2007},
	month = {2007/09//},
	pages = {462 - 467},
	abstract = {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.},
	keywords = {authentication;image, authentication;randomized, coding;image, compact, comparison;multimedia, content;image, data;, distance;watermarking;image, fingerprinting;image, hashing;unicity, image, initialization;robust, key, of, representation;randomized, representation;security, similarity},
	isbn = {1556-6013},
	doi = {10.1109/TIFS.2007.902260},
	author = {Mao,Yinian and M. Wu}
}
