ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let cc be the coalition size, let zz denote the number of colluders receiving symbol 11, let y∈{0,1}y\in\{0,1\} be the pirate output, and let pp be the bias parameter. Define the score function

g(z,y,p)={ln⁡(1−zc)−ln⁡(1−p)(y=0)ln⁡(zc)−ln⁡(p)(y=1)g(z, y, p) = \begin{cases} \ln(1 - \frac{z}{c}) - \ln(1 - p) \quad & (y = 0) \\ \ln(\frac{z}{c}) - \ln(p) & (y = 1) \end{cases}

Universal joint-decoder conjecture. The joint log-likelihood decoder against the interleaving attack, using this score function, works against arbitrary attacks and asymptotically achieves the joint capacity of the uninformed fingerprinting game. The claim concerns a universal decoder whose optimality against arbitrary attacks is not proved in the paper and is left as an open problem.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.