Paper 2024/1806 Original: eprint.iacr.org/2024/1806 ↗
Encrypted RAM Delegation: Homomorphic NIZKs, Malicious MPC with Optimal Communication Complexity, and more
Abstract
We construct fully-homomorphic NIZKs from a broader range of cryptographic assumptions, including LWE, $O(1)$-LIN, and DDH (without circular security assumptions). Prior to this work, homomorphic NIZKs were only known based on pairing-based techniques. A key ingredient that we develop in this work is a new notion of a partially-hiding succinct delegation system, that we call encrypted RAM (eRAM) delegation. In addition to homomorphic NIZKs, we show that eRAM delegation is also useful for turning a semi-malicious multiparty computation (MPC) protocol into a full maliciously secure protocol in a communication-complexity-preserving manner (i.e., malicious and semi-malicious protocols have identical asymptotic communication complexity). Prior MPC compilers with similar efficiency required strong non-falsifiable assumptions. Furthermore, eRAM delegation also is useful for designing composable zero-knowledge batch arguments and multi-hop homomorphic signatures with strong-context-hiding.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2025-09-26: last updated
- 2024-11-05: published
- Short URL
- https://ia.cr/2024/1806
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2024/1806,
author = {Abtin Afshar and Jiaqi Cheng and Rishab Goyal and Aayush Yadav and Saikumar Yadugiri},
title = {Encrypted RAM Delegation: Homomorphic NIZKs, Malicious MPC with Optimal Communication Complexity, and more},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1806},
year = {2024},
url = {https://eprint.iacr.org/2024/1806}
}