Additive Randomized Encodings
Encodings in which each party’s local encoding is one group element and their sum reveals exactly the function output.
| Status | Statement | Tags |
|---|---|---|
|
Perfectly Correct Statistical ARE Statistical security with statistical correctness is settled by the source for every finite function. Perfect correctness is known in the computational setting and, in the statistical setting, only in a relaxed Las Vegas form where the evaluator may declare failure. 4 open |
Additive Randomized EncodingsShuffle Modelcharacterizationadaptation (ai) | |
|
Statistical Robust ARE The source asks whether all functions admit a statistically secure ARE, robust or non-robust, and strongly conjectures the answer is negative. The non-robust half was refuted: Bitansky, Erabelli, Garg and Ishai construct statistical AREs for all finite functions. The robust half is open, and is re-posed by that later work. 4 open |
Additive Randomized EncodingsRandomized Encodingscharacterization |
No matching items