Multimedia IPP Codes with Efficient Tracing

TL;DR

This paper introduces a new class of multimedia identifiable parent property codes with more efficient tracing algorithms, provides constructions for optimal codes, and explores their combinatorial properties.

Contribution

It presents the binary strong multimedia identifiable parent property codes (binary $t$-SMIPPCs), a composition construction from $q$-ary codes, and new optimal code families with specific lengths and parameters.

Findings

More efficient tracing algorithm for binary $t$-SMIPPCs.

Infinite series of optimal $q$-ary $t$-SMIPPCs of length 2 for t=2,3.

Optimal $q$-ary $2$-SMIPPCs of length 3 for certain q values.

Abstract

Binary multimedia identifiable parent property codes (binary $t$-MIPPCs) are used in multimedia fingerprinting schemes where the identification of users taking part in the averaging collusion attack to illegally redistribute content is required. In this paper, we first introduce a binary strong multimedia identifiable parent property code (binary $t$-SMIPPC) whose tracing algorithm is more efficient than that of a binary $t$-MIPPC. Then a composition construction for binary $t$-SMIPPCs from $q$-ary $t$-SMIPPCs is provided. Several infinite series of optimal $q$-ary $t$-SMIPPCs of length $2$ with $t = 2, 3$ are derived from the relationships among $t$-SMIPPCs and other fingerprinting codes, such as $\overline{t}$-separable codes and $t$-MIPPCs. Finally, combinatorial properties of $q$-ary $2$-SMIPPCs of length $3$ are investigated, and optimal $q$-ary $2$-SMIPPCs of length $3$ with $q \equiv 0, 1, 2, 5 \pmod 6$ are constructed.