On the Fingerprinting Capacity Games for Arbitrary Alphabets and Their Asymptotics

Huang, Yen-Wei; Moulin, Pierre

doi:10.1109/tifs.2014.2338739

Cited by 15 publications

(22 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the saddle point the asymptotic rate equals the asymptotic capacity. The saddle point is the same point that was found by Huang and Moulin [21] for the mutual information minimax game. Thus, we have identified a simple decoder that asymptotically achieves capacity.…”

Section: B Contributionssupporting

confidence: 76%

“…It was shown by Huang and Moulin [21] that, in the large-c limit, the joint-decoder capacity and simpledecoder capacity coincide. Thus, asymptotically, an optimal simple decoder should automatically achieve capacity.…”

Section: Discussionmentioning

confidence: 98%

“…The tracer has to tune the bias distribution f p and at the same time the coalition has to find the best possible attack f y|m against the combination f p , h. This simultaneous counter-acting optimization leads to a saddle point solution forμ C /σ inn which is a minimum as a function of the attack strategy and a maximum as a function of f p . A similar analysis was done by Huang and Moulin [21] in the context of the q-ary fingerprinting capacity, abstracting away the exact suspicion function to be employed. They found the saddlepoint at (attack = interleaving, f p = Dirichlet with κ = 1 2 ), consistent with the asymptotic (c → ∞) fingerprinting capacity (q − 1)/(2c 2 ln q) known earlier [20].…”

Section: B Saddle Point Analysis For the Interleaving Score Functionmentioning

confidence: 91%

“…However, it turns out [19] that the suspicion function yields sub-optimal fingerprinting rates, i.e. rather far below the fingerprinting capacity [20], [21] and far below the best achieved dynamic code rate [22].…”

Section: Introductionmentioning

confidence: 96%

See 3 more Smart Citations

A Capacity-Achieving Simple Decoder for Bias-Based Traitor Tracing Schemes

Oosterwijk

Škorić

Doumen

2015

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Abstract-We investigate alternative suspicion functions for bias-based traitor tracing schemes, and present a practical construction of a simple decoder that attains capacity in the limit of large coalition size c.We derive optimal suspicion functions in both the RestrictedDigit Model and the Combined-Digit Model. These functions depend on information that is usually not available to the tracer -the attack strategy or the tallies of the symbols received by the colluders. We discuss how such results can be used in realistic contexts.We study several combinations of coalition attack strategy versus suspicion function optimized against some attack (another attack or the same). In many of these combinations the usual codelength scaling ∝ c 2 changes to a lower power of c, e.g. c 3/2 . We find that the interleaving strategy is an especially powerful attack. The suspicion function tailored against interleaving is the key ingredient of the capacity-achieving construction.

show abstract

Section: B Contributionssupporting

confidence: 76%

Section: Discussionmentioning

confidence: 98%

Section: B Saddle Point Analysis For the Interleaving Score Functionmentioning

confidence: 91%

Section: Introductionmentioning

confidence: 96%

See 2 more Smart Citations

A Capacity-Achieving Simple Decoder for Bias-Based Traitor Tracing Schemes

Oosterwijk

Škorić

Doumen

2015

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

show abstract

“…The Int attack has been proved [8] to minimize the achievable code rate for c → ∞, i.e. it is the best attack in the so-called 'joint decoder' setting.…”

Section: The Q-ary Tardos Codementioning

confidence: 99%

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

Simone

Škorić

2014

Des. Codes Cryptogr.

View full text Add to dashboard Cite

We investigate False Positive (FP) accusation probabilities for q-ary Tardos codes in the Restricted Digit Model. We employ a computation method recently introduced by us, to which we refer as Convolution and Series Expansion (CSE). We present a comparison of several collusion attacks on q-ary codes: majority voting, minority voting, Interleaving,μ-minimizing and Random Symbol (the q-ary equivalent of the Coin Flip strategy). The comparison is made by looking at the FP rate at approximately fixed False Negative rate. In nearly all cases we find that the strongest attack is either minority voting orμ-minimizing, depending on the exact setting of parameters such as alphabet size, code length, and coalition size.Furthermore, we present results on the convergence speed of the CSE method, and we show how FP rate computations for the Random Symbol strategy can be sped up by a precomputation step.

show abstract

Traitor Tracing

Furon

2022

Multimedia Security 1

View full text Add to dashboard Cite

On the Fingerprinting Capacity Games for Arbitrary Alphabets and Their Asymptotics

Cited by 15 publications

References 17 publications

A Capacity-Achieving Simple Decoder for Bias-Based Traitor Tracing Schemes

A Capacity-Achieving Simple Decoder for Bias-Based Traitor Tracing Schemes

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

Traitor Tracing

Contact Info

Product

Resources

About