An improvement of discrete Tardos fingerprinting codes

Abstract

It has been proven that the code lengths of Tardos's collusion-secure fingerprinting codes are of theoretically minimal order with respect to the number of adversarial users (pirates). However, the code lengths can be further reduced as some preceding studies have revealed. In this article we improve a recent discrete variant of Tardos's codes, and give a security proof of our codes under an assumption weaker than the original Marking Assumption. Our analysis shows that our codes have significantly shorter lengths than Tardos's codes. For example, when c = 8, our code length is about 4.94% of Tardos's code in a practical setting and about 4.62% in a certain limit case. Our code lengths for large c are asymptotically about 5.35% of Tardos's codes.Communicated by H. van Tilborg.A part of this work was presented at 17th Applied Algebra, Algebraic Algorithms, and Error Correcting Codes (AAECC-17),

High rate fingerprinting codes and the fingerprinting capacity

“…In particular all the papers [8,7,2,6,5] go through the code and the proof in [9] and optimize various parameters to improve various aspects of the code without fundamentally changing the basic structure of the code construction and the accusation algorithm. We are concerned here with improvements of the code length that translates directly to improved rates.…”

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

“…The original paper [2] was followed by a flurry of activity, e.g. improved analyses [3]- [8], code modifications [9]- [11], decoder modifications [12]- [14] and various generalizations [15]- [18]. The advantage of bias-based versus deterministic codes is that they can achieve the asymptotically optimal relationship ∝ c 2 between the sufficient code length and the coalition size c.…”

Asymptotic Fingerprinting Capacity in the Combined Digit Model

“…We have shown how the asymptotic capacity for the RDM [4] follows as a limiting case of the CDM. In the general case, C CDM q,∞ can be expressed as the solution of a min-max game (13) where the payoff function is the trace of the metric induced by the mapping γ from √ p α -space to √ g w -space. The CDM parameters r and t 1 , · · · , t q give rise to a constraint g = M h on g which prevents the application of the solution method of [4].…”

“…[3,5,9,10,11,13,14,16,17,18,19]), users are found to be innocent or guilty via an 'accusation sum', a sum of weighted persegment contributions, computed for each user separately. The analysis of achievable performance was greatly helped by the onset of an information-theoretic treatment of anti-collusion codes.…”