ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let X,Y,ZX,Y,Z be jointly distributed random variables, and let S(X:Y∣∣Z)S(X:Y||Z) denote the secret-key rate and I(X:Y↓Z)I(X:Y \downarrow Z) the intrinsic information. The bound-secrecy conjecture. There exists a distribution PXYZP_{XYZ} such that

I(X:Y↓Z)>0butS(X:Y∣∣Z)=0.I(X:Y \downarrow Z)>0 \quad\text{but}\quad S(X:Y||Z)=0.

Such a distribution would exhibit secrecy between Alice and Bob that cannot be extracted as a secret key. The paper discusses bound secrecy as a significant open problem and notes that evidence for its existence would imply that the reduced-intrinsic-information equality conjecture is false.

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.