A fingerprinting code is a set of codewords that are embedded in each copy of a digital object with the purpose of making each copy unique. If the fingerprinting code is c-secure with error, then the decoding of a pirate word created by a coalition of at most c dishonest users, will expose at least one of the guilty parties with probability 1-ϵ. The Boneh-Shaw fingerprinting codes are n-secure codes with ϵ<sub>B</sub> error, where n also denotes the number of authorized users. Unfortunately, the length the Boneh-Shaw codes should be of order O(n<sup>3</sup> log(n/ϵ<sub>B</sub>)), which is prohibitive for practical applications. In this paper, we prove that the Boneh-Shaw codes are (c<; n)-secure for lengths of order O(nc<sup>2</sup> log(n/ϵ<sub>B</sub>)). Moreover, in this paper it is also shown how to use these codes to construct binary fingerprinting codes of length L=O(c<sup>6</sup> log(c/ϵ) log n), with probability of error ϵ<;ϵ<sub>B</sub> and an identification algorithm of complexity poly(log n)=poly(L). These results improve in some aspects the best known schemes and with a much more simple construction.
[1]
Dan.
Collusion-Secure Fingerprinting for Digital Data
,
2002
.
[2]
Abhi Shelat,et al.
Lower bounds for collusion-secure fingerprinting
,
2003,
SODA '03.
[3]
Gábor Tardos,et al.
Optimal probabilistic fingerprint codes
,
2003,
STOC '03.
[4]
G. David Forney,et al.
Concatenated codes
,
2009,
Scholarpedia.
[5]
Hans Georg Schaathun,et al.
The Boneh-Shaw fingerprinting scheme is better than we thought
,
2006,
IEEE Transactions on Information Forensics and Security.
[6]
W. Hoeffding.
Probability Inequalities for sums of Bounded Random Variables
,
1963
.
[7]
S. G. Vladut,et al.
Algebraic-Geometric Codes
,
1991
.
[8]
Alexander Barg,et al.
Digital fingerprinting codes: problem statements, constructions, identification of traitors
,
2003,
IEEE Trans. Inf. Theory.
[9]
Venkatesan Guruswami,et al.
Improved decoding of Reed-Solomon and algebraic-geometry codes
,
1999,
IEEE Trans. Inf. Theory.