Paper 2026/2403
Practical and Efficient MPC from FHE, without ZKPoKs
, Zama, Zama, KU Leuven, Zama, ZamaAbstract
Fully Homomorphic Encryption (FHE) enables one to implement low-round and low-communication complexity Multi-Party Computation (MPC) which is secure in the static malicious corruption model. By expanding on an idea presented in the full version of the FHE-based MPC protocol of Smart (IMA, 2023), we show how to completely remove the need for Zero-Knowledge Proofs-of-Knowledge in that protocol. This simplification makes the final security proof of the MPC protocol much simpler, and more modular. The new protocol makes use of an FHE scheme with an encrypted PRF functionality, and in addition to our main result we formalize the security of such encrypted PRFs and prove the construction of Deo et al. (CCS 2025) secure in this model.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published by the IACR in CIC 2026
- Keywords
- Multi-Party ComputationFully Homomorphic Encryption
- Contact author(s)
-
kelong cong @ zama ai
nigel @ zama ai
titouan tanguy @ zama ai
michael walter @ zama ai - History
- 2026-10-08: approved
- 2026-10-07: received
- See all versions
- Short URL
- https://ia.cr/2026/2403
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2026/2403,
author = {Kelong Cong and Nigel P. Smart and Titouan Tanguy and MIchael Walter},
title = {Practical and Efficient {MPC} from {FHE}, without {ZKPoKs}},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/2403},
year = {2026},
url = {https://eprint.iacr.org/2026/2403}
}
