Multimedia content screening using a dual watermarking and fingerprinting system

ABSTRACT

We present a new dual watermarking and fingerprinting system, where initially all copies of a protected object are identically watermarked using a secret key, but individual detection keys are distinct. By knowing a detection key, an adversary cannot recreate the original content from the watermarked content. However, knowledge of any one detection key is sufficient for modifying the object so that a detector using that key would fail to detect the marks. Detectors using other detection keys would not be fooled, and such a modified object necessarily contains enough information about the broken detector key - the fingerprint. Our dual system limits the scope of possible attacks, when compared to classic fingerprinting systems. Under optimal attacks, the size of the collusion necessary to remove the marks without leaving a detectable fingerprint is superlinear in object size, whereas classic fingerprinting has a lower bound on collusion resistance that is approximately fourth root in object size. By using our scheme one can achieve collusion resistance of up to 900,000 users for a two hour high-definition video.

REFERENCES

• 1: N. Alon, J. H. Spencer, and P. Erd ös, "The Probabilistic Method," Wiley-Interscience series in Discrete Mathematics and Optimization. New York: Wiley, 1992.
• 2: R. J. Anderson and F. A. P. Petitcolas, "On the limits of steganography," IEEE Journal in Selected Areas in Communications, vol. 16, pp. 474--481, 1998.
• 3: Ross J. Anderson, Stretching the Limits of Steganography, Proceedings of the First International Workshop on Information Hiding, p.39-48, May 30-June 01, 1996
• 4: D. Boneh and J. Shaw. "Collusion secure fingerprinting for digital data," IEEE Transactions on Information Theory, vol. 44, pp. 1897--1905, 1998.
• 5: Dan Boneh , Matthew K. Franklin, An Efficient Public Key Traitor Tracing Scheme, Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology, p.338-353, August 15-19, 1999
• 6: Benny Chor , Amos Fiat , Moni Naor, Tracing Traitors, Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology, p.257-270, August 21-25, 1994
• 7: Scott Craver, On Public-Key Steganography in the Presence of an Active Warden, Proceedings of the Second International Workshop on Information Hiding, p.355-368, April 14-17, 1998
• 8: J. J. Eggers, J.K. Su, and B. Girod, "Public Key Watermarking By Eigenvectors of Linear Transforms," European Signal Processing Conference, vol. 3, 2000.
• 9: F. Ergun, J. Kilian, and R. Kumar, "A Note on the Limits of Collusion-Resistant Watermarks," Eurocrypt, 1999.
• 10: W. Feller, "An introduction to probability theory and its applications," New York: Wiley - Series in Probability and Mathematical Statistics, 1968.
• 11: Amos Fiat , Tamir Tassa, Dynamic Traitor Training, Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology, p.354-371, August 15-19, 1999
• 12: T. Furon and F. P. Duhamel, "Robustness of An Asymmetric Watermarking Method," IEEE International Conference on Image Processing, vol. III, pp. 21--24, 2000.
• 13: F. Hartung , B. Girod, Fast public-key watermarking of compressed video, Proceedings of the 1997 International Conference on Image Processing (ICIP '97) 3-Volume Set-Volume 1, p.528, October 26-29, 1997
• 14: Stefan Katzenbeisser , Fabien A. Petitcolas, Information Hiding Techniques for Steganography and Digital Watermarking, Artech House, Inc., Norwood, MA, 2000
• 15: Aggelos Kiayias , Moti Yung, Self Protecting Pirates and Black-Box Traitor Tracing, Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology, p.63-79, August 19-23, 2001
• 16: D. Kirovski and H. S. Malvar, "Robust spread-spectrum audio watermarking," IEEE International Conference on Acoustics, Speech, and Signal Processing, 1999.
• 17: Jean-Paul M. G. Linnartz , Marten van Dijk, Analysis of the Sensitivity Attack against Electronic Watermarks in Images, Proceedings of the Second International Workshop on Information Hiding, p.258-272, April 14-17, 1998
• 18: Rajeev Motwani , Prabhakar Raghavan, Randomized algorithms, Cambridge University Press, New York, NY, 1995
• 19: B. Pfitzmann and M. Waidner, "Anonymous Fingerprinting," Eurocrypt, vol. 1233, pp. 88--102, 1997.
• 20: William H. Press , Brian P. Flannery , Saul A. Teukolsky , William T. Vetterling, Numerical recipes in C: the art of scientific computing, Cambridge University Press, New York, NY, 1988
• 21: Recording Industry Association of America. See http://www.riaa.org.
• 22: Secure Digital Music Initiative. See http://www.sdmi.org.
• 23: G. J. Simmons, "Prisoners' Problem and the Subliminal Channel," Crypto, pp. 51--67, New York: Springer-Verlag, 1984.
• 24: Harry L. Van Trees, Detection, Estimation, and Modulation Theory: Radar-Sonar Signal Processing and Gaussian Signals in Noise, Krieger Publishing Co., Inc., Melbourne, FL, 1992
• 25: Yacov Yacobi, Improved Boneh-Shaw Content Fingerprinting, Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA, p.378-391, April 08-12, 2001