What are the minimal computational assumptions under which additive random- ized encodings can be constructed?
Statement
What are the minimal computational assumptions under which additive random- ized encodings can be constructed? Additive Randomized Encodings: Part 2 Nir Bitansky (joint work with Saroja Erabeli and Rachit Garg) Better Garbling via Algebraic Assumptions Rachel Lin (joint work with Marshall Ball, Yuval Ishai, Hanjun Li, and Tianren Liu)
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.