Efficient SMC Protocol Based on Multi-Bit Fully Homomorphic Encryption

Aiming at the problems of large ciphertext size and low efficiency in the current secure multi-party computation (SMC) protocol based on fully homomorphic encryption (FHE), the paper proves that the fully homomorphic encryption scheme that supports multi-bit encryption proposed by Chen Li et al. sat...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Zong-Wu Zhu, Ru-Wei Huang
Formato:	article
Lenguaje:	EN
Publicado:	MDPI AG 2021
Materias:	fully homomorphic encryption secure multi-party computation multi-bit encryption threshold decryption decisional learning with errors Technology T Engineering (General). Civil engineering (General) TA1-2040 Biology (General) QH301-705.5 Physics QC1-999 Chemistry QD1-999
Acceso en línea:	https://doaj.org/article/abb280885c47468fa3fc2d7b6c2b317e
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:abb280885c47468fa3fc2d7b6c2b317e
record_format	dspace
spelling	oai:doaj.org-article:abb280885c47468fa3fc2d7b6c2b317e2021-11-11T15:21:19ZEfficient SMC Protocol Based on Multi-Bit Fully Homomorphic Encryption10.3390/app1121103322076-3417https://doaj.org/article/abb280885c47468fa3fc2d7b6c2b317e2021-11-01T00:00:00Zhttps://www.mdpi.com/2076-3417/11/21/10332https://doaj.org/toc/2076-3417Aiming at the problems of large ciphertext size and low efficiency in the current secure multi-party computation (SMC) protocol based on fully homomorphic encryption (FHE), the paper proves that the fully homomorphic encryption scheme that supports multi-bit encryption proposed by Chen Li et al. satisfies the key homomorphism. Based on this scheme and threshold decryption, a three-round, interactive, leveled, secure multi-party computation protocol under the Common Random String (CRS) model is designed. The protocol is proved to be safe under the semi-honest model and the semi-malicious model. From the non-interactive zero-knowledge proof, it can be concluded that the protocol is also safe under the malicious model. Its security can be attributed to the Decisional Learning With Errors (DLWE) and a variant of this problem (some-are-errorless LWE). Compared with the existing secure multi-party computation protocol based on fully homomorphic encryption under the CRS model, the ciphertext size of this protocol is smaller, the efficiency is higher, the storage overhead is smaller, and the overall performance is better than the existing protocol.Zong-Wu ZhuRu-Wei HuangMDPI AGarticlefully homomorphic encryptionsecure multi-party computationmulti-bit encryptionthreshold decryptiondecisional learning with errorsTechnologyTEngineering (General). Civil engineering (General)TA1-2040Biology (General)QH301-705.5PhysicsQC1-999ChemistryQD1-999ENApplied Sciences, Vol 11, Iss 10332, p 10332 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	fully homomorphic encryption secure multi-party computation multi-bit encryption threshold decryption decisional learning with errors Technology T Engineering (General). Civil engineering (General) TA1-2040 Biology (General) QH301-705.5 Physics QC1-999 Chemistry QD1-999
spellingShingle	fully homomorphic encryption secure multi-party computation multi-bit encryption threshold decryption decisional learning with errors Technology T Engineering (General). Civil engineering (General) TA1-2040 Biology (General) QH301-705.5 Physics QC1-999 Chemistry QD1-999 Zong-Wu Zhu Ru-Wei Huang Efficient SMC Protocol Based on Multi-Bit Fully Homomorphic Encryption
description	Aiming at the problems of large ciphertext size and low efficiency in the current secure multi-party computation (SMC) protocol based on fully homomorphic encryption (FHE), the paper proves that the fully homomorphic encryption scheme that supports multi-bit encryption proposed by Chen Li et al. satisfies the key homomorphism. Based on this scheme and threshold decryption, a three-round, interactive, leveled, secure multi-party computation protocol under the Common Random String (CRS) model is designed. The protocol is proved to be safe under the semi-honest model and the semi-malicious model. From the non-interactive zero-knowledge proof, it can be concluded that the protocol is also safe under the malicious model. Its security can be attributed to the Decisional Learning With Errors (DLWE) and a variant of this problem (some-are-errorless LWE). Compared with the existing secure multi-party computation protocol based on fully homomorphic encryption under the CRS model, the ciphertext size of this protocol is smaller, the efficiency is higher, the storage overhead is smaller, and the overall performance is better than the existing protocol.
format	article
author	Zong-Wu Zhu Ru-Wei Huang
author_facet	Zong-Wu Zhu Ru-Wei Huang
author_sort	Zong-Wu Zhu
title	Efficient SMC Protocol Based on Multi-Bit Fully Homomorphic Encryption
title_short	Efficient SMC Protocol Based on Multi-Bit Fully Homomorphic Encryption
title_full	Efficient SMC Protocol Based on Multi-Bit Fully Homomorphic Encryption
title_fullStr	Efficient SMC Protocol Based on Multi-Bit Fully Homomorphic Encryption
title_full_unstemmed	Efficient SMC Protocol Based on Multi-Bit Fully Homomorphic Encryption
title_sort	efficient smc protocol based on multi-bit fully homomorphic encryption
publisher	MDPI AG
publishDate	2021
url	https://doaj.org/article/abb280885c47468fa3fc2d7b6c2b317e
work_keys_str_mv	AT zongwuzhu efficientsmcprotocolbasedonmultibitfullyhomomorphicencryption AT ruweihuang efficientsmcprotocolbasedonmultibitfullyhomomorphicencryption
_version_	1718435384541577216

Efficient SMC Protocol Based on Multi-Bit Fully Homomorphic Encryption

Ejemplares similares