A perceptual audio hashing algorithm: A tool for robust audio identification and information hiding

54Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Assuming that watermarking is feasible (say, against a limited set of attacks of significant interest), current methods use a secret key to generate and embed a watermark. However, if the same key is used to watermark different items, then each instance may leak partial information and it is possible that one may extract the whole secret from a collection of watermarked items. Thus it will be ideal to derive content dependent keys, using a perceptual hashing algorithm (with its own secret key) that is resistant to small changes and otherwise having randomness and unpredictability properties analogous to cryptographic MACs. The techniques here are also useful for synchronizing in streams to find fixed locations against insertion and deletion attacks. Say, one may watermark a frame in a stream and can synchronize oneself to that frame using keyed perceptual hash and a known value for that frame. Our techniques can be used for identification of audio clips as well as database lookups in a way resistant to formatting and compression. We propose a novel audio hashing algorithm to be used for audio watermarking applications, that uses signal processing and traditional algorithmic analysis (against an adversary).

Cite

CITATION STYLE

APA

Kivanç Mihçak, M., & Venkatesan, A. (2001). A perceptual audio hashing algorithm: A tool for robust audio identification and information hiding. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2137, pp. 51–65). Springer Verlag. https://doi.org/10.1007/3-540-45496-9_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free