Renner–Wolf conjecture on reduced intrinsic information and secret-key rate
Let be a probability distribution. The Renner–Wolf conjecture.
The reduced intrinsic information is a known upper bound on the secret-key rate and can be strictly smaller than the intrinsic information. Equality would give a simple distribution-based characterization of the secret-key rate; the paper presents this as an open problem.
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.