Abstract
In the asymmetric watermarking problem, we wish to embed a signal in a piece of multimedia and later prove that we have done so, but without revealing information that can be used by an adversary to remove the signal later.
There have been several published solutions to this problem, which suffer from the twin problems of size and time complexity. We provide a protocol similar to the one described in [5], but with substantial improvements in time and space. Our protocol is non-interactive, and each exchange of information between the prover and verifier involves a smaller payload of data. The algorithm uses a form of matrix embedding with pseudo-random Gaussian matrices. Aside from an improvement in efficiency, it possesses other practical advantages over previous protocols.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adelsbach, A., Sadeghi, A.-R.: Zero-Knowledge Watermark Detection and Proof of Ownership. In: Information Hiding IV. LNCS, vol. 2137, pp. 273–288. Springer, Heidelberg (2001)
Anderson, R.J., Petitcolas, F.A.P.: On the limits of steganography. IEEE Journal of Selected Areas in Communications, special issue on Copyright and Privacy Protection (April 1998)
Craver, S., Katzenbeisser, S.: Security Analysis of Public-Key Watermarking Schemes. In: Proceedings of SPIE, Mathematics of Data/Image Coding, Compression and Encryption IV, vol. 4475, pp. 172–182 (July 2001)
Craver, S.: Zero Knowledge Watermarking. In: Information Hiding III. LNCS, vol. 1768, pp. 101–116. Springer, Heidelberg (2000)
Craver, S., Liu, B., Wolf, W.: An Implementation of, and Attacks on, Zero-Knowledge Watermarking. In: Information Hiding IV. LNCS, vol. 3200, pp. 1–12. Springer, Heidelberg (2004)
Craver, S.: The Return of Ambiguity Attacks. In: Proceedings of SPIE, Security and Watermarking of Multimedia Contents IV, pp. 252–259 (January 2002)
Cox, I., Miller, M., Bloom, J.: Digital Watermarking. Morgan Kaufmann, San Francisco (2002)
Fridrich, J., Soukal, D.: Matrix embedding for large payloads. In: Proceedings of SPIE, Security and Watermarking of Multimedia Contents VIII, pp. 6072–68 (January 2006)
Hartung, F.H., Su, J.K., Girod, B.: Spread spectrum watermarking: malicious attacks and counterattacks. In: Proceedings of SPIE, pp. 147–158, San Jose, CA (February 1999)
Hartung, F.H., Girod, B.: Fast Public-Key Watermarking of Compressed Video. In: Proceedings of IEEE International Conference on Speech and Signal Processing (1997)
Schneier, B.: Applied Cryptograpy: Protocols, Algorithms, and Source Code in C, 2nd edn. John Wiley and Sons, New York (1996)
Viega, J., Girouard, Z., Messier, M.: Secure Programming Cookbook. O’Reilly (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Craver, S. (2007). An Improved Asymmetric Watermarking System Using Matrix Embedding. In: Camenisch, J.L., Collberg, C.S., Johnson, N.F., Sallee, P. (eds) Information Hiding. IH 2006. Lecture Notes in Computer Science, vol 4437. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74124-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-74124-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74123-7
Online ISBN: 978-3-540-74124-4
eBook Packages: Computer ScienceComputer Science (R0)