Collusion-Secure Fingerprinting for Digital Data

This paper discusses methods for assigning code-words for the purpose of fingerprinting digital data, e.g., software, documents, music, and video. Fingerprinting consists of uniquely marking and registering each copy of the data. This marking allows a distributor to detect any unauthorized copy and trace it back to the user. This threat of detection will deter users from releasing unauthorized copies. A problem arises when users collude: for digital data, two different fingerprinted objects can be compared and the differences between them detected. Hence, a set of users can collude to detect the location of the fingerprint. They can then alter the fingerprint to mask their identities. We present a general fingerprinting solution which is secure in the context of collusion. In addition, we discuss methods for distributing fingerprinted data.

[1]  염흥렬,et al.  [서평]「Applied Cryptography」 , 1997 .

[2]  Birgit Pfitzmann,et al.  Anonymous Fingerprinting , 1997, EUROCRYPT.

[3]  Lawrence O'Gorman,et al.  Electronic marking and identification techniques to discourage document copying , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[4]  Amos Fiat,et al.  Tracing Traitors , 1994, CRYPTO.

[5]  Rafail Ostrovsky,et al.  Software protection and simulation on oblivious RAMs , 1996, JACM.

[6]  Douglas R. Stinson,et al.  Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes , 1998, SIAM J. Discret. Math..

[7]  Noga Alon,et al.  Construction Of Asymptotically Good Low-rate Error-correcting Codes Through Pseudo-random Graphs , 1991, Proceedings. 1991 IEEE International Symposium on Information Theory.

[8]  Germano Caronni.  Assuring Ownership Rights for Digital Images , 1995, VIS.

[9]  Bernd Meyer,et al.  Protocols for Collusion-Secure Asymmetric Fingerprinting (Extended Abstract) , 1997, STACS.

[10]  Proceedings of the 1983 IEEE Symposium on Security and Privacy, Oakland, California, USA, April 25-27, 1983 , 1983, IEEE Symposium on Security and Privacy.

[11]  Birgit Pfitzmann,et al.  Asymmetric fingerprinting for larger collusions , 1997, CCS '97.

[12]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[13]  P. Erdös,et al.  Families of finite sets in which no set is covered by the union ofr others , 1985 .

[14]  R. L. Fountain,et al.  The fingerprinted database , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.

[15]  Jacobus H. van Lint,et al.  Introduction to Coding Theory , 1982 .

[16]  Charles J. Colbourn,et al.  Turan-type problems in group testing, coding theory and cryptography , 1996 .

[17]  J. H. van Lint,et al.  Introduction to Coding Theory , 1982 .

[18]  Ingemar J. Cox,et al.  A Secure, Robust Watermark for Multimedia , 1996, Information Hiding.

[19]  S. Goldwasser.  The Search for Provably Secure Cryptosystems , 1990 .

[20]  K. Tanaka,et al.  Embedding secret information into a dithered multi-level image , 1990, IEEE Conference on Military Communications.

[21]  Ingemar J. Cox,et al.  A secure, imperceptible yet perceptually salient, spread spectrum watermark for multimedia , 1996, Southcon/96 Conference Record.

[22]  Noga Alon,et al.  Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs , 1992, IEEE Trans. Inf. Theory.

[23]  Catherine A. Meadows,et al.  Fingerprinting Long Forgiving Messages , 1985, CRYPTO.