View : 224 Download: 0

Full metadata record

DC Field Value Language
dc.contributor.author이향숙-
dc.date.accessioned2020-04-06T16:30:06Z-
dc.date.available2020-04-06T16:30:06Z-
dc.date.issued2020-
dc.identifier.issn0129-0541-
dc.identifier.issn1793-6373-
dc.identifier.otherOAK-26680-
dc.identifier.urihttps://dspace.ewha.ac.kr/handle/2015.oak/253720-
dc.description.abstractMultikey fully homomorphic encryption (MFHE) allows homomorphic operations between ciphertexts encrypted under different keys. In applications for secure multiparty computation (MPC) protocols, MFHE can be more advantageous than usual fully homomorphic encryption (FHE) since users do not need to agree with a common public key before the computation when using MFHE. In EUROCRYPT 2016, Mukherjee and Wichs constructed a secure MPC protocol in only two rounds via MFHE which deals with a common random/reference string (CRS) in key generation. After then, Brakerski et al. replaced the role of CRS with the distributed setup for CRS calculation to form a four round secure MPC protocol. Thus, recent improvements in round complexity of MPC protocols have been made using MFHE. In this paper, we go further to obtain round-efficient and secure MPC protocols. The underlying MFHE schemes in previous works still involve the common value, CRS, it seems to weaken the power of using MFHE to allow users to independently generate their own keys. Therefore, we resolve the issue by constructing an MFHE scheme without CRS based on LWE assumption, and then we obtain a secure MPC protocol against semi-malicious security in three rounds. We also define a new security notion "multikey-CPA security" to prove that a multikey ciphertext cannot be decrypted unless all the secret keys are gathered and our scheme is multikey-CPA secure.-
dc.languageEnglish-
dc.publisherWORLD SCIENTIFIC PUBL CO PTE LTD-
dc.subjectMultikey FHE-
dc.subjectLWE assumption-
dc.subjectmultiparty computation-
dc.subjectlattice-
dc.titleTowards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS-
dc.typeArticle-
dc.relation.issue2-
dc.relation.volume31-
dc.relation.indexSCIE-
dc.relation.indexSCOPUS-
dc.relation.startpage157-
dc.relation.lastpage174-
dc.relation.journaltitleINTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE-
dc.identifier.doi10.1142/S012905412050001X-
dc.identifier.wosidWOS:000519710200001-
dc.author.googleKim, Eunkyung-
dc.author.googleLee, Hyang-Sook-
dc.author.googlePark, Jeongeun-
dc.contributor.scopusid이향숙(34870017000)-
dc.date.modifydate20200413113227-
Appears in Collections:
자연과학대학 > 수학전공 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE