The bound-secrecy conjecture
The bound-secrecy conjecture
Let be jointly distributed random variables, and let denote the secret-key rate and the intrinsic information. The bound-secrecy conjecture. There exists a distribution such that
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.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
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).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.