Non-interactive Watermark Detection for a Correlation-Based Watermarking Scheme
Cryptographic techniques have been deployed to securely prove the presence of a watermark in stego-data without disclosing any security critical information to the detecting party.
This paper presents a detailed practical construction and implementation results of a correlation-based non-blind watermarking scheme in the non-interactive zero-knowledge setting. We extensively describe the modifications and hurdles that had to be overcome to transform a well-known watermarking scheme – whose general detection principle is applied in many other known schemes – into a two-party setting where the critical detection input, i.e. the watermark vector and the original data is cryptographically concealed from the verifying party using a commitment scheme. Our prototype implementation is very efficient and is an evidence of the practical feasibility of zero-knowledge watermark detection.
KeywordsWatermark detection implementation zero-knowledge
- 1.Adelsbach, A., Sadeghi, A.R.: Zero-knowledge watermark detection and proof of ownership. In: IHW 2001. LNCS, vol. 2137, pp. 273–288. Springer, Germany (2001)Google Scholar
- 9.Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: Proceedings of the ACM CCS, pp. 62–73. ACM Press, New York (1993)Google Scholar
- 10.Rabin, M.O., Shallit, J.O.: Randomized Algorithms in Number Theory. Communications on Pure and Applied Mathematics 39, S239– S256 (1986)Google Scholar
- 11.Piva, A., Barni, M., Bartolini, F., Cappellini, V.: Dct-based watermark recovering without resorting to the uncorrupted original image. In: Proceedings of ICIP 1997, Santa Barbara, CA, USA, October 26-29, vol. I, pp. 520–523. IEEE, Los Alamitos (1997)Google Scholar
- 12.Adelsbach, A., Rohe, M., Sadeghi, A.R.: Full version of this paper (2005), http://www.prosec.rub.de/publications.html