Computer Science & Technology

A Secure Multi-Party Computation Protocol on the Basis of Multi-Key Homomorphism

Expand
  • 1.Chengdu Institute of Computer Applications,University of Chinese Academy of Sciences,Chengdu 610041,Sichuan,China; 2.School of Mathematics and Computing Science,Guilin University of Electronic Technology,Guilin 541004,Guangxi,China; 3.Chongqing Key Laboratory of Automatic reasoning and Cognition,Chongqing Institute of Green Intelligent Technology,Chinese Academy of Sciences,Chongqing 400714,China; 4.Guangxi Key Laboratory of Trusted Software,Guilin University of Electronic Technology,Guilin 541004,Guangxi,China
王会勇( 1977-) ,男,博士,讲师,主要从事网络信息安全研究.

Received date: 2016-06-07

  Revised date: 2017-03-29

  Online published: 2017-06-01

Supported by

Supported by the National Natural Science Foundation of China ( 61262008,61462017)

Abstract

In order to build a multi-key secure multi-party computation ( SMC) protocol with high performance,the key homomorphic properties of Gentry-Sahai-Waters ( GSW13) fully-homomorphic encryption ( FHE) scheme is in- vestigated.Afterwards,a general multi-key SMC protocol with simple structure,which needs only 3 rounds of inter- actions,is proposed on the basis of leveled GSW13.In the semi-honesty and semi-malicious setting as well as in the common random string model,the security of the protocol relies on the learning with errors ( LWE) problem and a variant of LWE.Then,the difficulty in solving the variant is analyzed,and a formalized security proof in semi- malicious setting is given.The proposed SMC protocol naturally constitutes a leveled multi-key FHE scheme in the same setting.Comparative analysis results show that the proposed protocol is superior to the existing schemes in terms of overall performance.

Cite this article

WANG Hui-yong FENG Yong ZHAO Ling-zhong TANG Shi-jie . A Secure Multi-Party Computation Protocol on the Basis of Multi-Key Homomorphism[J]. Journal of South China University of Technology(Natural Science), 2017 , 45(7) : 69 -76 . DOI: 10.3969/j.issn.1000-565X.2017.07.010

Outlines

/