TY - GEN
T1 - Binary codes for collusion-secure fingerprinting
AU - Cohen, Gérard
AU - Litsyn, Simon
AU - Zémor, Gilles
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.
PY - 2002
Y1 - 2002
N2 - We examine the problem of Collusion-Secure Fingerprinting in the case when marks are binary and coalitions are of size 2. We are motivated by two considerations, the pirates’ probablity of success (which must be non-zero, as was shown by Boneh and Shaw) on one hand, and decoding complexity on the other. We show how to minimize the pirates’ probability of success: but the associated decoding complexity is O(M2), where M is the number of users. Next we analyze the Boneh and Shaw replication strategy which features a higher probability of success for the pirates but a lower decoding complexity. There are two variations. In the case when the fingerprinting code is linear we show that the best codes are linear intersecting codes and that the decoding complexity drops to O(log2M). In the case when the fingerprinting code is allowed to be nonlinear, finding the best code amounts to finding the largest B2-sequence of binary vectors, an old combinatorial problem. In that case decoding complexity is intermediate, namely O(M).
AB - We examine the problem of Collusion-Secure Fingerprinting in the case when marks are binary and coalitions are of size 2. We are motivated by two considerations, the pirates’ probablity of success (which must be non-zero, as was shown by Boneh and Shaw) on one hand, and decoding complexity on the other. We show how to minimize the pirates’ probability of success: but the associated decoding complexity is O(M2), where M is the number of users. Next we analyze the Boneh and Shaw replication strategy which features a higher probability of success for the pirates but a lower decoding complexity. There are two variations. In the case when the fingerprinting code is linear we show that the best codes are linear intersecting codes and that the decoding complexity drops to O(log2M). In the case when the fingerprinting code is allowed to be nonlinear, finding the best code amounts to finding the largest B2-sequence of binary vectors, an old combinatorial problem. In that case decoding complexity is intermediate, namely O(M).
KW - B-sequence
KW - Collusion-resistant code
KW - Fingerprinting
KW - Intersecting code
KW - Watermarking
UR - http://www.scopus.com/inward/record.url?scp=33646836150&partnerID=8YFLogxK
U2 - 10.1007/3-540-45861-1_14
DO - 10.1007/3-540-45861-1_14
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:33646836150
SN - 3540433198
SN - 9783540433194
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 178
EP - 185
BT - Information Security and Cryptology - ICISC 2001 - 4th International Conference, Proceedings
A2 - Kim, Kwangjo
PB - Springer Verlag
T2 - 4th International Conference on Information Security and Cryptology, ICISC 2001
Y2 - 6 December 2001 through 7 December 2001
ER -