论文信息 - A Family of Collusion 2-Secure Codes

A Family of Collusion 2-Secure Codes

We present systematic strategy for collusions attacking a fingerprinting scheme. As a particular case, this strategy shows that linear codes are not good fingerprinting codes. Based on equidistant codes, we construct a family of fingerprinting codes in which the identification of guilty users can be efficiently done using minimum distance decoding.

Miguel Soriano | Josep Cotrina Navau | Marcel Fernandez

[1] Jean-Pierre Vilcot,et al. DOS optical switch for microwave optical links based applications , 2002 .

[2] Josep Domingo-Ferrer,et al. Short collusion-secure fingerprints based on dual binary Hamming codes , 2000 .

[3] Josep Domingo-Ferrer,et al. Simple collusion-secure fingerprinting schemes for images , 2000, Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540).

[4] Miguel Soriano,et al. Fingerprinting Concatenated Codes with Efficient Identification , 2002, ISC.

[5] Alexander Barg,et al. Digital fingerprinting codes: problem statements, constructions, identification of traitors , 2003, IEEE Trans. Inf. Theory.

[6] A. Bonisoli. Every equidistant linear code is a sequence of dual Hamming codes , 1984 .

[7] Dan Boneh,et al. Collusion-Secure Fingerprinting for Digital Data , 1998, IEEE Trans. Inf. Theory.