Research Of Several Application Problems Based On Secure Multi-Party Computation

Now, internet communication has become one of the main way of people communication. While people frequently communicate on the network, also reveal their privacy. Therefore, protecting people’s private information is very urgent and important.In order to solve the problem of protecting private information, A.C.Yao in1982firstly puts forward the concept of secure multi-party computation. Secure multi-party computation is multiple participants distrust each other and on the basis of protecting their private data, get their desired datum by performing a function calculation. Now secure multi-party computation has become an international research focus in the cryptography field, attracted many scholars study on the problem. SMPC research generally contains two types:the first is the general theory study of SMPC, including the research of safety concept, the research of calculating model, the basic theorem of safety related and the general tools of SMPC protocols and the research of design methods, etc. The second is the research of SMPC applied in the practical problems. The theory research of secure multi-party computation has provided a mass of general tools and design methods for practical application, but the general tools and methods can’t meet the particularity and diversity of the practical application problems. Some special designed protocols satisfy the availability of secure multi-party computation applied in special problems. Some protocols of SMPC applied in the special problems are:computational geometry protocol, data mining protocols and scientific computing protocols, etc. The research of secure multi-party computation in application is very complex and plentiful, but the diversity of the practical problems need more research of secure multi-party computation. Aiming at the problems in the practical application, this paper designs protocols of satisfying secure multi-party computation, and analyzes the correctness of the protocol, security and complexity. The content of the paper are as follows:(1)Research of secure multi-party computation in solving sales problem. First, this paper proposes a sales problem:different manufacturer produces all kinds of products, each manufacturer want to know sales volume of the same products on the market, but don’t open their own datum. Secondly, the sales problem has analyzed, the solution to the sales problem based on semi-honest model is designed; Again, the example is used to verify the feasibility of the protocol; Finally, the correctness of the protocol, security and complexity are analyzed in detail.(2)Research of secure multi-party computation in computing volume of two intersecting spheres. First, this paper introduces problem of the volume in two intersecting spheres, studies and analyzes the problem; Secondly, protocol of computing volume in two intersecting spheres is designed with scalar product protocol, add to multiply protocol and protocol to compute the distance’s square of two spherical center points. Finally, the correctness of the protocol, security and complexity are analyzed in detail.(3)Research of secure multi-party computation in closet-pair of points problem. First, this paper describe closet-pair of points problem, analyzes and studies the problem. Secondly, this paper designs the protocol to closet-pair of points based on the third party C under semi-honest model and security channel. Again, a example is given to illustrate the feasibility of the new protocol. Finally, the correctness of the correctness of the protocol, security and complexity are analyzed.