ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let f(p)f(p) be a symmetric pdf, and let θσ∗\theta_\sigma^* denote the Class-B collusion parameter for [...].[...]. For collusion size cc, write RsimpleB(c)R_{\text{simple}}^{B}(c) and RsimpleC(c)R_{\text{simple}}^{C}(c) for the achievable simple-decoder rates under the worst Class-B and Class-C attacks, respectively. Class-B and Class-C symmetry conjecture. For a symmetric f(p)f(p), the Class-C worst collusion attack belongs to the Class-B subset:

θσ∗=1−θc−σ∗,∀σ∈[c],\theta_\sigma^* = 1-\theta_{c-\sigma}^*,\qquad \forall \sigma\in[c],

and

RsimpleB(c)=RsimpleC(c).R_{\text{simple}}^{B}(c)=R_{\text{simple}}^{C}(c).

The paper gives no proof and bases this claim on numerical optimization for collusion sizes up to 1515; it asserts equality of the worst attacks' rates for symmetric distributions.

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.