Towards round-optimal secure multiparty computations: Multikey FHE without a CRS

Eunkyung Kim; Hyang Sook Lee; Jeongeun Park

doi:10.1007/978-3-319-93638-3_7

Towards round-optimal secure multiparty computations: Multikey FHE without a CRS

Eunkyung Kim, Hyang Sook Lee, Jeongeun Park

Department of Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

23 Scopus citations

Abstract

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

Original language	English
Title of host publication	Information Security and Privacy - 23rd Australasian Conference, ACISP 2018, Proceedings
Editors	Willy Susilo, Guomin Yang
Publisher	Springer Verlag
Pages	101-113
Number of pages	13
ISBN (Print)	9783319936376
DOIs	https://doi.org/10.1007/978-3-319-93638-3_7
State	Published - 2018
Event	23rd Australasian Conference on Information Security and Privacy, ACISP 2018 - Wollongong, Australia Duration: 11 Jul 2018 → 13 Jul 2018

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	10946 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	23rd Australasian Conference on Information Security and Privacy, ACISP 2018
Country/Territory	Australia
City	Wollongong
Period	11/07/18 → 13/07/18

Bibliographical note

Funding Information:
Acknowledgement. The authors were supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT and Future Planning (Grant Number: 2015R1A2A1A15054564)

Publisher Copyright:
© Springer International Publishing AG, part of Springer Nature 2018.

Access to Document

10.1007/978-3-319-93638-3_7

Cite this

Kim, E., Lee, H. S., & Park, J. (2018). Towards round-optimal secure multiparty computations: Multikey FHE without a CRS. In W. Susilo, & G. Yang (Eds.), Information Security and Privacy - 23rd Australasian Conference, ACISP 2018, Proceedings (pp. 101-113). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10946 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-93638-3_7

Kim, Eunkyung ; Lee, Hyang Sook ; Park, Jeongeun. / Towards round-optimal secure multiparty computations : Multikey FHE without a CRS. Information Security and Privacy - 23rd Australasian Conference, ACISP 2018, Proceedings. editor / Willy Susilo ; Guomin Yang. Springer Verlag, 2018. pp. 101-113 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{219d7d8d6a634db286c6f155d2451200,

title = "Towards round-optimal secure multiparty computations: Multikey FHE without a CRS",

abstract = "Multikey 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.",

author = "Eunkyung Kim and Lee, {Hyang Sook} and Jeongeun Park",

note = "Funding Information: Acknowledgement. The authors were supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT and Future Planning (Grant Number: 2015R1A2A1A15054564) Publisher Copyright: {\textcopyright} Springer International Publishing AG, part of Springer Nature 2018.; 23rd Australasian Conference on Information Security and Privacy, ACISP 2018 ; Conference date: 11-07-2018 Through 13-07-2018",

year = "2018",

doi = "10.1007/978-3-319-93638-3_7",

language = "English",

isbn = "9783319936376",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "101--113",

editor = "Willy Susilo and Guomin Yang",

booktitle = "Information Security and Privacy - 23rd Australasian Conference, ACISP 2018, Proceedings",

}

Kim, E, Lee, HS & Park, J 2018, Towards round-optimal secure multiparty computations: Multikey FHE without a CRS. in W Susilo & G Yang (eds), Information Security and Privacy - 23rd Australasian Conference, ACISP 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10946 LNCS, Springer Verlag, pp. 101-113, 23rd Australasian Conference on Information Security and Privacy, ACISP 2018, Wollongong, Australia, 11/07/18. https://doi.org/10.1007/978-3-319-93638-3_7

Towards round-optimal secure multiparty computations: Multikey FHE without a CRS. / Kim, Eunkyung; Lee, Hyang Sook; Park, Jeongeun.
Information Security and Privacy - 23rd Australasian Conference, ACISP 2018, Proceedings. ed. / Willy Susilo; Guomin Yang. Springer Verlag, 2018. p. 101-113 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10946 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Towards round-optimal secure multiparty computations

T2 - 23rd Australasian Conference on Information Security and Privacy, ACISP 2018

AU - Kim, Eunkyung

AU - Lee, Hyang Sook

AU - Park, Jeongeun

N1 - Funding Information: Acknowledgement. The authors were supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT and Future Planning (Grant Number: 2015R1A2A1A15054564) Publisher Copyright: © Springer International Publishing AG, part of Springer Nature 2018.

PY - 2018

Y1 - 2018

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

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

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

U2 - 10.1007/978-3-319-93638-3_7

DO - 10.1007/978-3-319-93638-3_7

M3 - Conference contribution

AN - SCOPUS:85049794054

SN - 9783319936376

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 101

EP - 113

BT - Information Security and Privacy - 23rd Australasian Conference, ACISP 2018, Proceedings

A2 - Susilo, Willy

A2 - Yang, Guomin

PB - Springer Verlag

Y2 - 11 July 2018 through 13 July 2018

ER -

Kim E, Lee HS, Park J. Towards round-optimal secure multiparty computations: Multikey FHE without a CRS. In Susilo W, Yang G, editors, Information Security and Privacy - 23rd Australasian Conference, ACISP 2018, Proceedings. Springer Verlag. 2018. p. 101-113. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-93638-3_7

Towards round-optimal secure multiparty computations: Multikey FHE without a CRS

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Fingerprint

Cite this