ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk be the coalition size, let Ck,2C_{k,2} denote the fingerprinting capacity for two-class symbols, and let p∗{\mathbf p}^* and p∞{\mathbf p}^\infty be the optimal and interleaving-based attack distributions, respectively. Let pW∗p_W^* and pW∞p_W^\infty denote the corresponding random variables.

Asymptotic optimality conjecture. When k→∞k \rightarrow \infty, we have

Ck,2∼(k22ln⁡2)−1,C_{k,2} \sim (k^2 2\ln 2)^{-1}, p∗∼p∞,{\mathbf p}^* \sim {\mathbf p}^\infty,

and

pW∗→pW∞ in distribution.p_W^* \rightarrow p_W^\infty \textrm{ in distribution.}

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 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.