Key points are not available for this paper at this time.
Multi-key fully homomorphic encryption (MKFHE), a generalization of fully homomorphic encryption (FHE), enables a computation over encrypted data under multiple keys. The first MKFHE schemes were based on the NTRU primitive, however these early NTRU based FHE schemes were found to be insecure due to the problem of over-stretched parameters. Recently, in the case of standard (non-multi key) FHE a secure version, called FINAL, of NTRU has been found. In this work we extend FINAL to an MKFHE scheme, this allows us to benefit from some of the performance advantages provided by NTRU based primitives. Thus, our scheme provides competitive performance against current state-of-the-art multi-key TFHE, in particular reducing the computational complexity from quadratic to linear in the number of keys.
Building similarity graph...
Analyzing shared references across papers
Loading...
IACR Communications in Cryptology
KU Leuven
Norwegian University of Science and Technology
Add This Paper to Your Research Feed
Any time a new paper drops it will be there.
Park et al. (Mon,) studied this question.