JOURNAL ARTICLE

Multikey Fully Homomorphic Encryption and Applications

Adriana López-AltEran TromerVinod Vaikuntanathan

Year: 2017 Journal:   SIAM Journal on Computing Vol: 46 (6)Pages: 1827-1892   Publisher: Society for Industrial and Applied Mathematics

Abstract

We propose a new notion of secure multiparty computation aided by a computationally powerful but untrusted “cloud” server. In this notion, on-the-fly multiparty computation (MPC), the cloud can noninteractively perform arbitrary dynamically chosen computations on data belonging to arbitrary dynamically chosen sets of users chosen. All users' input data and intermediate results are protected from snooping by the cloud as well as other users. This extends the standard notion of fully homomorphic encryption (FHE), where users can only enlist the cloud's help in evaluating functions on their own encrypted data. In on-the-fly MPC, each user is involved only when initially uploading his (encrypted) data to the cloud and in a final output decryption phase when outputs are revealed; the complexity of both is independent of the function being computed and the total number of users in the system. When users upload their data, they need not decide in advance which function will be computed, nor who they will compute with; they need only retroactively approve the eventually chosen functions and on whose data the functions were evaluated. This notion is qualitatively the best possible in minimizing interaction, since the users' interaction in the decryption stage is inevitable: we show that removing it would imply generic program obfuscation and is thus impossible. Our contributions are two-fold: (1) We define the new notion of multikey FHE, an enhanced FHE system which is capable of operating on inputs encrypted under multiple, unrelated keys. A ciphertext resulting from a multikey homomorphic evaluation can be jointly decrypted using the secret keys of all the users involved in the computation. We show how on-the-fly MPC can be achieved using any multikey FHE scheme. (2) We construct a multikey FHE scheme based on NTRU, a very efficient public-key encryption scheme proposed in the 1990s. It was previously not known how to make NTRU fully homomorphic even for a single party.

Keywords:
Homomorphic encryption Upload Computer science Cloud computing Encryption Obfuscation Ciphertext Functional encryption Computation Function (biology) Theoretical computer science Computer security Algorithm Operating system

Metrics

12
Cited By
0.46
FWCI (Field Weighted Citation Impact)
17
Refs
0.72
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Cryptography and Data Security
Physical Sciences →  Computer Science →  Artificial Intelligence
Complexity and Algorithms in Graphs
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Privacy-Preserving Technologies in Data
Physical Sciences →  Computer Science →  Artificial Intelligence

Related Documents

JOURNAL ARTICLE

Compressible Multikey and Multi-Identity Fully Homomorphic Encryption

Tongchen ShenFuqun WangKefei ChenZhonghua ShenRenjun Zhang

Journal:   Security and Communication Networks Year: 2021 Vol: 2021 Pages: 1-14
JOURNAL ARTICLE

Multikey Verifiable Homomorphic Encryption

Yi LuKeisuke HaraKeisuke Tanaka

Journal:   IEEE Access Year: 2022 Vol: 10 Pages: 84761-84775
BOOK-CHAPTER

On the Security of Multikey Homomorphic Encryption

Hyang-Sook LeeJeongeun Park

Lecture notes in computer science Year: 2019 Pages: 236-251
© 2026 ScienceGate Book Chapters — All rights reserved.