Asymptotic optimality of the interleaving attack for fingerprinting capacity
Statement
Let be the coalition size, let denote the fingerprinting capacity for two-class symbols, and let and be the optimal and interleaving-based attack distributions, respectively. Let and denote the corresponding random variables.
Asymptotic optimality conjecture. When , we have
and
The first assertion says that the numerical lower bound attributed to Amiri and Tardos is asymptotically tight; the latter assertions say that the interleaving attack is asymptotically optimal and that the optimal parameter distribution converges in distribution to the interleaving-based one. The paper presents these as conjectural asymptotic properties; the supplied text gives 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.