43 search results - page 1 / 9 » Optimal probabilistic fingerprint codes |
STOC
2003
ACM
14 years 4 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
ICIP
2010
IEEE
13 years 2 months ago
2010
IEEE
In this paper, we present a novel approach for active fingerprinting of state of the art video codec H.264/AVC. Tardos probabilistic fingerprinting code is embedded in H.264/AVC v...
IH
2010
Springer
13 years 2 months ago
2010
Springer
In this article, we propose a new construction of probabilistic collusion-secure fingerprint codes against up to three pirates and give a theoretical security evaluation. Our pira...
ICASSP
2008
IEEE
13 years 11 months ago
2008
IEEE
Digital fingerprinting aims at protecting multimedia contents from illegal redistribution by embedding imperceptible fingerprints identifying the users. We propose two approache...
IH
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. This paper estimates the minimal length of a binary probabilistic traitor tracing code. We consider the code construction proposed by G. Tardos in 2003, with the symmetri...