An Efficient Watermarking Method for MP3 Audio Files
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 32799
An Efficient Watermarking Method for MP3 Audio Files

Authors: Dimitrios Koukopoulos, Yiannis Stamatiou

Abstract:

In this work, we present for the first time in our perception an efficient digital watermarking scheme for mpeg audio layer 3 files that operates directly in the compressed data domain, while manipulating the time and subband/channel domain. In addition, it does not need the original signal to detect the watermark. Our scheme was implemented taking special care for the efficient usage of the two limited resources of computer systems: time and space. It offers to the industrial user the capability of watermark embedding and detection in time immediately comparable to the real music time of the original audio file that depends on the mpeg compression, while the end user/audience does not face any artifacts or delays hearing the watermarked audio file. Furthermore, it overcomes the disadvantage of algorithms operating in the PCMData domain to be vulnerable to compression/recompression attacks, as it places the watermark in the scale factors domain and not in the digitized sound audio data. The strength of our scheme, that allows it to be used with success in both authentication and copyright protection, relies on the fact that it gives to the users the enhanced capability their ownership of the audio file not to be accomplished simply by detecting the bit pattern that comprises the watermark itself, but by showing that the legal owner knows a hard to compute property of the watermark.

Keywords: Audio watermarking, mpeg audio layer 3, hard instance generation, NP-completeness.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1061364

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1786

References:


[1] W. Bender, D. Gruhl, N. Morimoto and A. Lu, "Techniques for data hiding," IBM Systems Journal, Vol. 35, No. 3&4, pp. 313-336, 1996.
[2] L. Boney, A. Tewfic and K. Hamdy, "Digital watermarks for audio signals," IEEE Int. Conf. on Multimedia Computing and Systems, pp. 473-480, 1996.
[3] M. Arnold and S. Kanka, "MP3 robust Audio Watermarking," DFG VIIDII Watermarking Workshop 1999, Erlangen, Germany, 1999.
[4] V. Basia, I. Pitas and N. Nikolaidis, "Robust Audio Watermarking in the time-domain," IEEE Trans. on Multimedia, Vol. 3, No. 2, pp. 232-241, June 2001.
[5] J. Dittmann, M. Steinebach and R. Steinmetz, "Digital Watermarking for MPEG Audio Layer 2," Multimedia and Security Workshop at ACM Multimedia-99, Oct. 1999.
[6] L. Qiao and K. Nahrstedt, "Non-Invertible Watermarking Methods for MPEG Video and Audio," Multimedia and Security Workshop at ACM Multimedia-98, pp. 93-98, Sept. 1998.
[7] F. Petitcolas, "MP3Stego," Computer Laboratory, Cambridge, 1998.
[8] C.H. Papadimitriou, Computational Complexity. Addison-Wesley, 1994.
[9] M. Garey, and D. Johnson, Computers and Intractability, a guide to the theory of NP-completeness. W.H. Freeman and Company, 1979.
[10] P. Cheeseman, B. Kanefsky, and W. Taylor, "Where the really hard problems are," Int. Joint Conference on Artificial Intelligence, Vol. 1, pp. 331-337, 1991.
[11] B. Hayes, "Computing Science: Can't Get No Satisfaction," American Scientist, Mar.-Apr. 1997.
[12] S. Kirkpatrick and B. Selman, "Critical behavior in the satisfiability of random Boolean expressions," Science 264, pp 1297-1301, 1994.
[13] S. Armeni, D. Christodoulakis I. Kostopoulos, Y.C. Stamatiou and M. Xenos, "Proving copyright ownership using hard instances of computationally intractable problems," 8th Panhellenic Conference on Informatics, Nicosia, Cyprus, November 2001.
[14] D. K. Koukopoulos, Y. C. Stamatiou, "A Compressed-Domain Watermarking Algorithm for Mpeg Layer 3," Multimedia and Security Workshop at ACM Multimedia-01, pp. 7-10, Oct. 1999.
[15] J. Seok, J. Hong and J. Kim, "A Novel Audio Watermarking Algorithm for Copyright Protection of Digital Audio," ETRI Journal, Vol. 24, No. 3, pp. 181-189, June 2002.