### Optimal probabilistic fingerprint codesOptimal probabilistic fingerprint codes

Access Restriction
Subscribed

 Author Tardos, Gbor Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©2008 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Subject Keyword Fingerprint codes ♦ Collusion attack Abstract We construct binary codes for fingerprinting digital documents. Our codes for $\textit{n}$ users that are ε-secure against $\textit{c}$ pirates have length $O(c^{2}log(n/ε)).$ This improves the codes proposed by Boneh and Shaw [1998] whose length is approximately the square of this length. The improvement carries over to works using the Boneh--Shaw code as a primitive, for example, to the dynamic traitor tracing scheme of Tassa [2005]. By proving matching lower bounds we establish that the length of our codes is best within a constant factor for reasonable error probabilities. This lower bound generalizes the bound found independently by Peikert et al. [2003] that applies to a limited class of codes. Our results also imply that randomized fingerprint codes over a binary alphabet are as powerful as over an arbitrary alphabet and the equal strength of two distinct models for fingerprinting. ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 2008-05-01 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 55 Issue Number 2 Page Count 24 Starting Page 1 Ending Page 24

#### Open content in new tab

Source: ACM Digital Library