Asymptotic optimality of the alternative payoff for parallel fingerprinting channels
Statement
Let be the number of TV channels, let be the coalition size, and let . Write for the original payoff and define the alternative payoff
Here is the vector of pirate outputs, records the assignment of pirates to the TV channels, and is the part of the code matrices accessible to the coalition. Asymptotic optimality conjecture. In the binary alphabet case,
with optimal strategies , , and
The conjecture asserts that the alternative payoff has the same asymptotic maximin value as the original multiple-channel payoff. The proposed strategies are the arcsine bias distribution, the interleaving attack, and an even allocation of pirates across channels; the source provides motivation but no resolution.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.