FINALLY: A Multi-Key FHE Scheme Based on NTRU and LWE

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.

Authors

Institutions

Publication Details

Journal
IACR Communications in Cryptology
Published
2024-10-07
DOI
https://doi.org/10.62056/aebn-4c2h
Citations
4
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
1.39

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

FINALLY: A Multi-Key FHE Scheme Based on NTRU and LWE

Jeongeun Park, Barry Van Leeuwen, Oliver Zajonc
4 citations
IACR Communications in Cryptology
Cryptography and Data Security
1.39
article

FINALLY: A Multi-Key FHE Scheme Based on NTRU and LWE

Jeongeun Park, Barry Van Leeuwen, Oliver Zajonc
article en
4 citations

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.

IACR Communications in Cryptology
Norwegian University of Science and Technology (NO), KU Leuven (BE)
Vlaamse Overheid, Fonds Wetenschappelijk Onderzoek, Vlaamse regering
Openalex Percentile: Top 15%
Cryptography and Data Security
1.39
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

FINALLY: A Multi-Key FHE Scheme Based on NTRU and LWE — Jeongeun Park, Barry Van Leeuwen, et al. · IACR Communications in Cryptology (2024) | TGRS Research Map | TGRS