Font Size: a A A

Studies Secure Multiparty Computation Protocols With State-wide Under The System Based On

Posted on:2015-02-12Degree:MasterType:Thesis
Country:ChinaCandidate:Y MaFull Text:PDF
GTID:2268330431467389Subject:Computer software and theory
Abstract/Summary:PDF Full Text Request
Along with the development of network technology, the rapid development of the Internet makes the calculation mode of the existing greatly changed. The user can calculate their tasks using different cyber source in the network, and along with the idea of protecting the cooperative computing and privacy is being paid more and more attention, Secure Multiparty Computation problem is becoming a research hotspot, and be introduced into various applications.Secure Multiparty Computation(SMC)problem Can be interpreted as:two or more than two participants to jointly compute the completion of a task, and need to input their privacy information during the task. Requirements:in order to ensure the completion of the task, each participant privacy information not being leaked. The problem proposed by A.C.Yao, has been studied by many scholars, its position in the cryptology is becoming more and more important, is of great practical significance to the problem of information security under the network environment to solve.My paper introduces and describes the Gentry’s fully homomorphic encryption system theory, and studied the present situation and research background, the significance. Then research on secure multi-party computation protocol based on homomorphic encryption system, and make the secure multiplication protocol based on Gentry security protocol under the product of the semi honest model, and extended to the secure dot product protocol etc. Then put forward security secure both sum protocol based on the homomorphic system, and try to promote, and put forward some secure multi-party computation protocol, finally analysis the correctness and security of the protocol.In order to verification the feasibility for these protocols, this paper then puts forward application based on previously proposed protocols, namely the millionaires’ problem and secure multi-party data scheduling problem.In the end, we base on the above proposed secure multi-party computation protocol for expansion of the malicious behavior, design model of secure two party computation protocol combined with the bit commitment technology, and discusses its security and validity.
Keywords/Search Tags:SMC, Fully homomorphic encryption, Secure Two-partyComputation, scalar prduct protocol, Bit commitment
PDF Full Text Request
Related items