The binarization criterion for bound secrecy
Statement
Let be jointly distributed, and let and be binary outputs of arbitrary binary output channels applied to and . For , let denote independent copies and let be binary outputs of arbitrary binary output channels applied to and . The binarization criterion for bound secrecy. If
for every pair of binary output channels, then
for every and every pair of binary output channels on and .
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.