#### DMCA

## Optimal Probabilistic Fingerprint Codes (2003)

Venue: | In 35th ACM STOC |

Citations: | 99 - 2 self |

### Citations

353 | Collusion-secure fingerprinting for digital data
- Boneh, Shaw
- 1998
(Show Context)
Citation Context ...nyi.hu Abstract We construct binary codes for fingerprinting. Our codes for n users that are #-secure against c pirates have length O(c 2 log(n/#)). This improves the codes proposed by Boneh and Shaw =-=[3]-=- whose length is approximately the square of this length. Our codes use the full power of randomization. This improvement carries over to works using the BonehShaw code as a primitive, e.g. to the dyn... |

172 | Tracing traitors,”
- Chor, Fiat, et al.
- 1994
(Show Context)
Citation Context ...see for example Kilian et al. [8] for a model where the fingerprint can alter the document but the distance should be bounded. IPP or identifiable parent property codes were introduced by Chor et al. =-=[4]-=-. These codes must work only against pirates who must output a pirated copy such that for any i the ith position of the pirated copy is identical to the ith position of a legitimate copy the pirates h... |

71 | Combinatorial properties of frameproof and traceability codes
- Staddon, Stinson, et al.
- 2001
(Show Context)
Citation Context ...r any i the ith position of the pirated copy is identical to the ith position of a legitimate copy the pirates have access to. These codes and the related traitor tracing are widely studied, see e.g. =-=[2, 9, 13, 14]-=-. As we have already mentioned, this more restrictive assumption seems to be too strong in many fingerprinting applications. The unreadable digit model seems to be a more appropriate intermediate mode... |

62 | Dynamic Traitor Tracing
- Fiat, Tassa
- 2001
(Show Context)
Citation Context ...Boneh-Shaw codes. The length of our codes presented in the next section is approximately the square root of the length of the BonehShaw codes. Dynamic traitor tracing was introduced by Fiat and Tassa =-=[6]-=-. This was originally a deterministic model requiring high alphabet size, but Tamir Tassa [16] introduced a more e#cient probabilistic version. Tassa uses the BonehShaw code as a primitive in his sche... |

40 |
Fingerprinting long forgiving messages
- Blakley, Meadows, et al.
- 1986
(Show Context)
Citation Context ...ive codewords (the ith column of the submatrix). 1.3 Earlier results Fingerprinting was first studied by Wagner [18]. Fingerprinting resilient against pirate coalitions were studied by Blakley et al. =-=[1]-=-. Many di#erent models for fingerprinting are studied in the literature, see for example Kilian et al. [8] for a model where the fingerprint can alter the document but the distance should be bounded. ... |

36 | Optimum traitor tracing and asymmetric schemes
- Kurosawa, Desmedt
- 1998
(Show Context)
Citation Context ...r any i the ith position of the pirated copy is identical to the ith position of a legitimate copy the pirates have access to. These codes and the related traitor tracing are widely studied, see e.g. =-=[2, 9, 13, 14]-=-. As we have already mentioned, this more restrictive assumption seems to be too strong in many fingerprinting applications. The unreadable digit model seems to be a more appropriate intermediate mode... |

27 | Resistance of digital watermarks to collusive attacks
- Kilian, Leighton, et al.
- 1998
(Show Context)
Citation Context ...agner [18]. Fingerprinting resilient against pirate coalitions were studied by Blakley et al. [1]. Many di#erent models for fingerprinting are studied in the literature, see for example Kilian et al. =-=[8]-=- for a model where the fingerprint can alter the document but the distance should be bounded. IPP or identifiable parent property codes were introduced by Chor et al. [4]. These codes must work only a... |

25 |
Improved Boneh-Shaw content fingerprinting
- Yacobi
- 2001
(Show Context)
Citation Context ...ructed #-secure fingerprint codes of length m = O(c 4 log(1/#) log(n/#)) for n users. In follow-up works Lindkvist [10] made minor improvement on the length not e#ecting the asymptotics, while Yacobi =-=[17]-=- designed a very e#cient implementation of the Boneh-Shaw codes. The length of our codes presented in the next section is approximately the square root of the length of the BonehShaw codes. Dynamic tr... |

23 | Sequential traitor tracing
- Safavi-Naini, Wang
(Show Context)
Citation Context ...r any i the ith position of the pirated copy is identical to the ith position of a legitimate copy the pirates have access to. These codes and the related traitor tracing are widely studied, see e.g. =-=[2, 9, 13, 14]-=-. As we have already mentioned, this more restrictive assumption seems to be too strong in many fingerprinting applications. The unreadable digit model seems to be a more appropriate intermediate mode... |

17 | Lower bounds for collusion-secure fingerprinting,”
- Peikert, Shelat, et al.
- 2003
(Show Context)
Citation Context ...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, Shelat, and Smith =-=[11]-=- 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 d... |

16 |
Error- and Collusion-Secure Fingerprinting for Digital Data.
- Guth, Pfitzmann
- 2000
(Show Context)
Citation Context ...heorem. Putting the last two displayed equations together we get m = # c 2 log(1/#)) with the constant in the# notation depending only on a, as required. 6 Concluding remarks 1. Guth and Pfitzmann in =-=[7]-=- introduce a relaxation of the marking condition. They assume the following relaxed version of the marking condition: At any position where the codeword of all pirates agree the pirates still have a #... |

11 | Guessing secrets
- Chung, Graham, et al.
- 2001
(Show Context)
Citation Context ...ith the pirated copy y = X . Thus no deterministic algorithm can accuse any of them for producing this copy without risking to accuse an innocent user. (In a related model Chung, Graham, and Leighton =-=[5] get aroun-=-d this problem by accepting accusations of the form "two out of these three players are guilty" and even more complicated accusations for larger coalitions. But even in the model they study ... |

9 |
An E±cient Public Key Traitor Tracing Scheme, manuscript, full-version of [BF99
- Boneh, Franklin
- 2001
(Show Context)
Citation Context |

9 |
Probability Theory, North{Holland Series in Applied
- Renyi
- 1970
(Show Context)
Citation Context ...e are thus back at a linear bound. The correct choice of the distance measure is the higher order Renyi divergence. This esoteric version of informational divergence was introduced by Alfred Renyi in =-=[12]-=-. It has seldom been used since. Again, we have to measure Renyi divergence from a common target distribution #(X) that is obtained by the coalition of all c players by a similar bias [c]-strategy. Re... |

9 | Low Bandwidth Dynamic Traitor Tracing Schemes
- Tassa
- 2005
(Show Context)
Citation Context ...uare of this length. Our codes use the full power of randomization. This improvement carries over to works using the BonehShaw code as a primitive, e.g. to the dynamic traitor tracing scheme of Tassa =-=[16]-=-. 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 independe... |

2 |
Fingerprinting digital documents, Linkoping
- Lindkvist
- 1999
(Show Context)
Citation Context ... are #-secure against coalitions of any size. Against coalitions of size csthey constructed #-secure fingerprint codes of length m = O(c 4 log(1/#) log(n/#)) for n users. In follow-up works Lindkvist =-=[10]-=- made minor improvement on the length not e#ecting the asymptotics, while Yacobi [17] designed a very e#cient implementation of the Boneh-Shaw codes. The length of our codes presented in the next sect... |