ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let R\opSR_{\op{S}} be the minimum communication rate required to achieve the secrecy capacity in the secret-key agreement model. A trusted helper is a user whose source is trusted and who is not initially active, a vocal active user communicates at strictly positive rate, and a source \RZi\RZ_i determines a source \RZj\RZ_j when H(\RZj∣\RZi)=0H(\RZ_j\mid\RZ_i)=0. Monotonicity conjecture. R\opSR_{\op{S}} does not increase under either of the following changes: (i) making a trusted helper active, provided that the helper's private source determines the private source of another active user; or (ii) forcing a vocal active user to be silent, provided that its private source is determined by that of another vocal user. These conjectures are proposed as possible improvements to the lower bound on communication complexity. The source says they would follow from the stronger MKS16 conjecture that private randomization does not decrease R\opSR_{\op{S}}, but does not establish them independently.

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.