Show simple item record

dc.contributor.authorLópez-Alt, Adriana
dc.contributor.authorTromer, Eran
dc.contributor.authorVaikuntanathan, Vinod
dc.date.accessioned2021-12-15T22:41:22Z
dc.date.available2021-10-27T20:09:53Z
dc.date.available2021-12-15T22:41:22Z
dc.date.issued2017
dc.identifier.issn1095-7111
dc.identifier.urihttps://hdl.handle.net/1721.1/134927.2
dc.description.abstractCopyright © by SIAM. 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.en_US
dc.description.sponsorshipDARPA award (FA8750-11-2-0225)en_US
dc.description.sponsorshipARO (W911NF-15-C-0236)en_US
dc.description.sponsorshipNSF award (CNS-1445424)en_US
dc.description.sponsorshipNSF award (CCF-1423306)en_US
dc.description.sponsorshipDARPA award (FA8750-11-2-0225)en_US
dc.language.isoen
dc.publisherSociety for Industrial & Applied Mathematics (SIAM)en_US
dc.relation.isversionofhttps://dx.doi.org/10.1137/14100124Xen_US
dc.rightsArticle is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.en_US
dc.sourceSIAMen_US
dc.titleMultikey Fully Homomorphic Encryption and Applicationsen_US
dc.typeArticleen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.relation.journalSIAM Journal on Computingen_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dc.date.updated2019-07-09T15:53:26Z
dspace.orderedauthorsLópez-Alt, A; Tromer, E; Vaikuntanathan, Ven_US
dspace.date.submission2019-07-09T15:53:28Z
mit.journal.volume46en_US
mit.journal.issue6en_US
mit.metadata.statusPublication Information Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

VersionItemDateSummary

*Selected version