
Practical and Efficient MPC from FHE, without ZKPoKs
This IACR eprint paper by Cong, Smart, Tanguy and Walter (Zama) shows how to eliminate Zero-Knowledge Proofs-of-Knowledge from the FHE-based malicious-secure MPC protocol of Smart (IMA, 2023), simplifying and modularizing its security proof. It introduces a formal security notion for "encrypted PRF" functionality within FHE schemes and proves the Deo et al. (CCS 2025) construction secure under this model, yielding a more practical and efficient MPC-from-FHE protocol.
TL;DR New FHE-based malicious-secure MPC protocol drops ZKPoKs by formalizing and proving secure an "encrypted PRF" primitive.
Organisations named here
- Deo et al. encrypted PRF construction (CCS 2025)
- Smart MPC protocol (IMA 2023)
Technologies named here
- FHE scheme with encrypted PRF functionality
- Fully Homomorphic Encryption
- Multi-Party Computation
Techniques named here
- FHE-based static-malicious-secure MPC protocol
- Encrypted PRF security formalization
Related in other

Rerandomizable Garbling for Arithmetic Circuits

