False positive probabilities in q-ary Tardos codes: comparison of attacks

Simone, Antonino; Škorić, Boris

doi:10.1007/s10623-014-9937-5

Cited by 2 publications

(4 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Each curve corresponds to tracing Z from very low (lots of users get accused: high FP and low FN) to very high (almost nobody gets accused: low FP and high FN). The order of the curves is consistent with [24]. For the given choice of parameters, the plotted Z lies outside the Gaussian regime; hence MinV is the strongest attack andμ-min is a very poor attack.…”

Section: Numerical Resultssupporting

confidence: 69%

“…However, these arguments are not very precise. In [22][23][24] an in-depth analytical and numerical investigation of the Gaussian approximation was given in the RDM case. The approach is based on the convolution rule for characteristic functions, and on a way to express the false accusation probability as a power series expansion in the small parameter 1/ √ m. This was dubbed 'the CSE method' (Convolution and Series Expansion).…”

Section: Exact Computation Of the Error Rates Of Tardos Codesmentioning

confidence: 99%

“…The work of [22,23] showed, for various parameter settings and attack strategies, how the false positive probability has a transition from Gaussian behavior in the central region to worse-than-Gaussian power-law behavior outside the center. In [24] an overview was given of FP error rates for the main known attack strategies in the RDM, for a large part of the parameter space. Until now the CSE method has not been applied to accusation probabilities of guilty users.…”

Section: Exact Computation Of the Error Rates Of Tardos Codesmentioning

confidence: 99%

See 2 more Smart Citations

False Negative probabilities in Tardos codes

Simone

Škorić

2013

Des. Codes Cryptogr.

Self Cite

View full text Add to dashboard Cite

Forensic watermarking is the application of digital watermarks for the purpose of tracing unauthorized redistribution of content. The most powerful type of attack on watermarks is the collusion attack, in which multiple users compare their differently watermarked versions of the same content. Collusionresistant codes have been developed against these attacks. One of the most famous such codes is the Tardos code. It has the asymptotically optimal property that it can resist c attackers with a code of length proportional to c 2 .Determining error rates for the Tardos code and its various extensions and generalizations turns out to be a nontrivial problem. In recent work we developed an approach called the Convolution and Series Expansion (CSE) method to accurately compute false positive accusation probabilities. In this paper we extend the CSE method in order to make it possible to compute false negative accusation probabilities as well.

show abstract

Section: Numerical Resultssupporting

confidence: 69%

Section: Exact Computation Of the Error Rates Of Tardos Codesmentioning

confidence: 99%

Section: Exact Computation Of the Error Rates Of Tardos Codesmentioning

confidence: 99%

See 1 more Smart Citation

False Negative probabilities in Tardos codes

Simone

Škorić

2013

Des. Codes Cryptogr.

Self Cite

View full text Add to dashboard Cite

show abstract

“…In the case of position-symmetric attacks, the statistical behaviour of a score system can be understood by studying the probability distribution of single-position scores [31]- [33]. To this end we have derived the innocent-user singleposition distribution for the Oosterwijk et al score, the Laarhoven score and our new score.…”

Section: Discussionmentioning

confidence: 99%

Tally-Based Simple Decoders for Traitor Tracing and Group Testing

Škorić

2015

IEEE Trans.Inform.Forensic Secur.

View full text Add to dashboard Cite

The topic of this paper is collusion resistant watermarking, also known as traitor tracing, in particular bias-based traitor tracing codes as introduced by Tardos. The past years have seen an ongoing effort to construct efficient highperformance decoders for these codes. In this paper we construct a score system from the Neyman-Pearson hypothesis test (which is known to be the most powerful test possible) into which we feed more evidence than in previous work, in particular the symbol tallies for all columns of the code matrix. As far as we know, until now simple decoders using Neyman-Pearson have taken into consideration only the codeword of a single user, namely the user under scrutiny. The Neyman-Pearson score needs as input the attack strategy of the colluders, which typically is not known to the tracer. We insert the interleaving attack, which plays a very special role in the theory of bias-based traitor tracing by virtue of being part of the asymptotic (i.e., large coalition size) saddle-point solution. The score system obtained in this way is universal: effective not only against the interleaving attack, but against all other attack strategies as well. Our score function for one user depends on the other users' codewords in a very simple way through the symbol tallies, which are easily computed. We present bounds on the false positive probability and show receiver operating characteristic curves obtained from simulations. We investigate the probability distribution of the score. Finally, we apply our construction to the area of (medical) group testing, which is related to traitor tracing.

show abstract

False positive probabilities in q-ary Tardos codes: comparison of attacks

Cited by 2 publications

References 25 publications

False Negative probabilities in Tardos codes

False Negative probabilities in Tardos codes

Tally-Based Simple Decoders for Traitor Tracing and Group Testing

Contact Info

Product

Resources

About