The polylogarithmic-party interleaved group-product hardness conjecture
Statement
Let be a non-abelian simple group, let be a constant, and let . The -party -tuple interleaved group product over is the problem of computing the interleaved product of the group elements in the tuple.
Polylogarithmic-party hardness conjecture. There is no protocol for the -party -tuple interleaved group product over with parties and communication .
This more concrete formulation appears in a false-commented-out portion of the source, so its status in the paper's active argument is unclear. The provided text does not indicate whether it has been resolved.
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.