Robust Additive Randomized Encodings from IO and Pseudo-Non-linear Codes

ePrint Report: Robust Additive Randomized Encodings from IO and Pseudo-Non-linear Codes

Nir Bitansky, Sapir Freizeit

Additive randomized encodings (ARE), introduced by Halevi, Ishai, Kushilevitz, and Rabin (CRYPTO 2023), reduce the computation of a k-party function $f (x_1, . . . , x_k )$ to locally computing encodings $\hat{x}_i$ of each input xi and then adding them together over some Abelian group into an output encoding $\hat{y} = ∑ \hat{x}_i$, which reveals nothing but the result. In robust ARE (RARE) the …

computation computing crypto eprint report function input linear locally non party report