ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (S,Y,Z)(S,Y,Z) be jointly distributed random variables. Write UI(S;Y\Z)UI(S;Y\backslash Z) for unique information of YY about SS relative to ZZ, and let S↔ ⁣(S;Y ⁣∣Z)S_{\leftrightarrow}\!\left({S};{Y}\!\left|{Z} \right. \right) denote the two-way secret key rate.

Unique information lower-bound conjecture. The unique information lower bounds the two-way secret key rate:

UI(S;Y\Z)≤S↔ ⁣(S;Y ⁣∣Z).UI(S;Y\backslash Z) \le S_{\leftrightarrow}\!\left({S};{Y}\!\left|{Z} \right. \right).

The conjecture would identify unique information as a lower bound complementary to the known upper bounds on the two-way secret key rate. The paper notes that unique information is not generally an upper bound on the two-way rate, while the proposed lower-bound direction remains open.

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.