The bound-secrecy conjecture

About 3 years old · traced to

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.

References

Primary source

Andrey Boris Khesin, Andrew Tung and Karthik Vedula, “New Properties of Intrinsic Information and Their Relation to Bound Secrecy”, arXiv:2308.09031 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.