Efficient SMC Protocol Based on Multi-Bit Fully Homomorphic Encryption

Applied Sciences

Ru-Wei Huang¹  Zong-Wu Zhu¹ 

[1] School of Computer and Electronic Information, Guangxi University, Nanning 530004, China;

关键词: fully homomorphic encryption;    secure multi-party computation;    multi-bit encryption;    threshold decryption;    decisional learning with errors;   

DOI  :  10.3390/app112110332

来源: DOAJ

【 摘 要 】

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.

【 授权许可】

Unknown