Independence-inducing binarizations for the three-symbol distribution
Statement
Let have the distribution specified in the source, with determined by and according to the displayed table. For , let be any binary output of a binarization channel applied to , and let be an output obtained by processing . The independence-inducing binarization conjecture. For every and every , there exists such that
This strengthens the preceding bound-secrecy reduction by disallowing Alice from binarizing. The source presents it as a possible route to proving bound secrecy for the displayed distribution.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.