TY - JOUR

T1 - Multikey fully homomorphic encryption and applications

AU - Lopez-Alt, Adriana

AU - Tromer, Eran

AU - Vaikuntanathan, Vinod

N1 - Publisher Copyright:
Copyright © by SIAM.

PY - 2017

Y1 - 2017

N2 - 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.

AB - 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.

KW - Cloud computing

KW - Fully homomorphic encryption

KW - Multiparty computation

KW - NTRU encryption

UR - http://www.scopus.com/inward/record.url?scp=85039967110&partnerID=8YFLogxK

U2 - 10.1137/14100124X

DO - 10.1137/14100124X

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85039967110

SN - 0097-5397

VL - 46

SP - 1827

EP - 1892

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 6

ER -