For DDH-based homomorphic secret sharing supporting compact evaluation of branching programs, can the inverse-polynomial evaluation error be eliminated or its running-time…
Statement
For DDH-based homomorphic secret sharing supporting compact evaluation of branching programs, can the inverse-polynomial evaluation error be eliminated or its running-time dependence improved, and can analogous results be obtained for three or more parties?
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.