Abstract
Digital watermark is an active research area that has received a considerable attention in multimedia applications. Copyright protection of digital contents, as one of the most important application of digital watermark, works by watermark verification. In traditional watermark authentication scheme, a prover exposed a watermark to be present in a digital data to the verifier. However, an attacker is able to spoil or remove the watermark entirely once classified information is known. Some of previous schemes proposed as solution haven’t achieved desirable result really. In this paper, we propose a secure watermark verification scheme based on commitment scheme and zero knowledge protocols in order to solve this problem. There will be no secret information that can be used for removing watermark is disclosed during the verification process. It has considerable advantages over previously proposed schemes in terms of security.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H. Kinoshita.: An Image Digital Signature System with ZKIP for the Graph Isomorphism Problem. Proc. IEEE Conf. Image Processing (ICIP96), vol.3. IEEE Press, Piscataway, N.J., (1996) 247–250.
K. Gopalakrishnan, N. Memon, P. Vora.: Protocols for Watermark Verification. Multimedia and Security, Workshop at ACM Multimedia. (1999) 91–94.
A. Adelsbach, A. R. Sadeghi, “Zero Knowledge Watermark Detection and Proof of Ownership,” Information Hiding: Fourth International Workshop, LNCS 2137, Springer Verlag. (2001) 273–287.
I. Cox, J. Kilian, T. Leighton, T. Shamoon.:Secure spread spectrum watermarking for multimedia.. IEEE Transactions on Image Processing, vol. 6. (1997) 1673–1687.
S. Craver.:Zero Knowledge Watermark Detection. Information Hiding: Third International Workshop, LNCS 1768, Springer-Verlag, (2000) 101–116.
S. Craver, S. Katzenbeisser, “Copyright Protection Protocols Based on Asymmetric Watermarking: The Ticket Concept,” to appear in Communications and Multimedia Security 2001.
D. R. Stinson.:Cryptography-Theory and practice. CRC Press, Boca Raton, Fla (1995)
B. Schneier.: Applied Cryptography: protocols, Algorithms, and Source Code in C. 2nd ed. New York: John Wiley and Sons (1996)
E. Fujisaki, T. Okamoto.:A practical and provably secure scheme for publicly verifiable secret sharing and its applications. Eurocrypt’98, LNCS 1403, Springer-Verlag, (1998) 88–100.
J. Camenisch, M. Michels,.:Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes. Eurocrypt’99, LNCS 1592, Springer-Verlag, (2000) 101–116.
I. Damgard, E. Fujisaki.:An Integer Commitment Scheme based on Groups with Hiding Order. Preliminary Version.
F. Boudot.:Efficient Proofs that a Committed Number Lies in an Interval. Eurocrypt’00, LNCS 1807, Springer-Verlag (2000) 431–444.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yongliang, L., Gao, W., Yao, H., Song, Y. (2002). Secure Watermark Verification Scheme. In: Chen, YC., Chang, LW., Hsu, CT. (eds) Advances in Multimedia Information Processing — PCM 2002. PCM 2002. Lecture Notes in Computer Science, vol 2532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36228-2_59
Download citation
DOI: https://doi.org/10.1007/3-540-36228-2_59
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00262-8
Online ISBN: 978-3-540-36228-9
eBook Packages: Springer Book Archive