The real summation function randomness conjecture
Statement
Let and let be the inputs of an -party computation, with denoting the relevant randomness measure when only the last party receives the summation. The real summation function conjecture.
The preceding achievability argument gives the upper bound using a uniformly random value in . The equality, and hence the matching lower bound, is the claimed unresolved part.
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.