An additive randomized encoding (ARE) is a new cryptographic notion introduced by Halevi et al. (CRYPTO 2023) that has connections to other cryptographic notions, such as non-interactive secure computation in the shuffle model and best-possible information-theoretic MPC. In this paper, focusing on information-theoretic security, we tackle some open problems left by Halevi et al., and obtain the following results:

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Negative Results on Information-Theoretic Additive Randomized Encodings

  • Keitaro Hiwatashi

摘要

An additive randomized encoding (ARE) is a new cryptographic notion introduced by Halevi et al. (CRYPTO 2023) that has connections to other cryptographic notions, such as non-interactive secure computation in the shuffle model and best-possible information-theoretic MPC. In this paper, focusing on information-theoretic security, we tackle some open problems left by Halevi et al., and obtain the following results: