FINALLY: A Multi-Key FHE Scheme Based on NTRU and LWE
Open Access
- 7 October 2024
- journal article
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 1 (3)
Abstract
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.Keywords
Funding Information
- Research Foundation - Flanders, Oddysseus Project (GOH9718N)
- Cyber Security Research Flanders, Flemish Government (VR20192203)
This publication has 21 references indexed in Scilit:
- Towards Practical Multi-key TFHE: Parallelizable, Key-Compatible, Quasi-linear Complexity2024
- A Practical TFHE-Based Multi-Key Homomorphic Encryption with Linear Complexity and Low Noise Growth2024
- FINAL: Faster FHE Instantiated with NTRU and LWE2022
- NTRU Fatigue: How Stretched is Overstretched?2021
- Multi-Key Homomorphic Encryption from TFHE2019
- On the Security of Multikey Homomorphic Encryption2019
- A Subfield Lattice Attack on Overstretched NTRU Assumptions2016
- Two Round Multiparty Computation via Multi-key FHE2016
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second2015
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE2012